/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 22:28:24,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 22:28:24,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 22:28:24,895 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 22:28:24,895 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 22:28:24,897 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 22:28:24,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 22:28:24,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 22:28:24,907 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 22:28:24,911 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 22:28:24,912 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 22:28:24,913 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 22:28:24,913 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 22:28:24,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 22:28:24,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 22:28:24,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 22:28:24,919 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 22:28:24,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 22:28:24,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 22:28:24,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 22:28:24,926 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 22:28:24,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 22:28:24,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 22:28:24,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 22:28:24,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 22:28:24,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 22:28:24,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 22:28:24,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 22:28:24,931 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 22:28:24,932 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 22:28:24,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 22:28:24,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 22:28:24,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 22:28:24,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 22:28:24,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 22:28:24,934 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 22:28:24,934 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 22:28:24,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 22:28:24,935 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 22:28:24,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 22:28:24,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 22:28:24,942 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-11 22:28:24,992 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 22:28:24,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 22:28:24,994 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 22:28:24,994 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 22:28:24,995 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 22:28:24,995 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 22:28:24,995 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 22:28:24,995 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 22:28:24,995 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 22:28:24,996 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 22:28:24,996 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 22:28:24,996 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 22:28:24,996 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 22:28:24,996 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 22:28:24,997 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 22:28:24,997 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 22:28:24,997 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 22:28:24,997 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 22:28:24,997 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 22:28:24,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 22:28:24,997 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 22:28:24,997 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 22:28:24,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 22:28:24,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 22:28:24,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 22:28:24,998 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 22:28:24,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 22:28:24,998 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 22:28:24,998 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 22:28:24,998 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 22:28:24,998 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 22:28:24,998 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-11 22:28:25,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 22:28:25,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 22:28:25,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 22:28:25,442 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 22:28:25,442 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 22:28:25,443 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2022-12-11 22:28:26,446 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 22:28:26,592 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 22:28:26,593 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2022-12-11 22:28:26,609 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b298a16d/758c6fa72e5c481c8e8213c7c7808209/FLAGde3774ad6 [2022-12-11 22:28:26,623 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b298a16d/758c6fa72e5c481c8e8213c7c7808209 [2022-12-11 22:28:26,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 22:28:26,626 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 22:28:26,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 22:28:26,627 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 22:28:26,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 22:28:26,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 10:28:26" (1/1) ... [2022-12-11 22:28:26,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@441da4d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:28:26, skipping insertion in model container [2022-12-11 22:28:26,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 10:28:26" (1/1) ... [2022-12-11 22:28:26,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 22:28:26,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 22:28:26,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:28:26,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:28:26,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:28:26,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:28:26,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:28:26,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:28:26,793 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c[2870,2883] [2022-12-11 22:28:26,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 22:28:26,809 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 22:28:26,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:28:26,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:28:26,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:28:26,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:28:26,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:28:26,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:28:26,837 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c[2870,2883] [2022-12-11 22:28:26,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 22:28:26,853 INFO L208 MainTranslator]: Completed translation [2022-12-11 22:28:26,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:28:26 WrapperNode [2022-12-11 22:28:26,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 22:28:26,855 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 22:28:26,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 22:28:26,855 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 22:28:26,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:28:26" (1/1) ... [2022-12-11 22:28:26,872 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:28:26" (1/1) ... [2022-12-11 22:28:26,897 INFO L138 Inliner]: procedures = 25, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 163 [2022-12-11 22:28:26,898 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 22:28:26,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 22:28:26,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 22:28:26,899 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 22:28:26,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:28:26" (1/1) ... [2022-12-11 22:28:26,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:28:26" (1/1) ... [2022-12-11 22:28:26,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:28:26" (1/1) ... [2022-12-11 22:28:26,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:28:26" (1/1) ... [2022-12-11 22:28:26,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:28:26" (1/1) ... [2022-12-11 22:28:26,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:28:26" (1/1) ... [2022-12-11 22:28:26,920 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:28:26" (1/1) ... [2022-12-11 22:28:26,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:28:26" (1/1) ... [2022-12-11 22:28:26,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 22:28:26,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 22:28:26,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 22:28:26,923 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 22:28:26,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:28:26" (1/1) ... [2022-12-11 22:28:26,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 22:28:26,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:28:26,993 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-11 22:28:27,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-11 22:28:27,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 22:28:27,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 22:28:27,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 22:28:27,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-11 22:28:27,036 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-11 22:28:27,036 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-11 22:28:27,036 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-11 22:28:27,036 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-11 22:28:27,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 22:28:27,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 22:28:27,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 22:28:27,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-11 22:28:27,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 22:28:27,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 22:28:27,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 22:28:27,037 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 22:28:27,132 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 22:28:27,133 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 22:28:27,399 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 22:28:27,502 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 22:28:27,503 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-11 22:28:27,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 10:28:27 BoogieIcfgContainer [2022-12-11 22:28:27,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 22:28:27,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 22:28:27,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 22:28:27,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 22:28:27,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 10:28:26" (1/3) ... [2022-12-11 22:28:27,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116083ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 10:28:27, skipping insertion in model container [2022-12-11 22:28:27,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:28:26" (2/3) ... [2022-12-11 22:28:27,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116083ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 10:28:27, skipping insertion in model container [2022-12-11 22:28:27,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 10:28:27" (3/3) ... [2022-12-11 22:28:27,512 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-2-nl.wvr.c [2022-12-11 22:28:27,526 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 22:28:27,526 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-11 22:28:27,526 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 22:28:27,583 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-11 22:28:27,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 133 transitions, 282 flow [2022-12-11 22:28:27,698 INFO L130 PetriNetUnfolder]: 11/131 cut-off events. [2022-12-11 22:28:27,698 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-11 22:28:27,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 131 events. 11/131 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 96. Up to 3 conditions per place. [2022-12-11 22:28:27,703 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 133 transitions, 282 flow [2022-12-11 22:28:27,708 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 123 transitions, 258 flow [2022-12-11 22:28:27,719 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 22:28:27,725 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;@34428cdc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 22:28:27,725 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-11 22:28:27,763 INFO L130 PetriNetUnfolder]: 11/122 cut-off events. [2022-12-11 22:28:27,763 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-11 22:28:27,763 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:28:27,764 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:28:27,765 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:28:27,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:28:27,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1186405957, now seen corresponding path program 1 times [2022-12-11 22:28:27,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:28:27,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105436617] [2022-12-11 22:28:27,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:28:27,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:28:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:28:28,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:28:28,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:28:28,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105436617] [2022-12-11 22:28:28,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105436617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:28:28,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:28:28,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 22:28:28,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542989693] [2022-12-11 22:28:28,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:28:28,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-11 22:28:28,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:28:28,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-11 22:28:28,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-11 22:28:28,048 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 133 [2022-12-11 22:28:28,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 123 transitions, 258 flow. Second operand has 2 states, 2 states have (on average 120.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:28,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:28:28,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 133 [2022-12-11 22:28:28,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:28:28,109 INFO L130 PetriNetUnfolder]: 12/149 cut-off events. [2022-12-11 22:28:28,109 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-11 22:28:28,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 149 events. 12/149 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 203 event pairs, 5 based on Foata normal form. 14/150 useless extension candidates. Maximal degree in co-relation 94. Up to 22 conditions per place. [2022-12-11 22:28:28,111 INFO L137 encePairwiseOnDemand]: 125/133 looper letters, 7 selfloop transitions, 0 changer transitions 4/115 dead transitions. [2022-12-11 22:28:28,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 115 transitions, 256 flow [2022-12-11 22:28:28,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-11 22:28:28,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-11 22:28:28,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 249 transitions. [2022-12-11 22:28:28,122 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9360902255639098 [2022-12-11 22:28:28,125 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 1 predicate places. [2022-12-11 22:28:28,125 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 115 transitions, 256 flow [2022-12-11 22:28:28,127 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 111 transitions, 248 flow [2022-12-11 22:28:28,128 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 111 transitions, 248 flow [2022-12-11 22:28:28,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 120.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:28,129 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:28:28,129 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:28:28,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 22:28:28,131 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:28:28,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:28:28,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1969845943, now seen corresponding path program 1 times [2022-12-11 22:28:28,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:28:28,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376398156] [2022-12-11 22:28:28,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:28:28,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:28:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:28:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:28:28,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:28:28,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376398156] [2022-12-11 22:28:28,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376398156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:28:28,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:28:28,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 22:28:28,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022144470] [2022-12-11 22:28:28,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:28:28,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 22:28:28,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:28:28,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 22:28:28,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-11 22:28:28,459 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 133 [2022-12-11 22:28:28,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 111 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:28,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:28:28,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 133 [2022-12-11 22:28:28,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:28:28,584 INFO L130 PetriNetUnfolder]: 12/179 cut-off events. [2022-12-11 22:28:28,585 INFO L131 PetriNetUnfolder]: For 48/60 co-relation queries the response was YES. [2022-12-11 22:28:28,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 179 events. 12/179 cut-off events. For 48/60 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 290 event pairs, 5 based on Foata normal form. 5/173 useless extension candidates. Maximal degree in co-relation 144. Up to 31 conditions per place. [2022-12-11 22:28:28,587 INFO L137 encePairwiseOnDemand]: 123/133 looper letters, 19 selfloop transitions, 6 changer transitions 3/118 dead transitions. [2022-12-11 22:28:28,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 118 transitions, 328 flow [2022-12-11 22:28:28,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 22:28:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 22:28:28,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 752 transitions. [2022-12-11 22:28:28,594 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.807733619763695 [2022-12-11 22:28:28,595 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 3 predicate places. [2022-12-11 22:28:28,595 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 118 transitions, 328 flow [2022-12-11 22:28:28,597 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 115 transitions, 306 flow [2022-12-11 22:28:28,597 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 115 transitions, 306 flow [2022-12-11 22:28:28,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:28,597 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:28:28,598 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:28:28,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 22:28:28,598 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:28:28,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:28:28,599 INFO L85 PathProgramCache]: Analyzing trace with hash -171623324, now seen corresponding path program 1 times [2022-12-11 22:28:28,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:28:28,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453385293] [2022-12-11 22:28:28,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:28:28,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:28:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:28:28,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 22:28:28,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:28:28,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453385293] [2022-12-11 22:28:28,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453385293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:28:28,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:28:28,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 22:28:28,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787934996] [2022-12-11 22:28:28,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:28:28,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 22:28:28,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:28:28,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 22:28:28,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 22:28:28,827 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 133 [2022-12-11 22:28:28,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 115 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:28,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:28:28,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 133 [2022-12-11 22:28:28,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:28:28,859 INFO L130 PetriNetUnfolder]: 12/152 cut-off events. [2022-12-11 22:28:28,859 INFO L131 PetriNetUnfolder]: For 68/80 co-relation queries the response was YES. [2022-12-11 22:28:28,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 152 events. 12/152 cut-off events. For 68/80 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 185 event pairs, 1 based on Foata normal form. 1/147 useless extension candidates. Maximal degree in co-relation 135. Up to 30 conditions per place. [2022-12-11 22:28:28,862 INFO L137 encePairwiseOnDemand]: 129/133 looper letters, 11 selfloop transitions, 3 changer transitions 0/118 dead transitions. [2022-12-11 22:28:28,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 118 transitions, 355 flow [2022-12-11 22:28:28,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 22:28:28,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 22:28:28,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2022-12-11 22:28:28,864 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8872180451127819 [2022-12-11 22:28:28,865 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 4 predicate places. [2022-12-11 22:28:28,865 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 118 transitions, 355 flow [2022-12-11 22:28:28,868 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 118 transitions, 355 flow [2022-12-11 22:28:28,868 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 118 transitions, 355 flow [2022-12-11 22:28:28,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:28,869 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:28:28,869 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:28:28,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 22:28:28,869 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:28:28,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:28:28,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1367103436, now seen corresponding path program 2 times [2022-12-11 22:28:28,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:28:28,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733662626] [2022-12-11 22:28:28,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:28:28,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:28:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:28:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 22:28:29,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:28:29,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733662626] [2022-12-11 22:28:29,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733662626] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:28:29,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:28:29,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-11 22:28:29,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519793420] [2022-12-11 22:28:29,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:28:29,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-11 22:28:29,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:28:29,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-11 22:28:29,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-12-11 22:28:29,554 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2022-12-11 22:28:29,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 118 transitions, 355 flow. Second operand has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:29,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:28:29,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2022-12-11 22:28:29,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:28:29,926 INFO L130 PetriNetUnfolder]: 125/436 cut-off events. [2022-12-11 22:28:29,927 INFO L131 PetriNetUnfolder]: For 610/658 co-relation queries the response was YES. [2022-12-11 22:28:29,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 436 events. 125/436 cut-off events. For 610/658 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1898 event pairs, 17 based on Foata normal form. 4/413 useless extension candidates. Maximal degree in co-relation 718. Up to 170 conditions per place. [2022-12-11 22:28:29,929 INFO L137 encePairwiseOnDemand]: 116/133 looper letters, 71 selfloop transitions, 23 changer transitions 6/172 dead transitions. [2022-12-11 22:28:29,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 172 transitions, 810 flow [2022-12-11 22:28:29,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-11 22:28:29,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-11 22:28:29,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1485 transitions. [2022-12-11 22:28:29,932 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6203007518796992 [2022-12-11 22:28:29,932 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 21 predicate places. [2022-12-11 22:28:29,932 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 172 transitions, 810 flow [2022-12-11 22:28:29,935 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 166 transitions, 768 flow [2022-12-11 22:28:29,935 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 166 transitions, 768 flow [2022-12-11 22:28:29,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:29,936 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:28:29,936 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:28:29,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 22:28:29,937 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:28:29,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:28:29,937 INFO L85 PathProgramCache]: Analyzing trace with hash -2143978950, now seen corresponding path program 3 times [2022-12-11 22:28:29,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:28:29,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088126416] [2022-12-11 22:28:29,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:28:29,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:28:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:28:30,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 22:28:30,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:28:30,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088126416] [2022-12-11 22:28:30,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088126416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:28:30,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:28:30,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-11 22:28:30,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013467022] [2022-12-11 22:28:30,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:28:30,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-11 22:28:30,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:28:30,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-11 22:28:30,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-12-11 22:28:30,510 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2022-12-11 22:28:30,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 166 transitions, 768 flow. Second operand has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:30,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:28:30,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2022-12-11 22:28:30,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:28:30,820 INFO L130 PetriNetUnfolder]: 136/487 cut-off events. [2022-12-11 22:28:30,821 INFO L131 PetriNetUnfolder]: For 953/1120 co-relation queries the response was YES. [2022-12-11 22:28:30,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1490 conditions, 487 events. 136/487 cut-off events. For 953/1120 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2301 event pairs, 26 based on Foata normal form. 17/475 useless extension candidates. Maximal degree in co-relation 1025. Up to 214 conditions per place. [2022-12-11 22:28:30,823 INFO L137 encePairwiseOnDemand]: 116/133 looper letters, 84 selfloop transitions, 29 changer transitions 6/191 dead transitions. [2022-12-11 22:28:30,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 191 transitions, 1178 flow [2022-12-11 22:28:30,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 22:28:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 22:28:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1325 transitions. [2022-12-11 22:28:30,826 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6226503759398496 [2022-12-11 22:28:30,826 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 33 predicate places. [2022-12-11 22:28:30,827 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 191 transitions, 1178 flow [2022-12-11 22:28:30,829 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 185 transitions, 1124 flow [2022-12-11 22:28:30,829 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 185 transitions, 1124 flow [2022-12-11 22:28:30,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:30,830 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:28:30,830 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:28:30,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 22:28:30,830 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:28:30,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:28:30,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1080509654, now seen corresponding path program 4 times [2022-12-11 22:28:30,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:28:30,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971493755] [2022-12-11 22:28:30,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:28:30,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:28:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:28:31,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 22:28:31,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:28:31,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971493755] [2022-12-11 22:28:31,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971493755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:28:31,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:28:31,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-11 22:28:31,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818572770] [2022-12-11 22:28:31,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:28:31,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-11 22:28:31,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:28:31,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-11 22:28:31,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-12-11 22:28:31,299 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2022-12-11 22:28:31,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 185 transitions, 1124 flow. Second operand has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:31,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:28:31,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2022-12-11 22:28:31,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:28:31,642 INFO L130 PetriNetUnfolder]: 140/511 cut-off events. [2022-12-11 22:28:31,642 INFO L131 PetriNetUnfolder]: For 1356/1635 co-relation queries the response was YES. [2022-12-11 22:28:31,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1890 conditions, 511 events. 140/511 cut-off events. For 1356/1635 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2514 event pairs, 28 based on Foata normal form. 10/493 useless extension candidates. Maximal degree in co-relation 1290. Up to 233 conditions per place. [2022-12-11 22:28:31,645 INFO L137 encePairwiseOnDemand]: 116/133 looper letters, 92 selfloop transitions, 35 changer transitions 6/205 dead transitions. [2022-12-11 22:28:31,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 205 transitions, 1564 flow [2022-12-11 22:28:31,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 22:28:31,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 22:28:31,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1327 transitions. [2022-12-11 22:28:31,661 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6235902255639098 [2022-12-11 22:28:31,662 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 45 predicate places. [2022-12-11 22:28:31,662 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 205 transitions, 1564 flow [2022-12-11 22:28:31,665 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 199 transitions, 1498 flow [2022-12-11 22:28:31,665 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 199 transitions, 1498 flow [2022-12-11 22:28:31,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:31,666 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:28:31,666 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:28:31,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 22:28:31,666 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:28:31,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:28:31,666 INFO L85 PathProgramCache]: Analyzing trace with hash -673627656, now seen corresponding path program 5 times [2022-12-11 22:28:31,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:28:31,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20398997] [2022-12-11 22:28:31,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:28:31,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:28:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:28:32,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 22:28:32,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:28:32,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20398997] [2022-12-11 22:28:32,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20398997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:28:32,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:28:32,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-11 22:28:32,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152419060] [2022-12-11 22:28:32,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:28:32,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-11 22:28:32,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:28:32,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-11 22:28:32,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-12-11 22:28:32,079 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2022-12-11 22:28:32,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 199 transitions, 1498 flow. Second operand has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:32,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:28:32,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2022-12-11 22:28:32,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:28:32,343 INFO L130 PetriNetUnfolder]: 141/515 cut-off events. [2022-12-11 22:28:32,343 INFO L131 PetriNetUnfolder]: For 1835/2375 co-relation queries the response was YES. [2022-12-11 22:28:32,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2243 conditions, 515 events. 141/515 cut-off events. For 1835/2375 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2553 event pairs, 50 based on Foata normal form. 22/507 useless extension candidates. Maximal degree in co-relation 1566. Up to 240 conditions per place. [2022-12-11 22:28:32,347 INFO L137 encePairwiseOnDemand]: 116/133 looper letters, 100 selfloop transitions, 30 changer transitions 7/209 dead transitions. [2022-12-11 22:28:32,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 209 transitions, 1876 flow [2022-12-11 22:28:32,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 22:28:32,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 22:28:32,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1320 transitions. [2022-12-11 22:28:32,349 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6203007518796992 [2022-12-11 22:28:32,350 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 57 predicate places. [2022-12-11 22:28:32,350 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 209 transitions, 1876 flow [2022-12-11 22:28:32,352 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 202 transitions, 1788 flow [2022-12-11 22:28:32,353 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 202 transitions, 1788 flow [2022-12-11 22:28:32,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:32,353 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:28:32,353 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:28:32,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 22:28:32,353 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:28:32,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:28:32,354 INFO L85 PathProgramCache]: Analyzing trace with hash 867246164, now seen corresponding path program 6 times [2022-12-11 22:28:32,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:28:32,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919689171] [2022-12-11 22:28:32,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:28:32,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:28:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:28:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 22:28:32,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:28:32,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919689171] [2022-12-11 22:28:32,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919689171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:28:32,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:28:32,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-11 22:28:32,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018495903] [2022-12-11 22:28:32,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:28:32,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-11 22:28:32,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:28:32,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-11 22:28:32,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-12-11 22:28:32,887 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2022-12-11 22:28:32,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 202 transitions, 1788 flow. Second operand has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:32,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:28:32,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2022-12-11 22:28:32,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:28:33,140 INFO L130 PetriNetUnfolder]: 144/522 cut-off events. [2022-12-11 22:28:33,140 INFO L131 PetriNetUnfolder]: For 2319/2725 co-relation queries the response was YES. [2022-12-11 22:28:33,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2628 conditions, 522 events. 144/522 cut-off events. For 2319/2725 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2626 event pairs, 28 based on Foata normal form. 22/514 useless extension candidates. Maximal degree in co-relation 1825. Up to 253 conditions per place. [2022-12-11 22:28:33,145 INFO L137 encePairwiseOnDemand]: 116/133 looper letters, 102 selfloop transitions, 31 changer transitions 6/211 dead transitions. [2022-12-11 22:28:33,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 211 transitions, 2189 flow [2022-12-11 22:28:33,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 22:28:33,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 22:28:33,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1322 transitions. [2022-12-11 22:28:33,149 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6212406015037594 [2022-12-11 22:28:33,151 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 68 predicate places. [2022-12-11 22:28:33,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 211 transitions, 2189 flow [2022-12-11 22:28:33,155 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 205 transitions, 2099 flow [2022-12-11 22:28:33,155 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 205 transitions, 2099 flow [2022-12-11 22:28:33,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:33,155 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:28:33,156 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:28:33,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 22:28:33,156 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:28:33,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:28:33,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2072791624, now seen corresponding path program 7 times [2022-12-11 22:28:33,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:28:33,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893952341] [2022-12-11 22:28:33,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:28:33,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:28:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:28:33,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 22:28:33,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:28:33,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893952341] [2022-12-11 22:28:33,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893952341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:28:33,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:28:33,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-11 22:28:33,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920243232] [2022-12-11 22:28:33,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:28:33,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-11 22:28:33,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:28:33,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-11 22:28:33,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-12-11 22:28:33,661 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2022-12-11 22:28:33,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 205 transitions, 2099 flow. Second operand has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:33,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:28:33,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2022-12-11 22:28:33,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:28:33,943 INFO L130 PetriNetUnfolder]: 148/543 cut-off events. [2022-12-11 22:28:33,943 INFO L131 PetriNetUnfolder]: For 3147/3585 co-relation queries the response was YES. [2022-12-11 22:28:33,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3083 conditions, 543 events. 148/543 cut-off events. For 3147/3585 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2867 event pairs, 25 based on Foata normal form. 24/539 useless extension candidates. Maximal degree in co-relation 2110. Up to 265 conditions per place. [2022-12-11 22:28:33,948 INFO L137 encePairwiseOnDemand]: 116/133 looper letters, 105 selfloop transitions, 36 changer transitions 6/219 dead transitions. [2022-12-11 22:28:33,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 219 transitions, 2621 flow [2022-12-11 22:28:33,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-11 22:28:33,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-11 22:28:33,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1403 transitions. [2022-12-11 22:28:33,952 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6205218929677134 [2022-12-11 22:28:33,954 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 81 predicate places. [2022-12-11 22:28:33,954 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 219 transitions, 2621 flow [2022-12-11 22:28:33,959 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 213 transitions, 2519 flow [2022-12-11 22:28:33,959 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 213 transitions, 2519 flow [2022-12-11 22:28:33,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:33,960 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:28:33,960 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:28:33,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 22:28:33,960 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:28:33,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:28:33,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1709835678, now seen corresponding path program 8 times [2022-12-11 22:28:33,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:28:33,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590397697] [2022-12-11 22:28:33,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:28:33,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:28:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:28:34,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 22:28:34,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:28:34,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590397697] [2022-12-11 22:28:34,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590397697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:28:34,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:28:34,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-11 22:28:34,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375837549] [2022-12-11 22:28:34,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:28:34,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-11 22:28:34,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:28:34,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-11 22:28:34,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-12-11 22:28:34,411 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2022-12-11 22:28:34,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 213 transitions, 2519 flow. Second operand has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:34,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:28:34,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2022-12-11 22:28:34,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:28:34,677 INFO L130 PetriNetUnfolder]: 149/548 cut-off events. [2022-12-11 22:28:34,677 INFO L131 PetriNetUnfolder]: For 3808/4308 co-relation queries the response was YES. [2022-12-11 22:28:34,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3471 conditions, 548 events. 149/548 cut-off events. For 3808/4308 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2898 event pairs, 28 based on Foata normal form. 17/537 useless extension candidates. Maximal degree in co-relation 2412. Up to 266 conditions per place. [2022-12-11 22:28:34,682 INFO L137 encePairwiseOnDemand]: 116/133 looper letters, 112 selfloop transitions, 32 changer transitions 7/223 dead transitions. [2022-12-11 22:28:34,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 223 transitions, 2985 flow [2022-12-11 22:28:34,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 22:28:34,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 22:28:34,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1322 transitions. [2022-12-11 22:28:34,684 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6212406015037594 [2022-12-11 22:28:34,684 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 93 predicate places. [2022-12-11 22:28:34,684 INFO L82 GeneralOperation]: Start removeDead. Operand has 212 places, 223 transitions, 2985 flow [2022-12-11 22:28:34,688 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 208 places, 216 transitions, 2855 flow [2022-12-11 22:28:34,688 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 216 transitions, 2855 flow [2022-12-11 22:28:34,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:34,689 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:28:34,689 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:28:34,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 22:28:34,689 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:28:34,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:28:34,689 INFO L85 PathProgramCache]: Analyzing trace with hash 976237788, now seen corresponding path program 9 times [2022-12-11 22:28:34,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:28:34,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403578739] [2022-12-11 22:28:34,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:28:34,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:28:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:28:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 22:28:35,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:28:35,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403578739] [2022-12-11 22:28:35,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403578739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:28:35,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:28:35,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-11 22:28:35,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328533090] [2022-12-11 22:28:35,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:28:35,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-11 22:28:35,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:28:35,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-11 22:28:35,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-12-11 22:28:35,133 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2022-12-11 22:28:35,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 216 transitions, 2855 flow. Second operand has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:35,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:28:35,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2022-12-11 22:28:35,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:28:35,414 INFO L130 PetriNetUnfolder]: 152/557 cut-off events. [2022-12-11 22:28:35,414 INFO L131 PetriNetUnfolder]: For 4928/5726 co-relation queries the response was YES. [2022-12-11 22:28:35,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3898 conditions, 557 events. 152/557 cut-off events. For 4928/5726 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2962 event pairs, 27 based on Foata normal form. 22/550 useless extension candidates. Maximal degree in co-relation 2687. Up to 273 conditions per place. [2022-12-11 22:28:35,419 INFO L137 encePairwiseOnDemand]: 116/133 looper letters, 114 selfloop transitions, 33 changer transitions 6/225 dead transitions. [2022-12-11 22:28:35,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 225 transitions, 3338 flow [2022-12-11 22:28:35,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 22:28:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 22:28:35,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1324 transitions. [2022-12-11 22:28:35,420 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6221804511278195 [2022-12-11 22:28:35,421 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 104 predicate places. [2022-12-11 22:28:35,421 INFO L82 GeneralOperation]: Start removeDead. Operand has 223 places, 225 transitions, 3338 flow [2022-12-11 22:28:35,425 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 219 transitions, 3212 flow [2022-12-11 22:28:35,425 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 219 transitions, 3212 flow [2022-12-11 22:28:35,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:35,426 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:28:35,426 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:28:35,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 22:28:35,426 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:28:35,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:28:35,426 INFO L85 PathProgramCache]: Analyzing trace with hash -355134162, now seen corresponding path program 10 times [2022-12-11 22:28:35,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:28:35,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986188010] [2022-12-11 22:28:35,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:28:35,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:28:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:28:35,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 22:28:35,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:28:35,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986188010] [2022-12-11 22:28:35,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986188010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:28:35,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:28:35,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-11 22:28:35,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741303930] [2022-12-11 22:28:35,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:28:35,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-11 22:28:35,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:28:35,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-11 22:28:35,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-12-11 22:28:35,805 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2022-12-11 22:28:35,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 219 transitions, 3212 flow. Second operand has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:35,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:28:35,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2022-12-11 22:28:35,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:28:36,096 INFO L130 PetriNetUnfolder]: 154/563 cut-off events. [2022-12-11 22:28:36,096 INFO L131 PetriNetUnfolder]: For 5858/6660 co-relation queries the response was YES. [2022-12-11 22:28:36,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4334 conditions, 563 events. 154/563 cut-off events. For 5858/6660 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3063 event pairs, 25 based on Foata normal form. 14/548 useless extension candidates. Maximal degree in co-relation 3538. Up to 279 conditions per place. [2022-12-11 22:28:36,103 INFO L137 encePairwiseOnDemand]: 116/133 looper letters, 114 selfloop transitions, 39 changer transitions 6/231 dead transitions. [2022-12-11 22:28:36,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 231 transitions, 3806 flow [2022-12-11 22:28:36,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-11 22:28:36,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-11 22:28:36,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1405 transitions. [2022-12-11 22:28:36,105 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6214064573197701 [2022-12-11 22:28:36,105 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 117 predicate places. [2022-12-11 22:28:36,105 INFO L82 GeneralOperation]: Start removeDead. Operand has 236 places, 231 transitions, 3806 flow [2022-12-11 22:28:36,112 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 225 transitions, 3668 flow [2022-12-11 22:28:36,112 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 225 transitions, 3668 flow [2022-12-11 22:28:36,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:36,113 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:28:36,113 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:28:36,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-11 22:28:36,113 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:28:36,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:28:36,114 INFO L85 PathProgramCache]: Analyzing trace with hash 500479462, now seen corresponding path program 11 times [2022-12-11 22:28:36,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:28:36,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272242527] [2022-12-11 22:28:36,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:28:36,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:28:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:28:36,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 22:28:36,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:28:36,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272242527] [2022-12-11 22:28:36,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272242527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:28:36,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:28:36,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-11 22:28:36,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156444346] [2022-12-11 22:28:36,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:28:36,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-11 22:28:36,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:28:36,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-11 22:28:36,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-12-11 22:28:36,485 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2022-12-11 22:28:36,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 225 transitions, 3668 flow. Second operand has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:36,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:28:36,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2022-12-11 22:28:36,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:28:36,770 INFO L130 PetriNetUnfolder]: 155/576 cut-off events. [2022-12-11 22:28:36,770 INFO L131 PetriNetUnfolder]: For 6964/8001 co-relation queries the response was YES. [2022-12-11 22:28:36,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4758 conditions, 576 events. 155/576 cut-off events. For 6964/8001 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3127 event pairs, 50 based on Foata normal form. 12/558 useless extension candidates. Maximal degree in co-relation 3303. Up to 280 conditions per place. [2022-12-11 22:28:36,778 INFO L137 encePairwiseOnDemand]: 116/133 looper letters, 121 selfloop transitions, 35 changer transitions 7/235 dead transitions. [2022-12-11 22:28:36,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 235 transitions, 4218 flow [2022-12-11 22:28:36,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 22:28:36,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 22:28:36,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1324 transitions. [2022-12-11 22:28:36,780 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6221804511278195 [2022-12-11 22:28:36,781 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 129 predicate places. [2022-12-11 22:28:36,781 INFO L82 GeneralOperation]: Start removeDead. Operand has 248 places, 235 transitions, 4218 flow [2022-12-11 22:28:36,786 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 244 places, 228 transitions, 4046 flow [2022-12-11 22:28:36,787 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 228 transitions, 4046 flow [2022-12-11 22:28:36,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:36,788 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:28:36,788 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:28:36,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-11 22:28:36,788 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:28:36,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:28:36,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1804628046, now seen corresponding path program 12 times [2022-12-11 22:28:36,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:28:36,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240753668] [2022-12-11 22:28:36,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:28:36,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:28:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:28:37,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 22:28:37,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:28:37,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240753668] [2022-12-11 22:28:37,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240753668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:28:37,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:28:37,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-11 22:28:37,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58332710] [2022-12-11 22:28:37,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:28:37,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-11 22:28:37,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:28:37,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-11 22:28:37,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-12-11 22:28:37,177 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 133 [2022-12-11 22:28:37,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 228 transitions, 4046 flow. Second operand has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:37,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:28:37,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 133 [2022-12-11 22:28:37,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:28:37,473 INFO L130 PetriNetUnfolder]: 158/582 cut-off events. [2022-12-11 22:28:37,473 INFO L131 PetriNetUnfolder]: For 8237/9468 co-relation queries the response was YES. [2022-12-11 22:28:37,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5216 conditions, 582 events. 158/582 cut-off events. For 8237/9468 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3147 event pairs, 51 based on Foata normal form. 12/564 useless extension candidates. Maximal degree in co-relation 3586. Up to 287 conditions per place. [2022-12-11 22:28:37,478 INFO L137 encePairwiseOnDemand]: 116/133 looper letters, 123 selfloop transitions, 36 changer transitions 6/237 dead transitions. [2022-12-11 22:28:37,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 237 transitions, 4607 flow [2022-12-11 22:28:37,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 22:28:37,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 22:28:37,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1326 transitions. [2022-12-11 22:28:37,479 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6231203007518797 [2022-12-11 22:28:37,480 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 140 predicate places. [2022-12-11 22:28:37,481 INFO L82 GeneralOperation]: Start removeDead. Operand has 259 places, 237 transitions, 4607 flow [2022-12-11 22:28:37,485 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 256 places, 231 transitions, 4445 flow [2022-12-11 22:28:37,485 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 231 transitions, 4445 flow [2022-12-11 22:28:37,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.3125) internal successors, (1269), 16 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:37,486 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:28:37,486 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:28:37,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-11 22:28:37,487 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:28:37,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:28:37,487 INFO L85 PathProgramCache]: Analyzing trace with hash 2005093810, now seen corresponding path program 1 times [2022-12-11 22:28:37,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:28:37,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230592170] [2022-12-11 22:28:37,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:28:37,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:28:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:28:37,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 22:28:37,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:28:37,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230592170] [2022-12-11 22:28:37,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230592170] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:28:37,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247668954] [2022-12-11 22:28:37,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:28:37,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:28:37,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:28:37,598 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:28:37,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-11 22:28:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:28:37,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-11 22:28:37,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:28:37,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 22:28:37,838 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-11 22:28:37,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247668954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:28:37,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-11 22:28:37,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-12-11 22:28:37,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186509475] [2022-12-11 22:28:37,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:28:37,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-11 22:28:37,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:28:37,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-11 22:28:37,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-11 22:28:37,839 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 133 [2022-12-11 22:28:37,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 231 transitions, 4445 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:37,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:28:37,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 133 [2022-12-11 22:28:37,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:28:37,962 INFO L130 PetriNetUnfolder]: 229/806 cut-off events. [2022-12-11 22:28:37,962 INFO L131 PetriNetUnfolder]: For 13215/14403 co-relation queries the response was YES. [2022-12-11 22:28:37,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7609 conditions, 806 events. 229/806 cut-off events. For 13215/14403 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4851 event pairs, 117 based on Foata normal form. 41/790 useless extension candidates. Maximal degree in co-relation 5704. Up to 471 conditions per place. [2022-12-11 22:28:37,967 INFO L137 encePairwiseOnDemand]: 129/133 looper letters, 18 selfloop transitions, 11 changer transitions 79/229 dead transitions. [2022-12-11 22:28:37,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 229 transitions, 4555 flow [2022-12-11 22:28:37,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-11 22:28:37,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-11 22:28:37,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2022-12-11 22:28:37,971 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8928571428571429 [2022-12-11 22:28:37,971 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 140 predicate places. [2022-12-11 22:28:37,971 INFO L82 GeneralOperation]: Start removeDead. Operand has 259 places, 229 transitions, 4555 flow [2022-12-11 22:28:37,976 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 211 places, 150 transitions, 2304 flow [2022-12-11 22:28:37,976 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 150 transitions, 2304 flow [2022-12-11 22:28:37,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:37,977 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:28:37,977 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:28:38,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-11 22:28:38,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-11 22:28:38,184 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:28:38,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:28:38,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1795670401, now seen corresponding path program 1 times [2022-12-11 22:28:38,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:28:38,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617312949] [2022-12-11 22:28:38,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:28:38,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:28:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:28:38,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:28:38,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:28:38,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617312949] [2022-12-11 22:28:38,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617312949] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:28:38,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661221609] [2022-12-11 22:28:38,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:28:38,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:28:38,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:28:38,295 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:28:38,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-11 22:28:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:28:38,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-11 22:28:38,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:28:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:28:38,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:28:38,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:28:38,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661221609] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:28:38,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:28:38,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-12-11 22:28:38,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522599135] [2022-12-11 22:28:38,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:28:38,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-11 22:28:38,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:28:38,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-11 22:28:38,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-12-11 22:28:38,738 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 133 [2022-12-11 22:28:38,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 150 transitions, 2304 flow. Second operand has 19 states, 19 states have (on average 102.63157894736842) internal successors, (1950), 19 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:38,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:28:38,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 133 [2022-12-11 22:28:38,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:28:38,978 INFO L130 PetriNetUnfolder]: 242/789 cut-off events. [2022-12-11 22:28:38,978 INFO L131 PetriNetUnfolder]: For 7968/8268 co-relation queries the response was YES. [2022-12-11 22:28:38,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7627 conditions, 789 events. 242/789 cut-off events. For 7968/8268 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3866 event pairs, 124 based on Foata normal form. 22/742 useless extension candidates. Maximal degree in co-relation 4824. Up to 462 conditions per place. [2022-12-11 22:28:38,983 INFO L137 encePairwiseOnDemand]: 121/133 looper letters, 40 selfloop transitions, 11 changer transitions 12/167 dead transitions. [2022-12-11 22:28:38,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 167 transitions, 2819 flow [2022-12-11 22:28:38,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-11 22:28:38,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-11 22:28:38,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1241 transitions. [2022-12-11 22:28:38,985 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7775689223057645 [2022-12-11 22:28:38,986 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 103 predicate places. [2022-12-11 22:28:38,986 INFO L82 GeneralOperation]: Start removeDead. Operand has 222 places, 167 transitions, 2819 flow [2022-12-11 22:28:38,991 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 155 transitions, 2424 flow [2022-12-11 22:28:38,991 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 155 transitions, 2424 flow [2022-12-11 22:28:38,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 102.63157894736842) internal successors, (1950), 19 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:38,992 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:28:38,992 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:28:39,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-11 22:28:39,197 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,SelfDestructingSolverStorable15 [2022-12-11 22:28:39,198 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:28:39,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:28:39,198 INFO L85 PathProgramCache]: Analyzing trace with hash 637139288, now seen corresponding path program 2 times [2022-12-11 22:28:39,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:28:39,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992884170] [2022-12-11 22:28:39,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:28:39,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:28:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:28:39,798 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:28:39,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:28:39,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992884170] [2022-12-11 22:28:39,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992884170] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:28:39,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086808168] [2022-12-11 22:28:39,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 22:28:39,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:28:39,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:28:39,800 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:28:39,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-11 22:28:39,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-11 22:28:39,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:28:39,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-11 22:28:39,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:28:40,643 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-11 22:28:40,644 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 23 treesize of output 10 [2022-12-11 22:28:40,713 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:28:40,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:28:40,828 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-11 22:28:40,829 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 25 treesize of output 16 [2022-12-11 22:28:41,465 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:28:41,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086808168] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:28:41,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:28:41,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 18] total 50 [2022-12-11 22:28:41,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128085277] [2022-12-11 22:28:41,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:28:41,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-12-11 22:28:41,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:28:41,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-12-11 22:28:41,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=2000, Unknown=0, NotChecked=0, Total=2450 [2022-12-11 22:28:41,469 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 133 [2022-12-11 22:28:41,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 155 transitions, 2424 flow. Second operand has 50 states, 50 states have (on average 57.42) internal successors, (2871), 50 states have internal predecessors, (2871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:41,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:28:41,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 133 [2022-12-11 22:28:41,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:28:44,751 INFO L130 PetriNetUnfolder]: 2527/5686 cut-off events. [2022-12-11 22:28:44,751 INFO L131 PetriNetUnfolder]: For 68499/69354 co-relation queries the response was YES. [2022-12-11 22:28:44,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56680 conditions, 5686 events. 2527/5686 cut-off events. For 68499/69354 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 47237 event pairs, 598 based on Foata normal form. 138/5278 useless extension candidates. Maximal degree in co-relation 32277. Up to 3692 conditions per place. [2022-12-11 22:28:44,798 INFO L137 encePairwiseOnDemand]: 103/133 looper letters, 334 selfloop transitions, 115 changer transitions 34/535 dead transitions. [2022-12-11 22:28:44,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 535 transitions, 12384 flow [2022-12-11 22:28:44,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-12-11 22:28:44,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2022-12-11 22:28:44,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 3399 transitions. [2022-12-11 22:28:44,808 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46466165413533833 [2022-12-11 22:28:44,809 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 155 predicate places. [2022-12-11 22:28:44,809 INFO L82 GeneralOperation]: Start removeDead. Operand has 274 places, 535 transitions, 12384 flow [2022-12-11 22:28:44,841 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 274 places, 501 transitions, 11467 flow [2022-12-11 22:28:44,841 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 501 transitions, 11467 flow [2022-12-11 22:28:44,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 57.42) internal successors, (2871), 50 states have internal predecessors, (2871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:44,842 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:28:44,842 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:28:44,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-11 22:28:45,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:28:45,048 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:28:45,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:28:45,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1956712862, now seen corresponding path program 3 times [2022-12-11 22:28:45,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:28:45,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513055075] [2022-12-11 22:28:45,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:28:45,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:28:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:28:46,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:28:46,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:28:46,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513055075] [2022-12-11 22:28:46,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513055075] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:28:46,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653418841] [2022-12-11 22:28:46,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-11 22:28:46,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:28:46,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:28:46,209 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:28:46,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-11 22:28:46,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-11 22:28:46,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:28:46,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-11 22:28:46,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:28:46,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 [2022-12-11 22:28:46,482 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-11 22:28:46,482 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 11 treesize of output 11 [2022-12-11 22:28:46,840 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 18 treesize of output 20 [2022-12-11 22:28:46,992 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-11 22:28:46,992 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 23 treesize of output 10 [2022-12-11 22:28:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 22:28:47,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:28:47,178 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:28:47,178 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 45 treesize of output 41 [2022-12-11 22:28:47,181 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 24 treesize of output 18 [2022-12-11 22:28:47,633 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 22:28:47,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653418841] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:28:47,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:28:47,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 12, 12] total 42 [2022-12-11 22:28:47,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055393761] [2022-12-11 22:28:47,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:28:47,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-11 22:28:47,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:28:47,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-11 22:28:47,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1610, Unknown=0, NotChecked=0, Total=1722 [2022-12-11 22:28:47,636 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 133 [2022-12-11 22:28:47,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 501 transitions, 11467 flow. Second operand has 42 states, 42 states have (on average 56.714285714285715) internal successors, (2382), 42 states have internal predecessors, (2382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:47,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:28:47,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 133 [2022-12-11 22:28:47,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:28:51,666 INFO L130 PetriNetUnfolder]: 2434/5571 cut-off events. [2022-12-11 22:28:51,666 INFO L131 PetriNetUnfolder]: For 75180/76077 co-relation queries the response was YES. [2022-12-11 22:28:51,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58763 conditions, 5571 events. 2434/5571 cut-off events. For 75180/76077 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 45005 event pairs, 633 based on Foata normal form. 24/5248 useless extension candidates. Maximal degree in co-relation 28219. Up to 3627 conditions per place. [2022-12-11 22:28:51,846 INFO L137 encePairwiseOnDemand]: 107/133 looper letters, 382 selfloop transitions, 101 changer transitions 2/599 dead transitions. [2022-12-11 22:28:51,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 599 transitions, 14616 flow [2022-12-11 22:28:51,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-11 22:28:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-12-11 22:28:51,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 2342 transitions. [2022-12-11 22:28:51,849 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4294883550339263 [2022-12-11 22:28:51,849 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 195 predicate places. [2022-12-11 22:28:51,849 INFO L82 GeneralOperation]: Start removeDead. Operand has 314 places, 599 transitions, 14616 flow [2022-12-11 22:28:51,938 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 314 places, 597 transitions, 14547 flow [2022-12-11 22:28:51,939 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 597 transitions, 14547 flow [2022-12-11 22:28:51,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 56.714285714285715) internal successors, (2382), 42 states have internal predecessors, (2382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:28:51,939 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:28:51,940 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:28:51,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-11 22:28:52,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-11 22:28:52,145 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:28:52,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:28:52,146 INFO L85 PathProgramCache]: Analyzing trace with hash -667464210, now seen corresponding path program 1 times [2022-12-11 22:28:52,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:28:52,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732222764] [2022-12-11 22:28:52,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:28:52,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:28:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:28:53,718 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:28:53,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:28:53,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732222764] [2022-12-11 22:28:53,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732222764] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:28:53,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098451042] [2022-12-11 22:28:53,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:28:53,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:28:53,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:28:53,724 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:28:53,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-11 22:28:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:28:53,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 89 conjunts are in the unsatisfiable core [2022-12-11 22:28:53,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:28:53,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 [2022-12-11 22:28:54,379 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-11 22:28:54,379 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 11 treesize of output 11 [2022-12-11 22:28:54,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-11 22:28:54,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-11 22:28:55,236 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 [2022-12-11 22:28:55,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-12-11 22:28:56,043 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 25 treesize of output 7 [2022-12-11 22:28:56,423 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:28:56,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:29:00,224 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:29:00,225 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 2 case distinctions, treesize of input 76 treesize of output 61 [2022-12-11 22:29:00,233 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-11 22:29:00,233 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 300 treesize of output 275 [2022-12-11 22:29:00,241 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-11 22:29:00,241 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 268 treesize of output 220 [2022-12-11 22:29:00,247 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-11 22:29:00,247 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 220 treesize of output 196 [2022-12-11 22:29:00,287 INFO L321 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-12-11 22:29:00,287 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 2 case distinctions, treesize of input 76 treesize of output 1 [2022-12-11 22:29:00,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:29:00,296 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 2 case distinctions, treesize of input 38 treesize of output 44 [2022-12-11 22:29:00,300 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 72 treesize of output 64 [2022-12-11 22:29:00,304 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 10 treesize of output 4 [2022-12-11 22:29:00,309 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 10 treesize of output 4 [2022-12-11 22:29:00,315 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 10 treesize of output 4 [2022-12-11 22:29:01,690 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 10 treesize of output 8 [2022-12-11 22:29:01,914 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:29:01,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098451042] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:29:01,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:29:01,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 44, 43] total 115 [2022-12-11 22:29:01,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574411762] [2022-12-11 22:29:01,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:29:01,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 115 states [2022-12-11 22:29:01,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:29:01,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2022-12-11 22:29:01,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1377, Invalid=11667, Unknown=66, NotChecked=0, Total=13110 [2022-12-11 22:29:01,923 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 133 [2022-12-11 22:29:01,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 597 transitions, 14547 flow. Second operand has 115 states, 115 states have (on average 36.052173913043475) internal successors, (4146), 115 states have internal predecessors, (4146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:29:01,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:29:01,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 133 [2022-12-11 22:29:01,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:29:21,680 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse18 (* c_~q_front~0 4))) (let ((.cse42 (select |c_#memory_int| c_~q~0.base)) (.cse22 (+ .cse18 c_~q~0.offset)) (.cse19 (* 4 c_~q_back~0))) (let ((.cse6 (+ .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (forall ((~C~0 Int)) (let ((.cse43 (* 2 ~C~0))) (= (mod (+ c_~x~0 .cse43) 4294967296) (mod (+ c_~y~0 .cse43) 4294967296))))) (.cse12 (select .cse42 .cse22)) (.cse21 (+ c_~q~0.offset .cse19))) (let ((.cse11 (not (= (select .cse42 .cse21) 1))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse10 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse36 (not (<= 0 c_~q_back~0))) (.cse37 (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0)) (.cse38 (not (< c_~q_back~0 c_~n~0))) (.cse39 (= c_~N~0 .cse12)) (.cse0 (* c_~C~0 2)) (.cse13 (and (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (let ((.cse40 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_304) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse40 .cse4) 1)) (< 0 (select .cse40 .cse6))))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (let ((.cse41 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_304) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse41 .cse4) 1)) (< (select .cse41 .cse6) 2)))) (or (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_304) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse4) 1))) .cse1))) (.cse28 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post20#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse27 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_15| Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_15| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_15|) 0))))) (.cse8 (< c_~n~0 (+ 2 c_~q_back~0))) (.cse9 (< c_~q_back~0 0)) (.cse26 (and .cse1 (= .cse18 .cse19)))) (and (<= c_~x~0 .cse0) (or (let ((.cse3 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or .cse1 (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_303 Int)) (not (= 1 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse2 .cse3 v_ArrVal_303)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_304) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse4))))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_303 Int)) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse2 .cse3 v_ArrVal_303)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_304) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse5 .cse6) 2) (not (= 1 (select .cse5 .cse4)))))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_303 Int)) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse2 .cse3 v_ArrVal_303)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_304) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= 1 (select .cse7 .cse4))) (< 0 (select .cse7 .cse6))))))) .cse8 .cse9 .cse10) (= c_~y~0 0) (or .cse11 .cse8 .cse9 (and .cse1 (< |c_thread1Thread1of1ForFork0_~i~0#1| .cse12) (< .cse12 (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|)))) (or .cse13 .cse8 .cse9 .cse10) (or (let ((.cse14 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse19)) (.cse16 (+ .cse18 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (and (or .cse1 (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_304) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_#t~ret12#1.base|) .cse14) 1)))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_304) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (not (= (select .cse15 .cse14) 1)) (< (select .cse15 .cse16) 2)))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_304) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (not (= (select .cse17 .cse14) 1)) (< 0 (select .cse17 .cse16))))))) .cse8 .cse9) (or .cse8 .cse9 (and (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_304) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_305) c_~q~0.base))) (or (not (= (select .cse20 .cse21) 1)) (< (select .cse20 .cse22) 2)))) (or .cse1 (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_304) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_305) c_~q~0.base) .cse21) 1)))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (let ((.cse23 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_304) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_305) c_~q~0.base))) (or (< 0 (select .cse23 .cse22)) (not (= (select .cse23 .cse21) 1))))))) (or (and (or .cse1 (forall ((v_ArrVal_305 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_305) c_~q~0.base) .cse21) 1)))) (forall ((v_ArrVal_305 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_305) c_~q~0.base))) (or (not (= (select .cse24 .cse21) 1)) (< (select .cse24 .cse22) 2)))) (forall ((v_ArrVal_305 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_305) c_~q~0.base))) (or (not (= (select .cse25 .cse21) 1)) (< 0 (select .cse25 .cse22)))))) .cse8 .cse9) (or .cse8 .cse9 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) .cse26) (or .cse11 .cse8 .cse9 (and .cse1 (< 0 .cse12) (< .cse12 2))) (or (< 0 c_~q_back~0) .cse27 .cse9 .cse26) (or .cse8 (not .cse28) .cse9 (let ((.cse30 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_#t~post20#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_303 Int)) (let ((.cse29 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse2 .cse30 v_ArrVal_303)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_304) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse29 .cse4) 1)) (< (select .cse29 .cse6) 2)))) (or .cse1 (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_303 Int)) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse2 .cse30 v_ArrVal_303)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_304) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse4) 1)))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_303 Int)) (let ((.cse31 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse2 .cse30 v_ArrVal_303)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_304) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse31 .cse4) 1)) (< 0 (select .cse31 .cse6))))))) (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_#t~post20#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 c_~N~0) (or .cse13 .cse8 .cse9) (<= .cse0 c_~x~0) (<= c_~N~0 1) (or .cse8 .cse9 (let ((.cse34 (+ .cse18 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse33 (+ .cse19 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (let ((.cse32 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_304) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse32 .cse33) 1)) (< (select .cse32 .cse34) 2)))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (let ((.cse35 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_304) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse35 .cse33) 1)) (< 0 (select .cse35 .cse34))))) (or .cse1 (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_304) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse33) 1))))))) (or (not .cse10) (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse8 .cse9 .cse26) (or .cse36 .cse37 .cse38 (and .cse1 .cse39)) (or .cse36 .cse37 .cse38 (and .cse39 (= (mod (+ c_~y~0 .cse0) 4294967296) (mod (+ c_~C~0 c_~x~0) 4294967296)))) (= .cse22 0) (or .cse13 .cse8 .cse9 .cse28) (or .cse27 .cse8 (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse9 .cse26) (= c_~q~0.offset 0) (= .cse12 1)))))) is different from false [2022-12-11 22:30:05,955 INFO L130 PetriNetUnfolder]: 4603/9637 cut-off events. [2022-12-11 22:30:05,955 INFO L131 PetriNetUnfolder]: For 151342/152224 co-relation queries the response was YES. [2022-12-11 22:30:05,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106324 conditions, 9637 events. 4603/9637 cut-off events. For 151342/152224 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 83358 event pairs, 207 based on Foata normal form. 49/9211 useless extension candidates. Maximal degree in co-relation 52953. Up to 5994 conditions per place. [2022-12-11 22:30:06,038 INFO L137 encePairwiseOnDemand]: 82/133 looper letters, 955 selfloop transitions, 515 changer transitions 28/1527 dead transitions. [2022-12-11 22:30:06,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 1527 transitions, 40134 flow [2022-12-11 22:30:06,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-12-11 22:30:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2022-12-11 22:30:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 4182 transitions. [2022-12-11 22:30:06,042 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2966378209675131 [2022-12-11 22:30:06,043 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 300 predicate places. [2022-12-11 22:30:06,043 INFO L82 GeneralOperation]: Start removeDead. Operand has 419 places, 1527 transitions, 40134 flow [2022-12-11 22:30:06,110 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 413 places, 1499 transitions, 39392 flow [2022-12-11 22:30:06,111 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 1499 transitions, 39392 flow [2022-12-11 22:30:06,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 115 states, 115 states have (on average 36.052173913043475) internal successors, (4146), 115 states have internal predecessors, (4146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:30:06,112 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:30:06,112 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:30:06,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-11 22:30:06,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:30:06,317 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:30:06,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:30:06,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1429267656, now seen corresponding path program 2 times [2022-12-11 22:30:06,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:30:06,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984447797] [2022-12-11 22:30:06,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:30:06,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:30:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:30:08,198 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:30:08,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:30:08,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984447797] [2022-12-11 22:30:08,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984447797] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:30:08,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493189279] [2022-12-11 22:30:08,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 22:30:08,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:30:08,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:30:08,200 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:30:08,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-11 22:30:08,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-11 22:30:08,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:30:08,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 85 conjunts are in the unsatisfiable core [2022-12-11 22:30:08,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:30:09,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 15 treesize of output 11 [2022-12-11 22:30:09,656 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 15 treesize of output 11 [2022-12-11 22:30:10,119 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 [2022-12-11 22:30:10,206 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 [2022-12-11 22:30:10,908 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 25 treesize of output 7 [2022-12-11 22:30:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:30:11,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:30:18,142 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:30:18,142 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 2 case distinctions, treesize of input 76 treesize of output 61 [2022-12-11 22:30:18,153 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-11 22:30:18,153 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 300 treesize of output 275 [2022-12-11 22:30:18,161 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-11 22:30:18,162 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 0 case distinctions, treesize of input 204 treesize of output 180 [2022-12-11 22:30:18,170 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-11 22:30:18,170 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 244 treesize of output 196 [2022-12-11 22:30:18,213 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:30:18,213 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 2 case distinctions, treesize of input 38 treesize of output 44 [2022-12-11 22:30:18,218 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 154 treesize of output 138 [2022-12-11 22:30:18,227 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 10 treesize of output 4 [2022-12-11 22:30:18,237 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 10 treesize of output 4 [2022-12-11 22:30:18,242 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 10 treesize of output 4 [2022-12-11 22:30:18,252 INFO L321 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-12-11 22:30:18,252 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 2 case distinctions, treesize of input 76 treesize of output 1 [2022-12-11 22:30:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:30:20,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493189279] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:30:20,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:30:20,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 43, 41] total 111 [2022-12-11 22:30:20,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074843751] [2022-12-11 22:30:20,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:30:20,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2022-12-11 22:30:20,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:30:20,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2022-12-11 22:30:20,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1282, Invalid=10878, Unknown=50, NotChecked=0, Total=12210 [2022-12-11 22:30:20,330 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 133 [2022-12-11 22:30:20,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 1499 transitions, 39392 flow. Second operand has 111 states, 111 states have (on average 39.08108108108108) internal successors, (4338), 111 states have internal predecessors, (4338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:30:20,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:30:20,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 133 [2022-12-11 22:30:20,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:31:27,462 WARN L233 SmtUtils]: Spent 24.34s on a formula simplification. DAG size of input: 212 DAG size of output: 198 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:31:45,687 INFO L130 PetriNetUnfolder]: 5113/10626 cut-off events. [2022-12-11 22:31:45,687 INFO L131 PetriNetUnfolder]: For 179714/180823 co-relation queries the response was YES. [2022-12-11 22:31:45,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127438 conditions, 10626 events. 5113/10626 cut-off events. For 179714/180823 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 93255 event pairs, 210 based on Foata normal form. 95/10254 useless extension candidates. Maximal degree in co-relation 64843. Up to 6680 conditions per place. [2022-12-11 22:31:45,796 INFO L137 encePairwiseOnDemand]: 86/133 looper letters, 1217 selfloop transitions, 691 changer transitions 27/1967 dead transitions. [2022-12-11 22:31:45,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 1967 transitions, 54671 flow [2022-12-11 22:31:45,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-12-11 22:31:45,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2022-12-11 22:31:45,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 5029 transitions. [2022-12-11 22:31:45,809 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31510025062656644 [2022-12-11 22:31:45,810 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 413 predicate places. [2022-12-11 22:31:45,810 INFO L82 GeneralOperation]: Start removeDead. Operand has 532 places, 1967 transitions, 54671 flow [2022-12-11 22:31:45,893 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 525 places, 1940 transitions, 53886 flow [2022-12-11 22:31:45,893 INFO L495 AbstractCegarLoop]: Abstraction has has 525 places, 1940 transitions, 53886 flow [2022-12-11 22:31:45,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 111 states have (on average 39.08108108108108) internal successors, (4338), 111 states have internal predecessors, (4338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:31:45,894 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:31:45,894 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:31:45,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-11 22:31:46,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:31:46,099 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:31:46,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:31:46,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1506682116, now seen corresponding path program 3 times [2022-12-11 22:31:46,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:31:46,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284097589] [2022-12-11 22:31:46,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:31:46,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:31:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:31:48,082 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:31:48,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:31:48,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284097589] [2022-12-11 22:31:48,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284097589] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:31:48,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543431210] [2022-12-11 22:31:48,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-11 22:31:48,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:31:48,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:31:48,084 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:31:48,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-11 22:31:48,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-11 22:31:48,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:31:48,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-11 22:31:48,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:31:49,607 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-11 22:31:49,608 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 23 treesize of output 10 [2022-12-11 22:31:50,162 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 22:31:50,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:31:51,370 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:31:51,370 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 51 treesize of output 39 [2022-12-11 22:31:52,783 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 22:31:52,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543431210] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:31:52,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:31:52,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 25, 25] total 77 [2022-12-11 22:31:52,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580488417] [2022-12-11 22:31:52,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:31:52,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-12-11 22:31:52,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:31:52,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-12-11 22:31:52,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=5463, Unknown=0, NotChecked=0, Total=5852 [2022-12-11 22:31:52,787 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 133 [2022-12-11 22:31:52,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 1940 transitions, 53886 flow. Second operand has 77 states, 77 states have (on average 46.74025974025974) internal successors, (3599), 77 states have internal predecessors, (3599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:31:52,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:31:52,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 133 [2022-12-11 22:31:52,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:32:07,714 INFO L130 PetriNetUnfolder]: 5374/11221 cut-off events. [2022-12-11 22:32:07,714 INFO L131 PetriNetUnfolder]: For 209153/210571 co-relation queries the response was YES. [2022-12-11 22:32:07,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144123 conditions, 11221 events. 5374/11221 cut-off events. For 209153/210571 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 100004 event pairs, 175 based on Foata normal form. 99/10837 useless extension candidates. Maximal degree in co-relation 70091. Up to 7047 conditions per place. [2022-12-11 22:32:07,826 INFO L137 encePairwiseOnDemand]: 90/133 looper letters, 1688 selfloop transitions, 567 changer transitions 17/2307 dead transitions. [2022-12-11 22:32:07,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 2307 transitions, 68242 flow [2022-12-11 22:32:07,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-12-11 22:32:07,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2022-12-11 22:32:07,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 4415 transitions. [2022-12-11 22:32:07,831 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3688387635756057 [2022-12-11 22:32:07,831 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 495 predicate places. [2022-12-11 22:32:07,831 INFO L82 GeneralOperation]: Start removeDead. Operand has 614 places, 2307 transitions, 68242 flow [2022-12-11 22:32:07,924 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 611 places, 2290 transitions, 67702 flow [2022-12-11 22:32:07,925 INFO L495 AbstractCegarLoop]: Abstraction has has 611 places, 2290 transitions, 67702 flow [2022-12-11 22:32:07,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 46.74025974025974) internal successors, (3599), 77 states have internal predecessors, (3599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:32:07,926 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:32:07,926 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:32:07,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-11 22:32:08,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:32:08,131 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:32:08,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:32:08,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1037698490, now seen corresponding path program 4 times [2022-12-11 22:32:08,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:32:08,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419716749] [2022-12-11 22:32:08,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:32:08,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:32:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:32:09,939 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:32:09,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:32:09,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419716749] [2022-12-11 22:32:09,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419716749] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:32:09,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850981559] [2022-12-11 22:32:09,940 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-11 22:32:09,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:32:09,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:32:09,941 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:32:09,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-11 22:32:10,031 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-11 22:32:10,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:32:10,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-11 22:32:10,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:32:11,807 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-11 22:32:11,807 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 23 treesize of output 10 [2022-12-11 22:32:12,433 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:32:12,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:32:13,625 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:32:13,626 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 42 treesize of output 38 [2022-12-11 22:32:15,222 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:32:15,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850981559] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:32:15,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:32:15,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 32, 30] total 89 [2022-12-11 22:32:15,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474839677] [2022-12-11 22:32:15,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:32:15,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-12-11 22:32:15,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:32:15,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-12-11 22:32:15,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=721, Invalid=7111, Unknown=0, NotChecked=0, Total=7832 [2022-12-11 22:32:15,227 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 133 [2022-12-11 22:32:15,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 2290 transitions, 67702 flow. Second operand has 89 states, 89 states have (on average 46.48314606741573) internal successors, (4137), 89 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:32:15,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:32:15,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 133 [2022-12-11 22:32:15,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:32:25,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-11 22:32:27,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-11 22:32:30,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-11 22:32:33,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-11 22:32:38,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-11 22:32:42,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-11 22:32:46,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-11 22:32:54,719 INFO L130 PetriNetUnfolder]: 5796/12236 cut-off events. [2022-12-11 22:32:54,719 INFO L131 PetriNetUnfolder]: For 245545/247455 co-relation queries the response was YES. [2022-12-11 22:32:54,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166984 conditions, 12236 events. 5796/12236 cut-off events. For 245545/247455 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 111997 event pairs, 172 based on Foata normal form. 129/11860 useless extension candidates. Maximal degree in co-relation 82932. Up to 7670 conditions per place. [2022-12-11 22:32:54,847 INFO L137 encePairwiseOnDemand]: 93/133 looper letters, 1693 selfloop transitions, 921 changer transitions 79/2728 dead transitions. [2022-12-11 22:32:54,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 731 places, 2728 transitions, 85036 flow [2022-12-11 22:32:54,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-12-11 22:32:54,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2022-12-11 22:32:54,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 5972 transitions. [2022-12-11 22:32:54,853 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3710930218107252 [2022-12-11 22:32:54,853 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 612 predicate places. [2022-12-11 22:32:54,853 INFO L82 GeneralOperation]: Start removeDead. Operand has 731 places, 2728 transitions, 85036 flow [2022-12-11 22:32:54,964 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 718 places, 2649 transitions, 82429 flow [2022-12-11 22:32:54,965 INFO L495 AbstractCegarLoop]: Abstraction has has 718 places, 2649 transitions, 82429 flow [2022-12-11 22:32:54,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 46.48314606741573) internal successors, (4137), 89 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:32:54,966 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:32:54,966 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:32:54,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-11 22:32:55,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-11 22:32:55,173 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:32:55,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:32:55,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1396599946, now seen corresponding path program 5 times [2022-12-11 22:32:55,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:32:55,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268003519] [2022-12-11 22:32:55,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:32:55,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:32:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:32:57,316 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:32:57,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:32:57,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268003519] [2022-12-11 22:32:57,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268003519] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:32:57,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553778894] [2022-12-11 22:32:57,316 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-11 22:32:57,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:32:57,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:32:57,318 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:32:57,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-11 22:32:57,461 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-11 22:32:57,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:32:57,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-11 22:32:57,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:32:59,451 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-11 22:32:59,451 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 23 treesize of output 10 [2022-12-11 22:32:59,920 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:32:59,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:33:01,493 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:33:01,494 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 40 treesize of output 36 [2022-12-11 22:33:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:33:04,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553778894] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:33:04,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:33:04,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 31, 31] total 90 [2022-12-11 22:33:04,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850316731] [2022-12-11 22:33:04,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:33:04,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-12-11 22:33:04,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:33:04,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-12-11 22:33:04,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=681, Invalid=7329, Unknown=0, NotChecked=0, Total=8010 [2022-12-11 22:33:04,083 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 133 [2022-12-11 22:33:04,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 718 places, 2649 transitions, 82429 flow. Second operand has 90 states, 90 states have (on average 46.455555555555556) internal successors, (4181), 90 states have internal predecessors, (4181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:33:04,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:33:04,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 133 [2022-12-11 22:33:04,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:33:11,505 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] [2022-12-11 22:33:18,481 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] [2022-12-11 22:33:19,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-11 22:33:32,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-11 22:33:35,158 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] [2022-12-11 22:33:49,326 INFO L130 PetriNetUnfolder]: 5815/12238 cut-off events. [2022-12-11 22:33:49,326 INFO L131 PetriNetUnfolder]: For 261241/263197 co-relation queries the response was YES. [2022-12-11 22:33:49,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178027 conditions, 12238 events. 5815/12238 cut-off events. For 261241/263197 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 111888 event pairs, 164 based on Foata normal form. 125/11879 useless extension candidates. Maximal degree in co-relation 88144. Up to 7689 conditions per place. [2022-12-11 22:33:49,453 INFO L137 encePairwiseOnDemand]: 90/133 looper letters, 1803 selfloop transitions, 914 changer transitions 16/2768 dead transitions. [2022-12-11 22:33:49,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 813 places, 2768 transitions, 91410 flow [2022-12-11 22:33:49,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-12-11 22:33:49,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2022-12-11 22:33:49,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 4803 transitions. [2022-12-11 22:33:49,457 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3761748120300752 [2022-12-11 22:33:49,458 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 694 predicate places. [2022-12-11 22:33:49,458 INFO L82 GeneralOperation]: Start removeDead. Operand has 813 places, 2768 transitions, 91410 flow [2022-12-11 22:33:49,569 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 807 places, 2752 transitions, 90838 flow [2022-12-11 22:33:49,569 INFO L495 AbstractCegarLoop]: Abstraction has has 807 places, 2752 transitions, 90838 flow [2022-12-11 22:33:49,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 46.455555555555556) internal successors, (4181), 90 states have internal predecessors, (4181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:33:49,570 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:33:49,570 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:33:49,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-11 22:33:49,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:33:49,776 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:33:49,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:33:49,776 INFO L85 PathProgramCache]: Analyzing trace with hash -242362156, now seen corresponding path program 6 times [2022-12-11 22:33:49,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:33:49,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697786730] [2022-12-11 22:33:49,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:33:49,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:33:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:33:51,823 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:33:51,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:33:51,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697786730] [2022-12-11 22:33:51,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697786730] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:33:51,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166551125] [2022-12-11 22:33:51,823 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-11 22:33:51,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:33:51,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:33:51,825 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:33:51,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-11 22:33:51,949 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-11 22:33:51,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:33:51,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 83 conjunts are in the unsatisfiable core [2022-12-11 22:33:51,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:33:52,633 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 15 treesize of output 11 [2022-12-11 22:33:52,813 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 15 treesize of output 11 [2022-12-11 22:33:53,272 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 [2022-12-11 22:33:53,369 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 [2022-12-11 22:33:54,373 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 25 treesize of output 7 [2022-12-11 22:33:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:33:55,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:34:00,462 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:34:00,462 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 2 case distinctions, treesize of input 76 treesize of output 61 [2022-12-11 22:34:00,475 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-11 22:34:00,475 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 300 treesize of output 275 [2022-12-11 22:34:00,487 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-11 22:34:00,488 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 268 treesize of output 220 [2022-12-11 22:34:00,495 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-11 22:34:00,496 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 220 treesize of output 196 [2022-12-11 22:34:00,537 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:34:00,538 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 2 case distinctions, treesize of input 38 treesize of output 44 [2022-12-11 22:34:00,542 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 154 treesize of output 138 [2022-12-11 22:34:00,546 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 10 treesize of output 4 [2022-12-11 22:34:00,555 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 10 treesize of output 4 [2022-12-11 22:34:00,558 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 10 treesize of output 4 [2022-12-11 22:34:00,580 INFO L321 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-12-11 22:34:00,580 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 2 case distinctions, treesize of input 76 treesize of output 1 [2022-12-11 22:34:01,898 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:34:01,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166551125] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:34:01,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:34:01,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 41, 39] total 108 [2022-12-11 22:34:01,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059641895] [2022-12-11 22:34:01,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:34:01,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-12-11 22:34:01,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:34:01,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-12-11 22:34:01,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1170, Invalid=10336, Unknown=50, NotChecked=0, Total=11556 [2022-12-11 22:34:01,904 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 133 [2022-12-11 22:34:01,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 807 places, 2752 transitions, 90838 flow. Second operand has 108 states, 108 states have (on average 39.157407407407405) internal successors, (4229), 108 states have internal predecessors, (4229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:34:01,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:34:01,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 133 [2022-12-11 22:34:01,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:34:09,468 WARN L233 SmtUtils]: Spent 7.21s on a formula simplification. DAG size of input: 218 DAG size of output: 189 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:34:16,469 WARN L233 SmtUtils]: Spent 6.51s on a formula simplification. DAG size of input: 203 DAG size of output: 176 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:34:21,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:34:49,729 WARN L233 SmtUtils]: Spent 6.43s on a formula simplification. DAG size of input: 219 DAG size of output: 196 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:34:58,727 WARN L233 SmtUtils]: Spent 5.10s on a formula simplification. DAG size of input: 216 DAG size of output: 188 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:35:41,240 WARN L233 SmtUtils]: Spent 15.31s on a formula simplification. DAG size of input: 214 DAG size of output: 190 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:35:43,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:35:48,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:35:50,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:35:53,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:35:54,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:36:15,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:36:18,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:36:56,133 WARN L233 SmtUtils]: Spent 6.79s on a formula simplification. DAG size of input: 111 DAG size of output: 109 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:37:06,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:37:57,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:38:00,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:38:08,073 WARN L233 SmtUtils]: Spent 5.96s on a formula simplification. DAG size of input: 114 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:38:51,050 WARN L233 SmtUtils]: Spent 7.02s on a formula simplification. DAG size of input: 107 DAG size of output: 105 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:38:52,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:38:55,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] [2022-12-11 22:39:01,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:39:03,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:39:07,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:39:30,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:39:32,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:39:52,453 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_~q_front~0 4))) (let ((.cse41 (select |c_#memory_int| c_~q~0.base)) (.cse29 (+ .cse9 c_~q~0.offset)) (.cse26 (* c_~C~0 2)) (.cse8 (* 4 c_~q_back~0))) (let ((.cse28 (+ c_~q~0.offset .cse8)) (.cse40 (+ c_~q_front~0 1)) (.cse7 (forall ((~C~0 Int)) (let ((.cse43 (* 2 ~C~0))) (= (mod (+ c_~x~0 .cse43) 4294967296) (mod (+ c_~y~0 .cse43) 4294967296))))) (.cse42 (mod (+ c_~y~0 .cse26) 4294967296)) (.cse39 (select .cse41 .cse29))) (let ((.cse11 (+ c_~C~0 c_~y~0)) (.cse17 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse18 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse13 (< c_~q_front~0 0)) (.cse14 (<= c_~n~0 c_~q_front~0)) (.cse24 (= (+ c_~s~0 .cse39) c_~N~0)) (.cse12 (= (mod c_~x~0 4294967296) .cse42)) (.cse37 (= c_~N~0 .cse39)) (.cse25 (= .cse42 (mod (+ c_~C~0 c_~x~0) 4294967296))) (.cse15 (and .cse7 (= .cse9 .cse8))) (.cse0 (< .cse40 0)) (.cse38 (not (= (select .cse41 .cse28) 1))) (.cse1 (<= c_~n~0 .cse40)) (.cse2 (< c_~n~0 (+ 2 c_~q_back~0))) (.cse10 (< c_~q_back~0 0))) (and (<= c_~N~0 c_~s~0) (or .cse0 .cse1 .cse2 (let ((.cse4 (+ .cse9 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse8))) (and (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (< 0 (select .cse3 .cse4)) (not (= (select .cse3 .cse5) 1))))) (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (not (= (select .cse6 .cse5) 1)) (< (select .cse6 .cse4) 2)))) (or (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_main_#t~ret12#1.base|) .cse5) 1))) .cse7))) .cse10) (<= .cse11 c_~x~0) (<= c_~x~0 .cse11) (or (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse12) .cse13 .cse14) (or (< 0 c_~q_back~0) .cse0 (< 0 c_~q_front~0) .cse10 .cse15) (or .cse0 .cse1 .cse2 (let ((.cse19 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse20 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_#t~post20#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_455 Int) (v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (let ((.cse16 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse19 .cse20 v_ArrVal_455)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< 0 (select .cse16 .cse17)) (not (= (select .cse16 .cse18) 1))))) (or .cse7 (forall ((v_ArrVal_455 Int) (v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse19 .cse20 v_ArrVal_455)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse18) 1)))) (forall ((v_ArrVal_455 Int) (v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (let ((.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse19 .cse20 v_ArrVal_455)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse21 .cse17) 2) (not (= (select .cse21 .cse18) 1))))))) .cse10 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_#t~post20#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (= c_~s~0 1) (or .cse0 (and (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (let ((.cse22 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse22 .cse17) 2) (not (= (select .cse22 .cse18) 1))))) (or .cse7 (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse18) 1)))) (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (let ((.cse23 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< 0 (select .cse23 .cse17)) (not (= (select .cse23 .cse18) 1)))))) .cse1 .cse2 .cse10) (or .cse0 .cse1 .cse2 (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse10 .cse15) (or (and .cse24 .cse25) .cse0 .cse1) (<= c_~s~0 c_~N~0) (= .cse26 c_~x~0) (or .cse0 .cse1 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2 .cse10 .cse15) (or .cse0 .cse1 .cse2 .cse10 (and (forall ((v_ArrVal_457 (Array Int Int))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) c_~q~0.base))) (or (not (= (select .cse27 .cse28) 1)) (< 0 (select .cse27 .cse29))))) (or .cse7 (forall ((v_ArrVal_457 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) c_~q~0.base) .cse28) 1)))) (forall ((v_ArrVal_457 (Array Int Int))) (let ((.cse30 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) c_~q~0.base))) (or (< (select .cse30 .cse29) 2) (not (= (select .cse30 .cse28) 1))))))) (<= c_~N~0 1) (or .cse0 .cse1 .cse2 .cse10 (and (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (let ((.cse31 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) c_~q~0.base))) (or (< (select .cse31 .cse29) 2) (not (= (select .cse31 .cse28) 1))))) (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (let ((.cse32 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) c_~q~0.base))) (or (< 0 (select .cse32 .cse29)) (not (= (select .cse32 .cse28) 1))))) (or .cse7 (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) c_~q~0.base) .cse28) 1)))))) (or .cse0 (let ((.cse34 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse35 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (let ((.cse33 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< (select .cse33 .cse34) 2) (not (= (select .cse33 .cse35) 1))))) (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (let ((.cse36 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< 0 (select .cse36 .cse34)) (not (= (select .cse36 .cse35) 1))))) (or .cse7 (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse35) 1)))))) .cse1 .cse2 .cse10) (or .cse13 (and (= c_~s~0 c_~N~0) .cse12) .cse14) (or .cse0 (not (<= 0 c_~q_back~0)) (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (not (< c_~q_back~0 c_~n~0)) .cse1 (and .cse7 .cse37)) (or .cse0 .cse1 (and .cse24 .cse12)) (< 0 c_~N~0) (or .cse0 .cse1 (and .cse37 .cse25)) (= c_~q~0.offset 0) (or .cse0 .cse38 .cse1 .cse2 .cse10 (and .cse7 (< 0 .cse39) (< .cse39 2))) (= c_~C~0 c_~y~0) (or .cse0 .cse1 .cse2 .cse10 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse15) (or .cse0 .cse38 .cse1 .cse2 .cse10 (and .cse7 (< |c_thread1Thread1of1ForFork0_~i~0#1| .cse39) (< .cse39 (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|))))))))) is different from false [2022-12-11 22:40:10,978 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_~q_front~0 4))) (let ((.cse42 (select |c_#memory_int| c_~q~0.base)) (.cse30 (+ .cse9 c_~q~0.offset)) (.cse25 (* c_~C~0 2)) (.cse8 (* 4 c_~q_back~0))) (let ((.cse29 (+ c_~q~0.offset .cse8)) (.cse41 (+ c_~q_front~0 1)) (.cse7 (forall ((~C~0 Int)) (let ((.cse44 (* 2 ~C~0))) (= (mod (+ c_~x~0 .cse44) 4294967296) (mod (+ c_~y~0 .cse44) 4294967296))))) (.cse26 (mod c_~x~0 4294967296)) (.cse43 (mod (+ c_~y~0 .cse25) 4294967296)) (.cse40 (select .cse42 .cse30))) (let ((.cse16 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse17 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse12 (< c_~q_front~0 0)) (.cse27 (= c_~s~0 c_~N~0)) (.cse13 (<= c_~n~0 c_~q_front~0)) (.cse23 (= (+ c_~s~0 .cse40) c_~N~0)) (.cse11 (= .cse26 .cse43)) (.cse38 (= c_~N~0 .cse40)) (.cse24 (= .cse43 (mod (+ c_~C~0 c_~x~0) 4294967296))) (.cse14 (and .cse7 (= .cse9 .cse8))) (.cse0 (< .cse41 0)) (.cse39 (not (= (select .cse42 .cse29) 1))) (.cse1 (<= c_~n~0 .cse41)) (.cse2 (< c_~n~0 (+ 2 c_~q_back~0))) (.cse10 (< c_~q_back~0 0))) (and (= c_~s~0 (+ |c_thread2Thread1of1ForFork1_~j~0#1| 1)) (or .cse0 .cse1 .cse2 (let ((.cse4 (+ .cse9 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse8))) (and (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (< 0 (select .cse3 .cse4)) (not (= (select .cse3 .cse5) 1))))) (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (not (= (select .cse6 .cse5) 1)) (< (select .cse6 .cse4) 2)))) (or (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_main_#t~ret12#1.base|) .cse5) 1))) .cse7))) .cse10) (or (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse11) .cse12 .cse13) (or (< 0 c_~q_back~0) .cse0 (< 0 c_~q_front~0) .cse10 .cse14) (or .cse0 .cse1 .cse2 (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse19 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_#t~post20#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_455 Int) (v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (let ((.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse18 .cse19 v_ArrVal_455)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< 0 (select .cse15 .cse16)) (not (= (select .cse15 .cse17) 1))))) (or .cse7 (forall ((v_ArrVal_455 Int) (v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse18 .cse19 v_ArrVal_455)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse17) 1)))) (forall ((v_ArrVal_455 Int) (v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (let ((.cse20 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse18 .cse19 v_ArrVal_455)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse20 .cse16) 2) (not (= (select .cse20 .cse17) 1))))))) .cse10 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_#t~post20#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or .cse0 (and (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse21 .cse16) 2) (not (= (select .cse21 .cse17) 1))))) (or .cse7 (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse17) 1)))) (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (let ((.cse22 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< 0 (select .cse22 .cse16)) (not (= (select .cse22 .cse17) 1)))))) .cse1 .cse2 .cse10) (or .cse0 .cse1 .cse2 (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse10 .cse14) (or (and .cse23 .cse24) .cse0 .cse1) (= .cse25 c_~x~0) (or (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse26) .cse27) .cse12 .cse13) (or .cse0 .cse1 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2 .cse10 .cse14) (or .cse0 .cse1 .cse2 .cse10 (and (forall ((v_ArrVal_457 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) c_~q~0.base))) (or (not (= (select .cse28 .cse29) 1)) (< 0 (select .cse28 .cse30))))) (or .cse7 (forall ((v_ArrVal_457 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) c_~q~0.base) .cse29) 1)))) (forall ((v_ArrVal_457 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) c_~q~0.base))) (or (< (select .cse31 .cse30) 2) (not (= (select .cse31 .cse29) 1))))))) (<= c_~N~0 1) (or .cse0 .cse1 .cse2 .cse10 (and (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (let ((.cse32 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) c_~q~0.base))) (or (< (select .cse32 .cse30) 2) (not (= (select .cse32 .cse29) 1))))) (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (let ((.cse33 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) c_~q~0.base))) (or (< 0 (select .cse33 .cse30)) (not (= (select .cse33 .cse29) 1))))) (or .cse7 (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) c_~q~0.base) .cse29) 1)))))) (or .cse0 (let ((.cse35 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse36 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (let ((.cse34 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< (select .cse34 .cse35) 2) (not (= (select .cse34 .cse36) 1))))) (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (let ((.cse37 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< 0 (select .cse37 .cse35)) (not (= (select .cse37 .cse36) 1))))) (or .cse7 (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse36) 1)))))) .cse1 .cse2 .cse10) (or .cse12 (and .cse27 .cse11) .cse13) (or .cse0 (not (<= 0 c_~q_back~0)) (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (not (< c_~q_back~0 c_~n~0)) .cse1 (and .cse7 .cse38)) (or .cse0 .cse1 (and .cse23 .cse11)) (< 0 c_~N~0) (or .cse0 .cse1 (and .cse38 .cse24)) (or .cse0 .cse39 .cse1 .cse2 .cse10 (and .cse7 (< 0 .cse40) (< .cse40 2))) (= c_~C~0 c_~y~0) (or .cse0 .cse1 .cse2 .cse10 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse14) (or .cse0 .cse39 .cse1 .cse2 .cse10 (and .cse7 (< |c_thread1Thread1of1ForFork0_~i~0#1| .cse40) (< .cse40 (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|))))))))) is different from false [2022-12-11 22:40:16,557 INFO L130 PetriNetUnfolder]: 6645/14270 cut-off events. [2022-12-11 22:40:16,557 INFO L131 PetriNetUnfolder]: For 331184/334061 co-relation queries the response was YES. [2022-12-11 22:40:16,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218390 conditions, 14270 events. 6645/14270 cut-off events. For 331184/334061 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 137535 event pairs, 155 based on Foata normal form. 156/13911 useless extension candidates. Maximal degree in co-relation 114589. Up to 8902 conditions per place. [2022-12-11 22:40:16,833 INFO L137 encePairwiseOnDemand]: 88/133 looper letters, 2348 selfloop transitions, 1301 changer transitions 38/3719 dead transitions. [2022-12-11 22:40:16,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 990 places, 3719 transitions, 127808 flow [2022-12-11 22:40:16,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2022-12-11 22:40:16,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2022-12-11 22:40:16,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 7708 transitions. [2022-12-11 22:40:16,860 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31497221314154955 [2022-12-11 22:40:16,860 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 871 predicate places. [2022-12-11 22:40:16,861 INFO L82 GeneralOperation]: Start removeDead. Operand has 990 places, 3719 transitions, 127808 flow [2022-12-11 22:40:17,068 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 981 places, 3681 transitions, 126369 flow [2022-12-11 22:40:17,068 INFO L495 AbstractCegarLoop]: Abstraction has has 981 places, 3681 transitions, 126369 flow [2022-12-11 22:40:17,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 108 states have (on average 39.157407407407405) internal successors, (4229), 108 states have internal predecessors, (4229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:40:17,069 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:40:17,069 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:40:17,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-11 22:40:17,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-11 22:40:17,274 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:40:17,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:40:17,274 INFO L85 PathProgramCache]: Analyzing trace with hash -274454226, now seen corresponding path program 7 times [2022-12-11 22:40:17,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:40:17,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700871863] [2022-12-11 22:40:17,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:40:17,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:40:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:40:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:40:19,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:40:19,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700871863] [2022-12-11 22:40:19,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700871863] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:40:19,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451251349] [2022-12-11 22:40:19,398 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-11 22:40:19,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:40:19,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:40:19,400 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:40:19,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-11 22:40:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:40:19,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 67 conjunts are in the unsatisfiable core [2022-12-11 22:40:19,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:40:21,302 INFO L321 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-12-11 22:40:21,302 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 24 treesize of output 10 [2022-12-11 22:40:21,879 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:40:21,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:40:23,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:40:23,075 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 42 treesize of output 38 [2022-12-11 22:40:24,928 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:40:24,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451251349] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:40:24,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:40:24,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 35, 33] total 95 [2022-12-11 22:40:24,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571390543] [2022-12-11 22:40:24,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:40:24,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-12-11 22:40:24,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:40:24,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-12-11 22:40:24,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=875, Invalid=8055, Unknown=0, NotChecked=0, Total=8930 [2022-12-11 22:40:24,931 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 133 [2022-12-11 22:40:24,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 981 places, 3681 transitions, 126369 flow. Second operand has 95 states, 95 states have (on average 46.32631578947368) internal successors, (4401), 95 states have internal predecessors, (4401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:40:24,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:40:24,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 133 [2022-12-11 22:40:24,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:40:32,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-11 22:40:42,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-11 22:40:51,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-11 22:40:53,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-11 22:41:00,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-11 22:41:09,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-11 22:41:16,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-11 22:41:21,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-11 22:41:23,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-11 22:41:24,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-11 22:41:35,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-11 22:41:39,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-11 22:41:44,137 INFO L130 PetriNetUnfolder]: 6726/14500 cut-off events. [2022-12-11 22:41:44,138 INFO L131 PetriNetUnfolder]: For 366467/369786 co-relation queries the response was YES. [2022-12-11 22:41:44,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234143 conditions, 14500 events. 6726/14500 cut-off events. For 366467/369786 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 140837 event pairs, 160 based on Foata normal form. 169/14156 useless extension candidates. Maximal degree in co-relation 122364. Up to 9034 conditions per place. [2022-12-11 22:41:44,302 INFO L137 encePairwiseOnDemand]: 88/133 looper letters, 2541 selfloop transitions, 1174 changer transitions 51/3801 dead transitions. [2022-12-11 22:41:44,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1096 places, 3801 transitions, 138034 flow [2022-12-11 22:41:44,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-12-11 22:41:44,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2022-12-11 22:41:44,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 5720 transitions. [2022-12-11 22:41:44,308 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37075447238786624 [2022-12-11 22:41:44,308 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 977 predicate places. [2022-12-11 22:41:44,308 INFO L82 GeneralOperation]: Start removeDead. Operand has 1096 places, 3801 transitions, 138034 flow [2022-12-11 22:41:44,465 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1089 places, 3750 transitions, 136042 flow [2022-12-11 22:41:44,465 INFO L495 AbstractCegarLoop]: Abstraction has has 1089 places, 3750 transitions, 136042 flow [2022-12-11 22:41:44,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 46.32631578947368) internal successors, (4401), 95 states have internal predecessors, (4401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:41:44,478 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:41:44,479 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:41:44,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-11 22:41:44,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-11 22:41:44,683 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:41:44,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:41:44,683 INFO L85 PathProgramCache]: Analyzing trace with hash 662847792, now seen corresponding path program 8 times [2022-12-11 22:41:44,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:41:44,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398987980] [2022-12-11 22:41:44,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:41:44,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:41:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:41:46,605 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:41:46,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:41:46,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398987980] [2022-12-11 22:41:46,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398987980] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:41:46,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649946170] [2022-12-11 22:41:46,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 22:41:46,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:41:46,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:41:46,606 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:41:46,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-11 22:41:46,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-11 22:41:46,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:41:46,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 79 conjunts are in the unsatisfiable core [2022-12-11 22:41:46,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:41:47,425 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 15 treesize of output 11 [2022-12-11 22:41:47,644 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 15 treesize of output 11 [2022-12-11 22:41:48,194 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 [2022-12-11 22:41:48,474 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 [2022-12-11 22:41:49,238 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 23 treesize of output 7 [2022-12-11 22:41:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:41:49,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:41:57,682 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-12-11 22:41:57,683 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 2 case distinctions, treesize of input 74 treesize of output 69 [2022-12-11 22:41:57,709 INFO L321 Elim1Store]: treesize reduction 5, result has 86.5 percent of original size [2022-12-11 22:41:57,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 321 treesize of output 312 [2022-12-11 22:41:57,719 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-11 22:41:57,720 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 0 case distinctions, treesize of input 204 treesize of output 180 [2022-12-11 22:41:57,756 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-11 22:41:57,756 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 244 treesize of output 196 [2022-12-11 22:41:57,865 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-12-11 22:41:57,865 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 2 case distinctions, treesize of input 37 treesize of output 52 [2022-12-11 22:41:57,876 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:41:57,876 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 94 treesize of output 90 [2022-12-11 22:41:57,882 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 64 treesize of output 58 [2022-12-11 22:41:57,887 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 46 [2022-12-11 22:41:57,908 INFO L321 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2022-12-11 22:41:57,908 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 2 case distinctions, treesize of input 74 treesize of output 1 [2022-12-11 22:41:59,382 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:41:59,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649946170] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:41:59,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:41:59,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 41, 39] total 108 [2022-12-11 22:41:59,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196468027] [2022-12-11 22:41:59,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:41:59,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-12-11 22:41:59,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:41:59,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-12-11 22:41:59,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1047, Invalid=10458, Unknown=51, NotChecked=0, Total=11556 [2022-12-11 22:41:59,396 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 133 [2022-12-11 22:41:59,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1089 places, 3750 transitions, 136042 flow. Second operand has 108 states, 108 states have (on average 39.157407407407405) internal successors, (4229), 108 states have internal predecessors, (4229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:41:59,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:41:59,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 133 [2022-12-11 22:41:59,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:42:09,518 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse14 (* 4 c_~q_back~0)) (.cse15 (* c_~q_front~0 4))) (let ((.cse35 (select |c_#memory_int| c_~q~0.base)) (.cse7 (+ .cse15 c_~q~0.offset)) (.cse5 (+ c_~q~0.offset .cse14)) (.cse21 (+ .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (forall ((~C~0 Int)) (let ((.cse40 (* 2 ~C~0))) (= (mod (+ c_~x~0 .cse40) 4294967296) (mod (+ c_~y~0 .cse40) 4294967296))))) (.cse19 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse17 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post20#1| 1)) (.cse27 (and (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse38 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< 0 (select .cse38 .cse21)) (not (= (select .cse38 .cse19) 1))))) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse39 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse39 .cse21) 2) (not (= (select .cse39 .cse19) 1))))) (or .cse2 (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse19) 1)))))) (.cse29 (or .cse2 (forall ((v_ArrVal_519 (Array Int Int))) (not (= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base) .cse5)))))) (.cse31 (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0)) (.cse3 (= .cse15 .cse14)) (.cse4 (< c_~n~0 (+ 2 c_~q_back~0))) (.cse0 (< c_~q_back~0 0)) (.cse36 (= c_~N~0 (select .cse35 .cse7)))) (and (or .cse0 (let ((.cse1 (< 0 c_~q_back~0))) (and (or .cse1 .cse2) (or .cse1 .cse3)))) (or .cse4 .cse0 (and (or .cse2 (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base) .cse5) 1)))) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base))) (or (not (= (select .cse6 .cse5) 1)) (< (select .cse6 .cse7) 2)))) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base))) (or (not (= (select .cse8 .cse5) 1)) (< 0 (select .cse8 .cse7))))))) (or .cse4 .cse0 (let ((.cse9 (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|))) (and (or .cse9 .cse3) (or .cse2 .cse9)))) (or .cse4 .cse0 (let ((.cse12 (+ .cse15 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (.cse10 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse14))) (and (or .cse2 (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_main_#t~ret12#1.base|) .cse10) 1)))) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (< 0 (select .cse11 .cse12)) (not (= (select .cse11 .cse10) 1))))) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (< (select .cse13 .cse12) 2) (not (= (select .cse13 .cse10) 1)))))))) (or .cse4 .cse0 (let ((.cse16 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (and (or .cse2 .cse16) (or .cse16 .cse3)))) (or .cse4 .cse0 (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (or .cse2 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| Int) (v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int)) (v_ArrVal_516 Int)) (or (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| .cse17)) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse18 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_516)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse19) 1))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| Int)) (or (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| .cse17)) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int)) (v_ArrVal_516 Int)) (let ((.cse20 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse18 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_516)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< 0 (select .cse20 .cse21)) (not (= (select .cse20 .cse19) 1))))) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| Int)) (or (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| .cse17)) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int)) (v_ArrVal_516 Int)) (let ((.cse22 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse18 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_516)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse22 .cse19) 1)) (< (select .cse22 .cse21) 2)))) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)))))) (or .cse4 .cse0 (let ((.cse25 (+ .cse15 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse24 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse23 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse23 .cse24) 1)) (< 0 (select .cse23 .cse25))))) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse26 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse26 .cse24) 1)) (< (select .cse26 .cse25) 2)))) (or .cse2 (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse24) 1))))))) (or .cse4 .cse0 .cse27) (or (and (forall ((v_ArrVal_519 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base))) (or (< (select .cse28 .cse7) (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|)) (not (= 1 (select .cse28 .cse5)))))) .cse29 (forall ((v_ArrVal_519 (Array Int Int))) (let ((.cse30 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base))) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| (select .cse30 .cse7)) (not (= 1 (select .cse30 .cse5))))))) .cse4 .cse0) (or .cse31 (and (forall ((v_ArrVal_519 (Array Int Int))) (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base))) (or (= c_~N~0 (select .cse32 .cse7)) (not (= 1 (select .cse32 .cse5)))))) .cse29) .cse4 .cse0) (or .cse4 .cse0 (< .cse17 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse27) (or (and (forall ((v_ArrVal_519 (Array Int Int))) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base))) (or (< (select .cse33 .cse7) 2) (not (= 1 (select .cse33 .cse5)))))) .cse29 (forall ((v_ArrVal_519 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base))) (or (not (= 1 (select .cse34 .cse5))) (< 0 (select .cse34 .cse7)))))) .cse4 .cse0) (or (not (= (select .cse35 .cse5) 1)) .cse31 .cse4 (and .cse2 .cse36) .cse0) (or (let ((.cse37 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (and (or .cse2 .cse37) (or .cse37 .cse3))) .cse4 .cse0) (or (not (<= 0 c_~q_back~0)) (not (< c_~q_back~0 c_~n~0)) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0) (and .cse36 (= (mod (+ c_~y~0 (* c_~C~0 2)) 4294967296) (mod (+ c_~C~0 c_~x~0) 4294967296)))))))) is different from false [2022-12-11 22:42:29,537 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse15 (* c_~q_front~0 4)) (.cse14 (* 4 c_~q_back~0))) (let ((.cse5 (+ c_~q~0.offset .cse14)) (.cse21 (+ .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (forall ((~C~0 Int)) (let ((.cse42 (* 2 ~C~0))) (= (mod (+ c_~x~0 .cse42) 4294967296) (mod (+ c_~y~0 .cse42) 4294967296))))) (.cse19 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse17 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post20#1| 1)) (.cse27 (and (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse40 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< 0 (select .cse40 .cse21)) (not (= (select .cse40 .cse19) 1))))) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse41 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse41 .cse21) 2) (not (= (select .cse41 .cse19) 1))))) (or .cse2 (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse19) 1)))))) (.cse35 (mod c_~x~0 4294967296)) (.cse34 (= c_~s~0 c_~N~0)) (.cse33 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse29 (or .cse2 (forall ((v_ArrVal_519 (Array Int Int))) (not (= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base) .cse5)))))) (.cse31 (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0)) (.cse7 (+ .cse15 c_~q~0.offset)) (.cse3 (= .cse15 .cse14)) (.cse4 (< c_~n~0 (+ 2 c_~q_back~0))) (.cse0 (< c_~q_back~0 0))) (and (or .cse0 (let ((.cse1 (< 0 c_~q_back~0))) (and (or .cse1 .cse2) (or .cse1 .cse3)))) (or .cse4 .cse0 (and (or .cse2 (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base) .cse5) 1)))) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base))) (or (not (= (select .cse6 .cse5) 1)) (< (select .cse6 .cse7) 2)))) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base))) (or (not (= (select .cse8 .cse5) 1)) (< 0 (select .cse8 .cse7))))))) (or .cse4 .cse0 (let ((.cse9 (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|))) (and (or .cse9 .cse3) (or .cse2 .cse9)))) (or .cse4 .cse0 (let ((.cse12 (+ .cse15 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (.cse10 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse14))) (and (or .cse2 (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_main_#t~ret12#1.base|) .cse10) 1)))) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (< 0 (select .cse11 .cse12)) (not (= (select .cse11 .cse10) 1))))) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (< (select .cse13 .cse12) 2) (not (= (select .cse13 .cse10) 1)))))))) (or .cse4 .cse0 (let ((.cse16 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (and (or .cse2 .cse16) (or .cse16 .cse3)))) (or .cse4 .cse0 (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (or .cse2 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| Int) (v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int)) (v_ArrVal_516 Int)) (or (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| .cse17)) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse18 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_516)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse19) 1))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| Int)) (or (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| .cse17)) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int)) (v_ArrVal_516 Int)) (let ((.cse20 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse18 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_516)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< 0 (select .cse20 .cse21)) (not (= (select .cse20 .cse19) 1))))) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| Int)) (or (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| .cse17)) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int)) (v_ArrVal_516 Int)) (let ((.cse22 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse18 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_516)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse22 .cse19) 1)) (< (select .cse22 .cse21) 2)))) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)))))) (or .cse4 .cse0 (let ((.cse25 (+ .cse15 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse24 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse23 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse23 .cse24) 1)) (< 0 (select .cse23 .cse25))))) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse26 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse26 .cse24) 1)) (< (select .cse26 .cse25) 2)))) (or .cse2 (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse24) 1))))))) (or .cse4 .cse0 .cse27) (or (and (forall ((v_ArrVal_519 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base))) (or (< (select .cse28 .cse7) (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|)) (not (= 1 (select .cse28 .cse5)))))) .cse29 (forall ((v_ArrVal_519 (Array Int Int))) (let ((.cse30 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base))) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| (select .cse30 .cse7)) (not (= 1 (select .cse30 .cse5))))))) .cse4 .cse0) (or .cse31 (and (forall ((v_ArrVal_519 (Array Int Int))) (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base))) (or (= c_~N~0 (select .cse32 .cse7)) (not (= 1 (select .cse32 .cse5)))))) .cse29) .cse4 .cse0) (or .cse33 (and .cse34 (= .cse35 (mod c_~y~0 4294967296)))) (or .cse4 .cse0 (< .cse17 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse27) (or (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse35) .cse34) .cse33) (or (and (forall ((v_ArrVal_519 (Array Int Int))) (let ((.cse36 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base))) (or (< (select .cse36 .cse7) 2) (not (= 1 (select .cse36 .cse5)))))) .cse29 (forall ((v_ArrVal_519 (Array Int Int))) (let ((.cse37 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base))) (or (not (= 1 (select .cse37 .cse5))) (< 0 (select .cse37 .cse7)))))) .cse4 .cse0) (let ((.cse38 (select |c_#memory_int| c_~q~0.base))) (or (not (= (select .cse38 .cse5) 1)) .cse31 .cse4 (and .cse2 (= c_~N~0 (select .cse38 .cse7))) .cse0)) (or (let ((.cse39 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (and (or .cse2 .cse39) (or .cse39 .cse3))) .cse4 .cse0))))) is different from false [2022-12-11 22:42:30,780 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse14 (* 4 c_~q_back~0)) (.cse15 (* c_~q_front~0 4))) (let ((.cse21 (+ .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (forall ((~C~0 Int)) (let ((.cse36 (* 2 ~C~0))) (= (mod (+ c_~x~0 .cse36) 4294967296) (mod (+ c_~y~0 .cse36) 4294967296))))) (.cse19 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse17 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post20#1| 1)) (.cse27 (and (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse34 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< 0 (select .cse34 .cse21)) (not (= (select .cse34 .cse19) 1))))) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse35 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse35 .cse21) 2) (not (= (select .cse35 .cse19) 1))))) (or .cse2 (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse19) 1)))))) (.cse30 (mod c_~x~0 4294967296)) (.cse29 (= c_~s~0 c_~N~0)) (.cse28 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse5 (+ c_~q~0.offset .cse14)) (.cse7 (+ .cse15 c_~q~0.offset)) (.cse3 (= .cse15 .cse14)) (.cse4 (< c_~n~0 (+ 2 c_~q_back~0))) (.cse0 (< c_~q_back~0 0))) (and (or .cse0 (let ((.cse1 (< 0 c_~q_back~0))) (and (or .cse1 .cse2) (or .cse1 .cse3)))) (or .cse4 .cse0 (and (or .cse2 (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base) .cse5) 1)))) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base))) (or (not (= (select .cse6 .cse5) 1)) (< (select .cse6 .cse7) 2)))) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base))) (or (not (= (select .cse8 .cse5) 1)) (< 0 (select .cse8 .cse7))))))) (or .cse4 .cse0 (let ((.cse9 (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|))) (and (or .cse9 .cse3) (or .cse2 .cse9)))) (or .cse4 .cse0 (let ((.cse12 (+ .cse15 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (.cse10 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse14))) (and (or .cse2 (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_main_#t~ret12#1.base|) .cse10) 1)))) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (< 0 (select .cse11 .cse12)) (not (= (select .cse11 .cse10) 1))))) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (< (select .cse13 .cse12) 2) (not (= (select .cse13 .cse10) 1)))))))) (or .cse4 .cse0 (let ((.cse16 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (and (or .cse2 .cse16) (or .cse16 .cse3)))) (or .cse4 .cse0 (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (or .cse2 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| Int) (v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int)) (v_ArrVal_516 Int)) (or (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| .cse17)) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse18 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_516)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse19) 1))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| Int)) (or (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| .cse17)) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int)) (v_ArrVal_516 Int)) (let ((.cse20 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse18 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_516)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< 0 (select .cse20 .cse21)) (not (= (select .cse20 .cse19) 1))))) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| Int)) (or (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| .cse17)) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int)) (v_ArrVal_516 Int)) (let ((.cse22 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse18 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_516)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse22 .cse19) 1)) (< (select .cse22 .cse21) 2)))) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)))))) (or .cse4 .cse0 (let ((.cse25 (+ .cse15 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse24 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse23 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse23 .cse24) 1)) (< 0 (select .cse23 .cse25))))) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse26 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse26 .cse24) 1)) (< (select .cse26 .cse25) 2)))) (or .cse2 (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse24) 1))))))) (or .cse4 .cse0 .cse27) (or .cse28 (and .cse29 (= .cse30 (mod c_~y~0 4294967296)))) (or .cse4 .cse0 (< .cse17 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse27) (or (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse30) .cse29) .cse28) (or (and (forall ((v_ArrVal_519 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base))) (or (< (select .cse31 .cse7) 2) (not (= 1 (select .cse31 .cse5)))))) (or .cse2 (forall ((v_ArrVal_519 (Array Int Int))) (not (= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base) .cse5))))) (forall ((v_ArrVal_519 (Array Int Int))) (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base))) (or (not (= 1 (select .cse32 .cse5))) (< 0 (select .cse32 .cse7)))))) .cse4 .cse0) (or (let ((.cse33 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (and (or .cse2 .cse33) (or .cse33 .cse3))) .cse4 .cse0))))) is different from false [2022-12-11 22:42:37,633 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse16 (* c_~q_front~0 4))) (let ((.cse8 (+ .cse16 c_~q~0.offset)) (.cse15 (* 4 c_~q_back~0))) (let ((.cse6 (+ c_~q~0.offset .cse15)) (.cse22 (+ .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (forall ((~C~0 Int)) (let ((.cse43 (* 2 ~C~0))) (= (mod (+ c_~x~0 .cse43) 4294967296) (mod (+ c_~y~0 .cse43) 4294967296))))) (.cse20 (+ .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse40 (select (select |c_#memory_int| c_~q~0.base) .cse8))) (let ((.cse29 (not (<= 0 c_~q_back~0))) (.cse30 (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0)) (.cse31 (not (< c_~q_back~0 c_~n~0))) (.cse32 (= c_~N~0 .cse40)) (.cse0 (* c_~C~0 2)) (.cse18 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post20#1| 1)) (.cse28 (and (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse41 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< 0 (select .cse41 .cse22)) (not (= (select .cse41 .cse20) 1))))) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse42 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse42 .cse22) 2) (not (= (select .cse42 .cse20) 1))))) (or .cse3 (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse20) 1)))))) (.cse34 (or .cse3 (forall ((v_ArrVal_519 (Array Int Int))) (not (= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base) .cse6)))))) (.cse4 (= .cse16 .cse15)) (.cse5 (< c_~n~0 (+ 2 c_~q_back~0))) (.cse1 (< c_~q_back~0 0))) (and (<= c_~x~0 .cse0) (or .cse1 (let ((.cse2 (< 0 c_~q_back~0))) (and (or .cse2 .cse3) (or .cse2 .cse4)))) (= c_~y~0 0) (<= 0 c_~q_front~0) (or .cse5 .cse1 (and (or .cse3 (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base) .cse6) 1)))) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base))) (or (not (= (select .cse7 .cse6) 1)) (< (select .cse7 .cse8) 2)))) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base))) (or (not (= (select .cse9 .cse6) 1)) (< 0 (select .cse9 .cse8))))))) (or .cse5 .cse1 (let ((.cse10 (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|))) (and (or .cse10 .cse4) (or .cse3 .cse10)))) (or .cse5 .cse1 (let ((.cse13 (+ .cse16 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (.cse11 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse15))) (and (or .cse3 (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_main_#t~ret12#1.base|) .cse11) 1)))) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (< 0 (select .cse12 .cse13)) (not (= (select .cse12 .cse11) 1))))) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (< (select .cse14 .cse13) 2) (not (= (select .cse14 .cse11) 1)))))))) (= .cse0 c_~x~0) (<= 1 c_~N~0) (<= .cse0 c_~x~0) (<= c_~N~0 1) (or .cse5 .cse1 (let ((.cse17 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (and (or .cse3 .cse17) (or .cse17 .cse4)))) (= c_~s~0 0) (or .cse5 .cse1 (let ((.cse19 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (or .cse3 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| Int) (v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int)) (v_ArrVal_516 Int)) (or (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| .cse18)) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse19 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_516)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse20) 1))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| Int)) (or (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| .cse18)) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int)) (v_ArrVal_516 Int)) (let ((.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse19 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_516)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< 0 (select .cse21 .cse22)) (not (= (select .cse21 .cse20) 1))))) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| Int)) (or (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| .cse18)) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int)) (v_ArrVal_516 Int)) (let ((.cse23 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse19 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_516)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse23 .cse20) 1)) (< (select .cse23 .cse22) 2)))) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_48| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)))))) (or .cse5 .cse1 (let ((.cse26 (+ .cse16 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse25 (+ .cse15 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse24 .cse25) 1)) (< 0 (select .cse24 .cse26))))) (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse27 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse27 .cse25) 1)) (< (select .cse27 .cse26) 2)))) (or .cse3 (forall ((v_ArrVal_519 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse25) 1))))))) (or .cse5 .cse1 .cse28) (or .cse29 .cse30 .cse31 (and .cse3 .cse32)) (or (and (forall ((v_ArrVal_519 (Array Int Int))) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base))) (or (< (select .cse33 .cse8) (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|)) (not (= 1 (select .cse33 .cse6)))))) .cse34 (forall ((v_ArrVal_519 (Array Int Int))) (let ((.cse35 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base))) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| (select .cse35 .cse8)) (not (= 1 (select .cse35 .cse6))))))) .cse5 .cse1) (or .cse30 (and (forall ((v_ArrVal_519 (Array Int Int))) (let ((.cse36 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base))) (or (= c_~N~0 (select .cse36 .cse8)) (not (= 1 (select .cse36 .cse6)))))) .cse34) .cse5 .cse1) (or .cse29 .cse30 .cse31 (and .cse32 (= (mod (+ c_~y~0 .cse0) 4294967296) (mod (+ c_~C~0 c_~x~0) 4294967296)))) (= .cse8 0) (< 0 c_~N~0) (= c_~q~0.offset 0) (or .cse5 .cse1 (< .cse18 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse28) (<= (+ c_~q_front~0 2) c_~n~0) (or (and (forall ((v_ArrVal_519 (Array Int Int))) (let ((.cse37 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base))) (or (< (select .cse37 .cse8) 2) (not (= 1 (select .cse37 .cse6)))))) .cse34 (forall ((v_ArrVal_519 (Array Int Int))) (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_519) c_~q~0.base))) (or (not (= 1 (select .cse38 .cse6))) (< 0 (select .cse38 .cse8)))))) .cse5 .cse1) (or (let ((.cse39 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (and (or .cse3 .cse39) (or .cse39 .cse4))) .cse5 .cse1) (<= c_~n~0 2) (= .cse40 1)))))) is different from false Received shutdown request... [2022-12-11 22:42:40,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-12-11 22:42:40,195 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-11 22:42:40,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-11 22:42:40,210 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-11 22:42:40,210 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-11 22:42:40,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-11 22:42:40,401 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (108states, 37/133 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 28709 conditions, 1628 events (672/1627 cut-off events. For 40481/40949 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 14498 event pairs, 51 based on Foata normal form. 48/2081 useless extension candidates. Maximal degree in co-relation 22872. Up to 892 conditions per place.). [2022-12-11 22:42:40,402 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-11 22:42:40,402 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-11 22:42:40,402 INFO L445 BasicCegarLoop]: Path program histogram: [12, 8, 3, 1, 1, 1] [2022-12-11 22:42:40,404 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 22:42:40,405 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 22:42:40,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 10:42:40 BasicIcfg [2022-12-11 22:42:40,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 22:42:40,407 INFO L158 Benchmark]: Toolchain (without parser) took 853781.34ms. Allocated memory was 183.5MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 150.4MB in the beginning and 368.1MB in the end (delta: -217.7MB). Peak memory consumption was 790.7MB. Max. memory is 8.0GB. [2022-12-11 22:42:40,407 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 183.5MB. Free memory is still 160.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 22:42:40,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.56ms. Allocated memory is still 183.5MB. Free memory was 150.4MB in the beginning and 137.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-11 22:42:40,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.03ms. Allocated memory is still 183.5MB. Free memory was 137.9MB in the beginning and 135.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 22:42:40,408 INFO L158 Benchmark]: Boogie Preprocessor took 23.32ms. Allocated memory is still 183.5MB. Free memory was 135.8MB in the beginning and 134.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-11 22:42:40,408 INFO L158 Benchmark]: RCFGBuilder took 582.42ms. Allocated memory is still 183.5MB. Free memory was 134.2MB in the beginning and 110.6MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-11 22:42:40,408 INFO L158 Benchmark]: TraceAbstraction took 852900.41ms. Allocated memory was 183.5MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 109.5MB in the beginning and 368.1MB in the end (delta: -258.6MB). Peak memory consumption was 749.8MB. Max. memory is 8.0GB. [2022-12-11 22:42:40,409 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.10ms. Allocated memory is still 183.5MB. Free memory is still 160.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 226.56ms. Allocated memory is still 183.5MB. Free memory was 150.4MB in the beginning and 137.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.03ms. Allocated memory is still 183.5MB. Free memory was 137.9MB in the beginning and 135.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.32ms. Allocated memory is still 183.5MB. Free memory was 135.8MB in the beginning and 134.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 582.42ms. Allocated memory is still 183.5MB. Free memory was 134.2MB in the beginning and 110.6MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 852900.41ms. Allocated memory was 183.5MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 109.5MB in the beginning and 368.1MB in the end (delta: -258.6MB). Peak memory consumption was 749.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (108states, 37/133 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 28709 conditions, 1628 events (672/1627 cut-off events. For 40481/40949 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 14498 event pairs, 51 based on Foata normal form. 48/2081 useless extension candidates. Maximal degree in co-relation 22872. Up to 892 conditions per place.). - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (108states, 37/133 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 28709 conditions, 1628 events (672/1627 cut-off events. For 40481/40949 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 14498 event pairs, 51 based on Foata normal form. 48/2081 useless extension candidates. Maximal degree in co-relation 22872. Up to 892 conditions per place.). - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (108states, 37/133 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 28709 conditions, 1628 events (672/1627 cut-off events. For 40481/40949 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 14498 event pairs, 51 based on Foata normal form. 48/2081 useless extension candidates. Maximal degree in co-relation 22872. Up to 892 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 147 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 1.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 852.8s, OverallIterations: 26, TraceHistogramMax: 2, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 756.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 989 mSolverCounterUnknown, 16385 SdHoareTripleChecker+Valid, 179.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16385 mSDsluCounter, 26804 SdHoareTripleChecker+Invalid, 173.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 459 IncrementalHoareTripleChecker+Unchecked, 25628 mSDsCounter, 2687 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56479 IncrementalHoareTripleChecker+Invalid, 60614 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2687 mSolverCounterUnsat, 1176 mSDtfsCounter, 56479 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 989 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4208 GetRequests, 2225 SyntacticMatches, 17 SemanticMatches, 1966 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 106254 ImplicationChecksByTransitivity, 578.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136042occurred in iteration=25, InterpolantAutomatonStates: 1137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 13509 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 89.8s InterpolantComputationTime, 4296 NumberOfCodeBlocks, 4282 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 5567 ConstructedInterpolants, 499 QuantifiedInterpolants, 105815 SizeOfPredicates, 378 NumberOfNonLiveVariables, 3463 ConjunctsInSsa, 659 ConjunctsInUnsatCore, 49 InterpolantComputations, 15 PerfectInterpolantSequences, 59/450 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown