/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-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 05:23:02,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 05:23:02,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 05:23:02,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 05:23:02,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 05:23:02,976 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 05:23:02,979 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 05:23:02,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 05:23:02,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 05:23:02,992 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 05:23:02,993 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 05:23:02,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 05:23:02,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 05:23:02,997 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 05:23:02,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 05:23:03,001 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 05:23:03,002 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 05:23:03,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 05:23:03,005 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 05:23:03,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 05:23:03,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 05:23:03,009 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 05:23:03,009 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 05:23:03,010 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 05:23:03,012 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 05:23:03,012 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 05:23:03,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 05:23:03,013 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 05:23:03,013 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 05:23:03,014 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 05:23:03,014 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 05:23:03,015 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 05:23:03,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 05:23:03,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 05:23:03,016 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 05:23:03,017 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 05:23:03,017 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 05:23:03,017 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 05:23:03,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 05:23:03,018 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 05:23:03,018 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 05:23:03,026 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-RepeatedSemanticLbe.epf [2022-12-13 05:23:03,054 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 05:23:03,054 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 05:23:03,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 05:23:03,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 05:23:03,056 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 05:23:03,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 05:23:03,057 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 05:23:03,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 05:23:03,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 05:23:03,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 05:23:03,058 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 05:23:03,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 05:23:03,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 05:23:03,068 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 05:23:03,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 05:23:03,068 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 05:23:03,068 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 05:23:03,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 05:23:03,069 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 05:23:03,069 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 05:23:03,069 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 05:23:03,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 05:23:03,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 05:23:03,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 05:23:03,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 05:23:03,069 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 05:23:03,069 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 05:23:03,070 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 05:23:03,070 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-13 05:23:03,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 05:23:03,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 05:23:03,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 05:23:03,428 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 05:23:03,429 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 05:23:03,430 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c [2022-12-13 05:23:04,660 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 05:23:04,834 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 05:23:04,835 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c [2022-12-13 05:23:04,843 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b6f3a824/7c03945c1c34407f8feadf8726015a6e/FLAG9c2d573a6 [2022-12-13 05:23:04,858 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b6f3a824/7c03945c1c34407f8feadf8726015a6e [2022-12-13 05:23:04,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 05:23:04,862 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 05:23:04,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 05:23:04,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 05:23:04,866 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 05:23:04,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:23:04" (1/1) ... [2022-12-13 05:23:04,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d6a5fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:23:04, skipping insertion in model container [2022-12-13 05:23:04,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:23:04" (1/1) ... [2022-12-13 05:23:04,873 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 05:23:04,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 05:23:05,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 05:23:05,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 05:23:05,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 05:23:05,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 05:23:05,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 05:23:05,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 05:23:05,050 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-three-array-sum.wvr.c[2691,2704] [2022-12-13 05:23:05,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 05:23:05,065 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 05:23:05,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 05:23:05,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 05:23:05,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 05:23:05,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 05:23:05,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 05:23:05,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 05:23:05,107 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-three-array-sum.wvr.c[2691,2704] [2022-12-13 05:23:05,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 05:23:05,127 INFO L208 MainTranslator]: Completed translation [2022-12-13 05:23:05,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:23:05 WrapperNode [2022-12-13 05:23:05,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 05:23:05,130 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 05:23:05,131 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 05:23:05,131 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 05:23:05,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:23:05" (1/1) ... [2022-12-13 05:23:05,155 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:23:05" (1/1) ... [2022-12-13 05:23:05,186 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 150 [2022-12-13 05:23:05,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 05:23:05,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 05:23:05,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 05:23:05,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 05:23:05,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:23:05" (1/1) ... [2022-12-13 05:23:05,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:23:05" (1/1) ... [2022-12-13 05:23:05,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:23:05" (1/1) ... [2022-12-13 05:23:05,211 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:23:05" (1/1) ... [2022-12-13 05:23:05,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:23:05" (1/1) ... [2022-12-13 05:23:05,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:23:05" (1/1) ... [2022-12-13 05:23:05,222 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:23:05" (1/1) ... [2022-12-13 05:23:05,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:23:05" (1/1) ... [2022-12-13 05:23:05,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 05:23:05,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 05:23:05,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 05:23:05,227 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 05:23:05,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:23:05" (1/1) ... [2022-12-13 05:23:05,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 05:23:05,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:23:05,278 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-13 05:23:05,301 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-13 05:23:05,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 05:23:05,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 05:23:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 05:23:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 05:23:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 05:23:05,314 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 05:23:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 05:23:05,314 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 05:23:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 05:23:05,314 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 05:23:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 05:23:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 05:23:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 05:23:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 05:23:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 05:23:05,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 05:23:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 05:23:05,316 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 05:23:05,450 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 05:23:05,452 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 05:23:05,676 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 05:23:05,700 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 05:23:05,700 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-13 05:23:05,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:23:05 BoogieIcfgContainer [2022-12-13 05:23:05,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 05:23:05,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 05:23:05,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 05:23:05,706 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 05:23:05,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:23:04" (1/3) ... [2022-12-13 05:23:05,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a2af6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:23:05, skipping insertion in model container [2022-12-13 05:23:05,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:23:05" (2/3) ... [2022-12-13 05:23:05,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a2af6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:23:05, skipping insertion in model container [2022-12-13 05:23:05,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:23:05" (3/3) ... [2022-12-13 05:23:05,708 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2022-12-13 05:23:05,721 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 05:23:05,721 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 05:23:05,721 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 05:23:05,773 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 05:23:05,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 208 transitions, 440 flow [2022-12-13 05:23:05,917 INFO L130 PetriNetUnfolder]: 20/205 cut-off events. [2022-12-13 05:23:05,918 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 05:23:05,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 20/205 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 143 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 166. Up to 3 conditions per place. [2022-12-13 05:23:05,923 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 208 transitions, 440 flow [2022-12-13 05:23:05,927 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 185 places, 195 transitions, 408 flow [2022-12-13 05:23:05,928 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:23:05,948 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 195 transitions, 408 flow [2022-12-13 05:23:05,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 195 transitions, 408 flow [2022-12-13 05:23:05,982 INFO L130 PetriNetUnfolder]: 20/195 cut-off events. [2022-12-13 05:23:05,982 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 05:23:05,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 195 events. 20/195 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 142 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 166. Up to 3 conditions per place. [2022-12-13 05:23:05,985 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 195 transitions, 408 flow [2022-12-13 05:23:05,985 INFO L226 LiptonReduction]: Number of co-enabled transitions 1874 [2022-12-13 05:23:11,937 INFO L241 LiptonReduction]: Total number of compositions: 164 [2022-12-13 05:23:11,958 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 05:23:11,962 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=REPEATED_LIPTON_PN, 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;@34bc72f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 05:23:11,962 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 05:23:11,978 INFO L130 PetriNetUnfolder]: 7/30 cut-off events. [2022-12-13 05:23:11,978 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 05:23:11,980 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:23:11,980 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:23:11,981 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 05:23:11,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:23:11,985 INFO L85 PathProgramCache]: Analyzing trace with hash -959111054, now seen corresponding path program 1 times [2022-12-13 05:23:11,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:23:11,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244426734] [2022-12-13 05:23:11,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:23:11,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:23:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:23:12,594 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-13 05:23:12,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:23:12,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244426734] [2022-12-13 05:23:12,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244426734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:23:12,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:23:12,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 05:23:12,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900575611] [2022-12-13 05:23:12,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:23:12,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 05:23:12,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:23:12,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 05:23:12,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 05:23:12,622 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-13 05:23:12,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-13 05:23:12,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:23:12,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-13 05:23:12,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:23:12,760 INFO L130 PetriNetUnfolder]: 739/989 cut-off events. [2022-12-13 05:23:12,760 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2022-12-13 05:23:12,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2052 conditions, 989 events. 739/989 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3495 event pairs, 116 based on Foata normal form. 1/577 useless extension candidates. Maximal degree in co-relation 1509. Up to 667 conditions per place. [2022-12-13 05:23:12,766 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 42 selfloop transitions, 3 changer transitions 1/49 dead transitions. [2022-12-13 05:23:12,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 49 transitions, 223 flow [2022-12-13 05:23:12,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 05:23:12,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 05:23:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-13 05:23:12,775 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6021505376344086 [2022-12-13 05:23:12,777 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-12-13 05:23:12,777 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 49 transitions, 223 flow [2022-12-13 05:23:12,781 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 48 transitions, 216 flow [2022-12-13 05:23:12,785 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:23:12,786 INFO L89 Accepts]: Start accepts. Operand has 36 places, 48 transitions, 216 flow [2022-12-13 05:23:12,788 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:23:12,789 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:23:12,789 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 48 transitions, 216 flow [2022-12-13 05:23:12,792 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 48 transitions, 216 flow [2022-12-13 05:23:12,792 INFO L226 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-13 05:23:12,833 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:23:12,834 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-13 05:23:12,835 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 48 transitions, 216 flow [2022-12-13 05:23:12,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-13 05:23:12,835 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:23:12,835 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] [2022-12-13 05:23:12,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 05:23:12,835 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 05:23:12,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:23:12,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1486541656, now seen corresponding path program 1 times [2022-12-13 05:23:12,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:23:12,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526127772] [2022-12-13 05:23:12,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:23:12,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:23:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:23:12,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:23:12,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:23:12,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526127772] [2022-12-13 05:23:12,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526127772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:23:12,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:23:12,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 05:23:12,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260955183] [2022-12-13 05:23:12,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:23:12,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:23:12,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:23:12,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:23:12,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:23:12,922 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-13 05:23:12,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 48 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:23:12,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:23:12,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-13 05:23:12,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:23:13,156 INFO L130 PetriNetUnfolder]: 1049/1485 cut-off events. [2022-12-13 05:23:13,157 INFO L131 PetriNetUnfolder]: For 285/291 co-relation queries the response was YES. [2022-12-13 05:23:13,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4499 conditions, 1485 events. 1049/1485 cut-off events. For 285/291 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6217 event pairs, 164 based on Foata normal form. 0/996 useless extension candidates. Maximal degree in co-relation 2098. Up to 917 conditions per place. [2022-12-13 05:23:13,163 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 86 selfloop transitions, 10 changer transitions 10/108 dead transitions. [2022-12-13 05:23:13,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 108 transitions, 708 flow [2022-12-13 05:23:13,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:23:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:23:13,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-12-13 05:23:13,165 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.51875 [2022-12-13 05:23:13,165 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2022-12-13 05:23:13,165 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 108 transitions, 708 flow [2022-12-13 05:23:13,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 98 transitions, 636 flow [2022-12-13 05:23:13,178 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:23:13,178 INFO L89 Accepts]: Start accepts. Operand has 40 places, 98 transitions, 636 flow [2022-12-13 05:23:13,179 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:23:13,179 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:23:13,179 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 98 transitions, 636 flow [2022-12-13 05:23:13,181 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 98 transitions, 636 flow [2022-12-13 05:23:13,181 INFO L226 LiptonReduction]: Number of co-enabled transitions 158 [2022-12-13 05:23:13,182 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:23:13,183 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 05:23:13,183 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 98 transitions, 636 flow [2022-12-13 05:23:13,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:23:13,183 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:23:13,184 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] [2022-12-13 05:23:13,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 05:23:13,184 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 05:23:13,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:23:13,184 INFO L85 PathProgramCache]: Analyzing trace with hash 716859829, now seen corresponding path program 1 times [2022-12-13 05:23:13,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:23:13,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406287455] [2022-12-13 05:23:13,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:23:13,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:23:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:23:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:23:13,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:23:13,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406287455] [2022-12-13 05:23:13,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406287455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:23:13,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:23:13,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 05:23:13,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880688318] [2022-12-13 05:23:13,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:23:13,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:23:13,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:23:13,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:23:13,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:23:13,265 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-13 05:23:13,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 98 transitions, 636 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:23:13,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:23:13,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-13 05:23:13,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:23:13,401 INFO L130 PetriNetUnfolder]: 827/1164 cut-off events. [2022-12-13 05:23:13,401 INFO L131 PetriNetUnfolder]: For 341/349 co-relation queries the response was YES. [2022-12-13 05:23:13,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4501 conditions, 1164 events. 827/1164 cut-off events. For 341/349 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4283 event pairs, 195 based on Foata normal form. 29/813 useless extension candidates. Maximal degree in co-relation 3066. Up to 968 conditions per place. [2022-12-13 05:23:13,447 INFO L137 encePairwiseOnDemand]: 23/32 looper letters, 43 selfloop transitions, 6 changer transitions 30/81 dead transitions. [2022-12-13 05:23:13,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 81 transitions, 671 flow [2022-12-13 05:23:13,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:23:13,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:23:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-12-13 05:23:13,448 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41875 [2022-12-13 05:23:13,449 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2022-12-13 05:23:13,449 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 81 transitions, 671 flow [2022-12-13 05:23:13,453 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 51 transitions, 424 flow [2022-12-13 05:23:13,456 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:23:13,457 INFO L89 Accepts]: Start accepts. Operand has 40 places, 51 transitions, 424 flow [2022-12-13 05:23:13,458 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:23:13,458 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:23:13,458 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 51 transitions, 424 flow [2022-12-13 05:23:13,459 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 51 transitions, 424 flow [2022-12-13 05:23:13,459 INFO L226 LiptonReduction]: Number of co-enabled transitions 52 [2022-12-13 05:23:13,459 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:23:13,460 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 05:23:13,460 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 51 transitions, 424 flow [2022-12-13 05:23:13,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:23:13,460 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:23:13,460 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] [2022-12-13 05:23:13,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 05:23:13,461 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 05:23:13,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:23:13,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1378524532, now seen corresponding path program 1 times [2022-12-13 05:23:13,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:23:13,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938756718] [2022-12-13 05:23:13,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:23:13,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:23:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:23:13,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 05:23:13,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:23:13,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938756718] [2022-12-13 05:23:13,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938756718] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:23:13,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325498885] [2022-12-13 05:23:13,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:23:13,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:23:13,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:23:13,552 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-13 05:23:13,580 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-13 05:23:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:23:13,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 05:23:13,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:23:13,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 05:23:13,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:23:13,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 05:23:13,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325498885] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 05:23:13,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 05:23:13,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2022-12-13 05:23:13,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162671628] [2022-12-13 05:23:13,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:23:13,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:23:13,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:23:13,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:23:13,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 05:23:13,717 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-13 05:23:13,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 51 transitions, 424 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:23:13,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:23:13,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-13 05:23:13,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:23:13,838 INFO L130 PetriNetUnfolder]: 900/1265 cut-off events. [2022-12-13 05:23:13,839 INFO L131 PetriNetUnfolder]: For 1417/1429 co-relation queries the response was YES. [2022-12-13 05:23:13,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5904 conditions, 1265 events. 900/1265 cut-off events. For 1417/1429 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4541 event pairs, 173 based on Foata normal form. 12/928 useless extension candidates. Maximal degree in co-relation 4672. Up to 1141 conditions per place. [2022-12-13 05:23:13,846 INFO L137 encePairwiseOnDemand]: 27/32 looper letters, 69 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2022-12-13 05:23:13,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 76 transitions, 784 flow [2022-12-13 05:23:13,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:23:13,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:23:13,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-13 05:23:13,847 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-13 05:23:13,847 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2022-12-13 05:23:13,848 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 76 transitions, 784 flow [2022-12-13 05:23:13,853 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 76 transitions, 784 flow [2022-12-13 05:23:13,858 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:23:13,858 INFO L89 Accepts]: Start accepts. Operand has 44 places, 76 transitions, 784 flow [2022-12-13 05:23:13,859 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:23:13,859 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:23:13,860 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 76 transitions, 784 flow [2022-12-13 05:23:13,860 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 76 transitions, 784 flow [2022-12-13 05:23:13,861 INFO L226 LiptonReduction]: Number of co-enabled transitions 6 [2022-12-13 05:23:14,814 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:23:14,815 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 957 [2022-12-13 05:23:14,815 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 75 transitions, 774 flow [2022-12-13 05:23:14,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:23:14,815 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:23:14,815 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] [2022-12-13 05:23:14,832 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-13 05:23:15,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:23:15,021 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 05:23:15,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:23:15,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1155157663, now seen corresponding path program 1 times [2022-12-13 05:23:15,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:23:15,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274866118] [2022-12-13 05:23:15,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:23:15,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:23:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:23:15,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 05:23:15,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:23:15,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274866118] [2022-12-13 05:23:15,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274866118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:23:15,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:23:15,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 05:23:15,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080843492] [2022-12-13 05:23:15,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:23:15,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:23:15,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:23:15,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:23:15,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:23:15,142 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-13 05:23:15,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 75 transitions, 774 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:23:15,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:23:15,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-13 05:23:15,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:23:15,317 INFO L130 PetriNetUnfolder]: 1003/1402 cut-off events. [2022-12-13 05:23:15,318 INFO L131 PetriNetUnfolder]: For 2390/2406 co-relation queries the response was YES. [2022-12-13 05:23:15,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7919 conditions, 1402 events. 1003/1402 cut-off events. For 2390/2406 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4955 event pairs, 74 based on Foata normal form. 16/1060 useless extension candidates. Maximal degree in co-relation 6478. Up to 1286 conditions per place. [2022-12-13 05:23:15,327 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 103 selfloop transitions, 8 changer transitions 0/113 dead transitions. [2022-12-13 05:23:15,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 113 transitions, 1394 flow [2022-12-13 05:23:15,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:23:15,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:23:15,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-13 05:23:15,330 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35625 [2022-12-13 05:23:15,333 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2022-12-13 05:23:15,333 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 113 transitions, 1394 flow [2022-12-13 05:23:15,347 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 113 transitions, 1394 flow [2022-12-13 05:23:15,354 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:23:15,355 INFO L89 Accepts]: Start accepts. Operand has 47 places, 113 transitions, 1394 flow [2022-12-13 05:23:15,357 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:23:15,357 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:23:15,357 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 113 transitions, 1394 flow [2022-12-13 05:23:15,359 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 113 transitions, 1394 flow [2022-12-13 05:23:15,359 INFO L226 LiptonReduction]: Number of co-enabled transitions 6 [2022-12-13 05:23:18,378 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:23:18,381 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3027 [2022-12-13 05:23:18,384 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 112 transitions, 1382 flow [2022-12-13 05:23:18,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:23:18,384 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:23:18,385 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] [2022-12-13 05:23:18,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 05:23:18,385 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 05:23:18,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:23:18,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1150241157, now seen corresponding path program 1 times [2022-12-13 05:23:18,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:23:18,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541589497] [2022-12-13 05:23:18,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:23:18,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:23:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:23:18,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 05:23:18,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:23:18,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541589497] [2022-12-13 05:23:18,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541589497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:23:18,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:23:18,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 05:23:18,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119911271] [2022-12-13 05:23:18,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:23:18,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 05:23:18,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:23:18,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 05:23:18,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 05:23:18,487 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 33 [2022-12-13 05:23:18,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 112 transitions, 1382 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:23:18,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:23:18,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 33 [2022-12-13 05:23:18,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:23:18,656 INFO L130 PetriNetUnfolder]: 962/1319 cut-off events. [2022-12-13 05:23:18,657 INFO L131 PetriNetUnfolder]: For 4833/4991 co-relation queries the response was YES. [2022-12-13 05:23:18,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8733 conditions, 1319 events. 962/1319 cut-off events. For 4833/4991 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4575 event pairs, 46 based on Foata normal form. 32/1031 useless extension candidates. Maximal degree in co-relation 8293. Up to 1223 conditions per place. [2022-12-13 05:23:18,664 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 139 selfloop transitions, 9 changer transitions 0/150 dead transitions. [2022-12-13 05:23:18,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 150 transitions, 2134 flow [2022-12-13 05:23:18,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 05:23:18,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 05:23:18,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-13 05:23:18,665 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2022-12-13 05:23:18,667 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2022-12-13 05:23:18,667 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 150 transitions, 2134 flow [2022-12-13 05:23:18,674 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 150 transitions, 2134 flow [2022-12-13 05:23:18,680 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:23:18,680 INFO L89 Accepts]: Start accepts. Operand has 49 places, 150 transitions, 2134 flow [2022-12-13 05:23:18,681 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:23:18,682 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:23:18,682 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 150 transitions, 2134 flow [2022-12-13 05:23:18,684 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 150 transitions, 2134 flow [2022-12-13 05:23:18,686 INFO L226 LiptonReduction]: Number of co-enabled transitions 6 [2022-12-13 05:23:18,686 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:23:18,690 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 05:23:18,690 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 150 transitions, 2134 flow [2022-12-13 05:23:18,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:23:18,690 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:23:18,691 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] [2022-12-13 05:23:18,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 05:23:18,691 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 05:23:18,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:23:18,691 INFO L85 PathProgramCache]: Analyzing trace with hash 482003120, now seen corresponding path program 1 times [2022-12-13 05:23:18,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:23:18,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800115490] [2022-12-13 05:23:18,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:23:18,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:23:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:23:19,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 05:23:19,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:23:19,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800115490] [2022-12-13 05:23:19,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800115490] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:23:19,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764928614] [2022-12-13 05:23:19,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:23:19,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:23:19,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:23:19,996 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-13 05:23:19,999 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-13 05:23:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:23:20,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 05:23:20,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:23:20,493 INFO L321 Elim1Store]: treesize reduction 134, result has 27.6 percent of original size [2022-12-13 05:23:20,494 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 4 case distinctions, treesize of input 18 treesize of output 56 [2022-12-13 05:23:20,561 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 05:23:20,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2022-12-13 05:23:20,731 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 05:23:20,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2022-12-13 05:23:20,995 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:23:20,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 23 [2022-12-13 05:23:21,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 05:23:21,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:23:21,169 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:23:21,170 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 316 treesize of output 296 [2022-12-13 05:23:21,589 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 231 treesize of output 225 [2022-12-13 05:23:22,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 147 treesize of output 143 [2022-12-13 05:23:22,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 231 treesize of output 225 [2022-12-13 05:23:22,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 61 [2022-12-13 05:23:22,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:23:22,651 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 317 treesize of output 309 [2022-12-13 05:23:22,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:23:22,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:23:22,694 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 147 treesize of output 143 [2022-12-13 05:23:22,702 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 63 treesize of output 61 [2022-12-13 05:23:22,708 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 147 treesize of output 143 [2022-12-13 05:23:25,568 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:23:25,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 147 treesize of output 145 [2022-12-13 05:23:25,589 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:23:25,590 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 115 treesize of output 93 [2022-12-13 05:23:25,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:23:25,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:23:25,820 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-12-13 05:23:25,828 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 05:23:25,829 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 70 treesize of output 50 [2022-12-13 05:23:25,844 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 05:23:25,844 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 89 treesize of output 69 [2022-12-13 05:23:25,853 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 05:23:25,853 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 65 treesize of output 47 [2022-12-13 05:23:25,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:23:25,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:23:25,901 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 80 [2022-12-13 05:23:26,217 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 05:23:26,217 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 283 treesize of output 1 [2022-12-13 05:23:26,411 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-12-13 05:23:26,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 231 treesize of output 1 [2022-12-13 05:23:27,100 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-12-13 05:23:27,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 317 treesize of output 1 [2022-12-13 05:23:27,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:23:27,111 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 05:23:27,111 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 30 treesize of output 1 [2022-12-13 05:23:27,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:23:27,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:23:27,117 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-12-13 05:23:27,128 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 05:23:27,128 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 76 treesize of output 1 [2022-12-13 05:23:27,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:23:27,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:23:27,135 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 51 [2022-12-13 05:23:27,246 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 05:23:27,246 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 198 treesize of output 1 [2022-12-13 05:23:27,261 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-12-13 05:23:27,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 147 treesize of output 1 [2022-12-13 05:23:27,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:23:27,274 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 05:23:27,274 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 72 treesize of output 1 [2022-12-13 05:23:27,484 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:23:27,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 231 treesize of output 225 [2022-12-13 05:24:11,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:11,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:13,404 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:24:13,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 317 treesize of output 209 [2022-12-13 05:24:27,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:27,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:27,420 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:24:27,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 25 [2022-12-13 05:24:27,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:27,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:27,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:27,520 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:24:27,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 23 [2022-12-13 05:24:27,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:27,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:27,851 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-12-13 05:24:27,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 147 treesize of output 1 [2022-12-13 05:24:27,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:27,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:27,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:27,881 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 05:24:27,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 1 [2022-12-13 05:24:27,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:27,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:27,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:27,980 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 05:24:27,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 113 treesize of output 1 [2022-12-13 05:24:27,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:27,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:27,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:28,070 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 05:24:28,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 1 [2022-12-13 05:24:28,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:28,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:28,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:28,348 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 05:24:28,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 1 [2022-12-13 05:24:28,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:28,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:30,463 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-12-13 05:24:30,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 147 treesize of output 1 [2022-12-13 05:24:30,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:30,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:30,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:30,994 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 05:24:31,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 1 [2022-12-13 05:24:31,057 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:24:31,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 171 [2022-12-13 05:24:32,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:32,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:39,663 WARN L233 SmtUtils]: Spent 7.43s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-13 05:24:39,663 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:24:39,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 231 treesize of output 161 [2022-12-13 05:24:43,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:43,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:24:53,675 WARN L233 SmtUtils]: Spent 9.95s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-13 05:24:53,675 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:24:53,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 317 treesize of output 209 [2022-12-13 05:25:22,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:22,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:22,066 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:25:22,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 25 [2022-12-13 05:25:22,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:22,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:22,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:22,158 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 05:25:22,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 1 [2022-12-13 05:25:22,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:22,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:22,210 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-12-13 05:25:22,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 147 treesize of output 1 [2022-12-13 05:25:22,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:22,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:22,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:22,281 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:25:22,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 23 [2022-12-13 05:25:22,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:22,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:22,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:25,432 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:25:25,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 113 treesize of output 55 [2022-12-13 05:25:49,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:49,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:49,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:49,757 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:25:49,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 23 [2022-12-13 05:25:50,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:50,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:50,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:52,477 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 05:25:52,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 1 [2022-12-13 05:25:52,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:52,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:52,558 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-12-13 05:25:52,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 147 treesize of output 1 [2022-12-13 05:25:52,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:52,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:52,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:53,031 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 05:25:53,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 1 [2022-12-13 05:25:53,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:53,080 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 110 [2022-12-13 05:25:53,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:54,980 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 05:25:54,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 223 treesize of output 1 [2022-12-13 05:25:55,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:55,009 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-12-13 05:25:55,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:55,025 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 49 [2022-12-13 05:25:55,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:55,058 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 287 treesize of output 231 [2022-12-13 05:25:55,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:55,071 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 170 [2022-12-13 05:25:55,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:55,263 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 1406 treesize of output 1091 [2022-12-13 05:25:55,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:25:55,280 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 1091 treesize of output 775 [2022-12-13 05:26:00,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:00,789 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 110 [2022-12-13 05:26:00,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:00,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:00,836 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 85 [2022-12-13 05:26:02,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,361 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 71 [2022-12-13 05:26:02,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,468 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 05:26:02,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 141 treesize of output 1 [2022-12-13 05:26:02,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,487 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 72 [2022-12-13 05:26:02,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,502 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 55 [2022-12-13 05:26:02,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,556 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 150 [2022-12-13 05:26:02,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,658 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 05:26:02,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 295 treesize of output 1 [2022-12-13 05:26:02,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,667 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2022-12-13 05:26:02,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,680 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 05:26:02,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,707 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2022-12-13 05:26:02,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,732 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 05:26:02,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 1 [2022-12-13 05:26:02,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,742 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 72 [2022-12-13 05:26:02,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,768 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 05:26:02,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 155 treesize of output 1 [2022-12-13 05:26:02,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,777 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2022-12-13 05:26:02,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,803 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 05:26:02,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,823 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2022-12-13 05:26:02,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,831 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 28 treesize of output 16 [2022-12-13 05:26:02,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,855 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2022-12-13 05:26:02,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,872 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 05:26:02,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,901 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 71 [2022-12-13 05:26:02,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,917 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 41 [2022-12-13 05:26:02,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:02,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:03,104 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-12-13 05:26:03,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 317 treesize of output 1 [2022-12-13 05:26:03,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:03,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:03,132 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:26:03,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 25 [2022-12-13 05:26:03,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:03,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:03,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:04,161 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 05:26:04,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 113 treesize of output 1 [2022-12-13 05:26:04,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:04,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:04,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:04,216 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 05:26:04,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 1 [2022-12-13 05:26:04,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:04,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:04,640 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-12-13 05:26:04,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 231 treesize of output 1 [2022-12-13 05:26:04,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:04,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:04,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:04,779 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 05:26:04,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 1 [2022-12-13 05:26:04,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:04,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:04,838 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-12-13 05:26:04,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 1 [2022-12-13 05:26:04,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:04,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:04,873 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-12-13 05:26:04,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 147 treesize of output 1 [2022-12-13 05:26:04,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:04,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:04,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:05,363 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 05:26:05,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 1 [2022-12-13 05:26:05,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:05,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:07,761 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-12-13 05:26:07,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 147 treesize of output 1 [2022-12-13 05:26:07,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:07,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:11,221 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 05:26:11,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 1406 treesize of output 1 [2022-12-13 05:26:11,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:11,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:11,321 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 05:26:11,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 287 treesize of output 1 [2022-12-13 05:26:11,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:11,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:13,455 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 05:26:13,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 1 [2022-12-13 05:26:13,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:13,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:13,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:15,172 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 05:26:15,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 1 [2022-12-13 05:26:15,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:15,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:15,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:26:15,235 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 05:26:15,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 1 [2022-12-13 05:26:17,284 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse80 (- c_~bsum~0)) (.cse81 (- c_~asum~0)) (.cse60 (* c_~bsum~0 4294967295)) (.cse61 (* c_~asum~0 4294967295))) (let ((.cse33 (* 4294967295 c_~csum~0)) (.cse2 (* c_~asum~0 4294967296)) (.cse3 (* c_~bsum~0 4294967296)) (.cse4 (* c_~csum~0 4294967296)) (.cse0 (= c_~C~0.base c_~A~0.base)) (.cse13 (+ .cse60 .cse61 c_~csum~0)) (.cse112 (div (+ (- c_~csum~0) 4294967295) 2)) (.cse113 (div (+ .cse80 .cse81 4294967295) 2)) (.cse36 (= c_~B~0.base c_~C~0.base)) (.cse62 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse31 (= (+ c_~A~0.offset .cse62) c_~B~0.offset)) (.cse27 (= .cse62 0)) (.cse35 (not .cse36)) (.cse39 (< (+ (* 4294967296 (div (+ (* .cse113 2) c_~csum~0) 4294967296)) c_~asum~0 c_~bsum~0) (+ c_~csum~0 1))) (.cse82 (< .cse13 (+ (* (div (+ (- 1) .cse60 .cse61 (* (- 2) .cse112)) 4294967296) 4294967296) 4294967297))) (.cse34 (not .cse0)) (.cse11 (+ .cse60 .cse61 c_~csum~0 4294967296)) (.cse30 (* 4294967294 c_~csum~0)) (.cse5 (* c_~bsum~0 2)) (.cse6 (* c_~csum~0 4294967293)) (.cse7 (* c_~asum~0 2)) (.cse10 (+ .cse2 .cse3 .cse4 4294967296)) (.cse9 (+ .cse2 .cse3 .cse4)) (.cse16 (= c_~A~0.offset c_~B~0.offset)) (.cse19 (+ c_~asum~0 c_~bsum~0 .cse33))) (and (or .cse0 (and (or (forall ((aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_87_66_46_100_127 Int) (aux_mod_v_arrayElimCell_86_108 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_arrayElimCell_87_66_46_100_127 Int) (aux_div_aux_mod_v_arrayElimCell_87_66_46 Int) (aux_div_aux_mod_aux_mod_v_arrayElimCell_87_66_46_100 Int)) (let ((.cse15 (* aux_div_aux_mod_aux_mod_v_arrayElimCell_87_66_46_100 4294967296)) (.cse14 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_v_arrayElimCell_87_66_46_100_127))) (let ((.cse1 (+ (* 4294967296 aux_div_aux_mod_v_arrayElimCell_87_66_46) aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_87_66_46_100_127 .cse15 .cse14)) (.cse8 (+ aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_87_66_46_100_127 .cse15 .cse14)) (.cse12 (+ aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_87_66_46_100_127 .cse14))) (or (= .cse1 (+ .cse2 .cse3 .cse4 (mod (+ .cse5 (* 3 aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_87_66_46_100_127) .cse6 (* 4294967295 aux_mod_v_arrayElimCell_86_108) .cse7) 4294967296))) (= .cse8 (+ .cse2 .cse3 .cse4 aux_mod_v_arrayElimCell_86_108)) (< .cse1 .cse9) (<= .cse10 .cse1) (>= aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_87_66_46_100_127 4294967296) (<= .cse11 .cse12) (>= aux_mod_v_arrayElimCell_86_108 4294967296) (> 0 aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_87_66_46_100_127) (< .cse8 .cse9) (> 0 aux_mod_v_arrayElimCell_86_108) (<= .cse10 .cse8) (< .cse12 .cse13) (= .cse14 .cse13))))) .cse16) (forall ((v_arrayElimCell_87 Int)) (let ((.cse18 (* 2 v_arrayElimCell_87))) (let ((.cse17 (mod (+ c_~csum~0 .cse18) 4294967296))) (or (= (mod (+ c_~asum~0 c_~bsum~0 (* 3 v_arrayElimCell_87)) 4294967296) .cse17) (= .cse17 (mod (+ c_~asum~0 c_~bsum~0 .cse18) 4294967296)))))))) (forall ((aux_div_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101 Int)) (let ((.cse20 (* 4294967296 aux_div_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101))) (or (= .cse19 .cse20) (forall ((aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101_128 Int)) (or (>= aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101_128 4294967296) (> 0 aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101_128) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101_128 Int)) (let ((.cse25 (* aux_div_aux_mod_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101_128 4294967296))) (let ((.cse21 (+ .cse25 aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101_128 .cse20)) (.cse22 (+ .cse25 aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101_128))) (or (< .cse21 .cse9) (< .cse22 .cse13) (<= .cse10 .cse21) (<= .cse11 .cse22) (forall ((aux_div_aux_mod_v_arrayElimCell_102_68_47 Int)) (let ((.cse24 (+ .cse25 (* aux_div_aux_mod_v_arrayElimCell_102_68_47 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101_128 .cse20))) (or (forall ((aux_mod_v_arrayElimCell_101_110 Int)) (let ((.cse23 (* 3 aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101_128))) (or (forall ((aux_div_v_arrayElimCell_102_68 Int) (aux_div_v_arrayElimCell_101_110 Int)) (not (= (+ (* 8589934592 aux_div_v_arrayElimCell_101_110) (* c_~bsum~0 12884901886) (* aux_mod_v_arrayElimCell_101_110 2) (* c_~csum~0 4294967299) (* c_~asum~0 12884901886)) (+ .cse23 (* aux_div_v_arrayElimCell_102_68 4294967296) (* aux_div_aux_mod_v_arrayElimCell_102_68_47 12884901888) (* 12884901888 aux_div_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101) (* aux_div_aux_mod_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101_128 12884901888))))) (> 0 aux_mod_v_arrayElimCell_101_110) (= .cse24 (+ .cse2 (mod (+ .cse23 .cse5 .cse6 (* aux_mod_v_arrayElimCell_101_110 4294967295) .cse7) 4294967296) .cse3 .cse4)) (= aux_mod_v_arrayElimCell_101_110 aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101_128) (>= aux_mod_v_arrayElimCell_101_110 4294967296)))) (< .cse24 .cse9) (<= .cse10 .cse24))))))))))))) (or (let ((.cse28 (forall ((v_arrayElimCell_85 Int)) (= (mod (+ c_~asum~0 c_~bsum~0 (* 3 v_arrayElimCell_85)) 4294967296) (mod (+ (* 2 v_arrayElimCell_85) c_~csum~0) 4294967296))))) (and (forall ((v_arrayElimCell_85 Int)) (let ((.cse26 (mod (+ (* 2 v_arrayElimCell_85) c_~csum~0) 4294967296))) (or (= (mod (+ c_~asum~0 c_~bsum~0 (* 3 v_arrayElimCell_85)) 4294967296) .cse26) (= (mod (+ (* 4 v_arrayElimCell_85) c_~asum~0 c_~bsum~0) 4294967296) .cse26)))) (or (and .cse27 .cse28) .cse16) (let ((.cse29 (* c_thread2Thread1of1ForFork1_~i~1 8))) (or (= (+ c_~A~0.offset .cse29) c_~B~0.offset) (and (forall ((v_arrayElimCell_85 Int) (aux_mod_v_arrayElimCell_82_66 Int)) (or (>= aux_mod_v_arrayElimCell_82_66 4294967296) (= (mod (+ c_~asum~0 c_~bsum~0 (* 4294967295 v_arrayElimCell_85) (* 2 aux_mod_v_arrayElimCell_82_66) .cse30) 4294967296) aux_mod_v_arrayElimCell_82_66) (> 0 aux_mod_v_arrayElimCell_82_66))) (or .cse31 (= .cse29 0)) .cse27 .cse28))) (or (and (forall ((v_arrayElimCell_85 Int)) (= (mod (+ (* 4 v_arrayElimCell_85) c_~asum~0 c_~bsum~0) 4294967296) (mod (+ (* 2 v_arrayElimCell_85) c_~csum~0) 4294967296))) (forall ((aux_mod_v_arrayElimCell_85_47 Int)) (let ((.cse32 (mod (+ c_~asum~0 c_~bsum~0 (* aux_mod_v_arrayElimCell_85_47 4) (* 4294967292 c_~csum~0)) 4294967296))) (or (= aux_mod_v_arrayElimCell_85_47 .cse32) (= (mod (+ (* 2 aux_mod_v_arrayElimCell_85_47) .cse33) 4294967296) .cse32) (>= aux_mod_v_arrayElimCell_85_47 4294967296) (> 0 aux_mod_v_arrayElimCell_85_47))))) .cse34 (not .cse16)))) .cse35) (or .cse36 (and (forall ((v_arrayElimCell_60 Int)) (let ((.cse38 (* 2 v_arrayElimCell_60))) (let ((.cse37 (mod (+ .cse38 c_~csum~0) 4294967296))) (or (= .cse37 (mod (+ c_~asum~0 c_~bsum~0 (* 4 v_arrayElimCell_60)) 4294967296)) (= (mod (+ c_~asum~0 .cse38 c_~bsum~0) 4294967296) .cse37) (= (mod (+ c_~asum~0 c_~bsum~0 (* 3 v_arrayElimCell_60)) 4294967296) .cse37))))) .cse39 (or .cse0 (let ((.cse49 (forall ((v_arrayElimCell_56 Int)) (let ((.cse72 (* 2 v_arrayElimCell_56))) (let ((.cse71 (mod (+ c_~csum~0 .cse72) 4294967296))) (or (= (mod (+ (* 3 v_arrayElimCell_56) c_~asum~0 c_~bsum~0) 4294967296) .cse71) (= (mod (+ c_~asum~0 c_~bsum~0 .cse72) 4294967296) .cse71))))))) (and (forall ((v_arrayElimCell_56 Int)) (let ((.cse44 (* 2 v_arrayElimCell_56))) (let ((.cse41 (mod (+ c_~csum~0 .cse44) 4294967296)) (.cse42 (mod (+ c_~asum~0 c_~bsum~0 .cse44) 4294967296)) (.cse40 (mod (+ (* 3 v_arrayElimCell_56) c_~asum~0 c_~bsum~0) 4294967296))) (or (= .cse40 .cse41) (< .cse42 (+ 2 .cse40)) (= .cse42 .cse41) (forall ((aux_div_aux_mod_aux_mod_v_arrayElimCell_57_47_46_57 Int)) (let ((.cse43 (* aux_div_aux_mod_aux_mod_v_arrayElimCell_57_47_46_57 4294967296))) (or (< .cse42 (+ .cse43 2 .cse40)) (< (+ .cse43 4294967294) .cse40)))))))) (forall ((v_arrayElimCell_56 Int)) (let ((.cse48 (* 2 v_arrayElimCell_56))) (let ((.cse46 (mod (+ c_~csum~0 .cse48) 4294967296)) (.cse45 (mod (+ (* 3 v_arrayElimCell_56) c_~asum~0 c_~bsum~0) 4294967296)) (.cse47 (mod (+ c_~asum~0 c_~bsum~0 .cse48) 4294967296))) (or (= .cse45 .cse46) (= .cse47 .cse46) (< 4294967294 .cse45) (< 4294967294 .cse47))))) .cse49 .cse27 (or (and (or .cse31 (and (forall ((aux_div_aux_mod_aux_mod_v_arrayElimCell_54_80_84_115 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_arrayElimCell_54_80_84_115_69 Int) (aux_div_aux_mod_v_arrayElimCell_54_80_84 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_54_80_84_115_69_80 Int) (aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_54_80_84_115_69_80 Int) (v_arrayElimCell_56 Int)) (let ((.cse59 (* aux_div_aux_mod_v_arrayElimCell_54_80_84 4294967296)) (.cse57 (* 4294967295 v_arrayElimCell_56)) (.cse54 (* aux_div_aux_mod_aux_mod_aux_mod_v_arrayElimCell_54_80_84_115_69 4294967296)) (.cse56 (* aux_div_aux_mod_aux_mod_v_arrayElimCell_54_80_84_115 4294967296)) (.cse55 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_54_80_84_115_69_80 4294967296))) (let ((.cse52 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_54_80_84_115_69_80 .cse55)) (.cse53 (+ .cse54 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_54_80_84_115_69_80 .cse55 .cse56)) (.cse51 (+ .cse60 .cse61 .cse57 c_~csum~0)) (.cse50 (+ .cse59 .cse54 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_54_80_84_115_69_80 .cse55 .cse56)) (.cse58 (+ .cse54 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_54_80_84_115_69_80 .cse55))) (or (< .cse50 .cse51) (<= 4294967296 .cse52) (< .cse52 0) (< .cse53 .cse13) (= (+ .cse54 .cse55 .cse56) .cse13) (= (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_54_80_84_115_69_80 2) c_~asum~0 .cse57 c_~bsum~0 .cse30) 4294967296) .cse52) (> 0 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_54_80_84_115_69_80) (< .cse58 0) (<= .cse11 .cse53) (= .cse51 (+ .cse59 .cse56)) (<= (+ .cse60 .cse61 .cse57 c_~csum~0 4294967296) .cse50) (>= aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_54_80_84_115_69_80 4294967296) (<= 4294967296 .cse58))))) .cse49 .cse27)) .cse27) (= c_~A~0.offset (+ .cse62 c_~B~0.offset))) (forall ((v_arrayElimCell_56 Int)) (let ((.cse66 (* 2 v_arrayElimCell_56))) (let ((.cse64 (mod (+ c_~csum~0 .cse66) 4294967296)) (.cse65 (mod (+ c_~asum~0 c_~bsum~0 .cse66) 4294967296)) (.cse63 (mod (+ (* 3 v_arrayElimCell_56) c_~asum~0 c_~bsum~0) 4294967296))) (or (= .cse63 .cse64) (= .cse65 .cse64) (< .cse65 1) (< .cse63 1))))) (forall ((v_arrayElimCell_56 Int)) (let ((.cse70 (* 2 v_arrayElimCell_56))) (let ((.cse68 (mod (+ c_~csum~0 .cse70) 4294967296)) (.cse67 (mod (+ (* 3 v_arrayElimCell_56) c_~asum~0 c_~bsum~0) 4294967296)) (.cse69 (mod (+ c_~asum~0 c_~bsum~0 .cse70) 4294967296))) (or (= .cse67 .cse68) (= .cse69 .cse68) (< .cse67 (+ 2 .cse69))))))))) (or (and (forall ((aux_div_aux_mod_aux_mod_v_arrayElimCell_20_74_157_58 Int) (aux_div_aux_mod_v_arrayElimCell_20_74_157 Int) (v_arrayElimCell_24 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_arrayElimCell_20_74_157_58_131 Int)) (let ((.cse78 (* 4294967296 v_arrayElimCell_24))) (let ((.cse75 (* 4294967297 v_arrayElimCell_24)) (.cse74 (+ c_~asum~0 c_~bsum~0 .cse33 v_arrayElimCell_24)) (.cse73 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_v_arrayElimCell_20_74_157_58_131)) (.cse77 (* aux_div_aux_mod_aux_mod_v_arrayElimCell_20_74_157_58 4294967296)) (.cse76 (* aux_div_aux_mod_v_arrayElimCell_20_74_157 4294967296)) (.cse79 (+ .cse60 .cse61 c_~csum~0 .cse78))) (or (= .cse73 .cse74) (< (+ .cse2 .cse3 4294967295 .cse4 .cse75) (+ .cse76 .cse73 .cse77)) (< (+ .cse76 .cse73 4294967295 .cse77) (+ .cse2 .cse3 .cse4 .cse75)) (< (+ 4294967295 .cse77) 0) (< (+ .cse60 .cse61 4294967295 c_~csum~0 .cse78) .cse76) (< (+ .cse76 4294967295) .cse79) (< (+ .cse73 4294967295 .cse77) .cse74) (< (+ c_~asum~0 c_~bsum~0 4294967295 .cse33 v_arrayElimCell_24) .cse73) (< 4294967295 .cse77) (= .cse76 .cse79))))) (or .cse34 (and (forall ((aux_mod_v_arrayElimCell_31_66 Int)) (or (>= aux_mod_v_arrayElimCell_31_66 4294967296) (> 0 aux_mod_v_arrayElimCell_31_66) (forall ((aux_mod_v_arrayElimCell_29_47 Int)) (or (>= aux_mod_v_arrayElimCell_29_47 4294967296) (= aux_mod_v_arrayElimCell_29_47 (mod (+ c_~asum~0 (* 2 aux_mod_v_arrayElimCell_31_66) c_~bsum~0 (* 4294967295 aux_mod_v_arrayElimCell_29_47) .cse33) 4294967296)) (> 0 aux_mod_v_arrayElimCell_29_47))))) (forall ((aux_mod_v_arrayElimCell_31_66 Int)) (or (>= aux_mod_v_arrayElimCell_31_66 4294967296) (> 0 aux_mod_v_arrayElimCell_31_66) (forall ((v_arrayElimCell_29 Int)) (= aux_mod_v_arrayElimCell_31_66 (mod (+ (* 4294967295 v_arrayElimCell_29) c_~asum~0 (* 2 aux_mod_v_arrayElimCell_31_66) c_~bsum~0 .cse30) 4294967296))))))) .cse27 (< (+ c_~asum~0 c_~bsum~0 (* (div (+ .cse80 .cse81 4294967295 (* c_~csum~0 (- 4294967295))) 4294967296) 4294967296) .cse33) 1)) (= c_~B~0.base c_~A~0.base)) .cse82 (or (< (* (div (+ .cse60 .cse61 4294967295 c_~csum~0) 4294967296) 4294967296) (+ .cse60 .cse61 c_~csum~0 1)) .cse16) (or .cse34 (and (or (forall ((aux_mod_v_arrayElimCell_63_66 Int) (v_arrayElimCell_62 Int)) (or (> 0 aux_mod_v_arrayElimCell_63_66) (>= aux_mod_v_arrayElimCell_63_66 4294967296) (= (mod (+ (* 4294967295 v_arrayElimCell_62) c_~asum~0 c_~bsum~0 (* 2 aux_mod_v_arrayElimCell_63_66) .cse30) 4294967296) aux_mod_v_arrayElimCell_63_66))) .cse16) (forall ((aux_div_v_arrayElimCell_63_66 Int) (v_arrayElimCell_62 Int)) (let ((.cse84 (+ (* 2 v_arrayElimCell_62) c_~csum~0)) (.cse83 (* aux_div_v_arrayElimCell_63_66 4294967296))) (or (= (+ .cse83 (mod (+ c_~asum~0 c_~bsum~0 (* 3 v_arrayElimCell_62)) 4294967296)) .cse84) (<= (+ .cse83 4294967296) .cse84) (< .cse84 .cse83)))))) (or .cse16 (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_arrayElimCell_60_66_46_57_111 Int) (aux_div_aux_mod_v_arrayElimCell_60_66_46 Int) (aux_mod_v_arrayElimCell_59_108 Int) (aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_60_66_46_57_111_138 Int) (aux_div_aux_mod_aux_mod_v_arrayElimCell_60_66_46_57 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_60_66_46_57_111_138 Int)) (let ((.cse91 (* aux_div_aux_mod_aux_mod_v_arrayElimCell_60_66_46_57 4294967296)) (.cse90 (* aux_div_aux_mod_aux_mod_aux_mod_v_arrayElimCell_60_66_46_57_111 4294967296)) (.cse89 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_60_66_46_57_111_138))) (let ((.cse85 (+ .cse89 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_60_66_46_57_111_138)) (.cse86 (+ .cse89 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_60_66_46_57_111_138 .cse90)) (.cse88 (+ .cse89 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_60_66_46_57_111_138 (* aux_div_aux_mod_v_arrayElimCell_60_66_46 4294967296) .cse90 .cse91)) (.cse87 (+ .cse89 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_60_66_46_57_111_138 .cse90 .cse91))) (or (< .cse85 .cse13) (> 0 aux_mod_v_arrayElimCell_59_108) (<= .cse11 .cse85) (= (+ .cse2 .cse3 (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_60_66_46_57_111_138 3) (* 4294967295 aux_mod_v_arrayElimCell_59_108) .cse5 .cse6 .cse7) 4294967296) .cse4) .cse86) (>= aux_mod_v_arrayElimCell_59_108 4294967296) (<= .cse10 .cse86) (= (+ .cse2 .cse3 .cse4 aux_mod_v_arrayElimCell_59_108) .cse87) (< .cse86 .cse9) (< .cse88 .cse9) (<= .cse10 .cse88) (= .cse89 .cse13) (> 0 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_60_66_46_57_111_138) (= .cse88 (+ (mod (+ c_~asum~0 c_~bsum~0 .cse30 (* aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_60_66_46_57_111_138 2)) 4294967296) .cse2 .cse3 .cse4)) (< .cse87 .cse9) (<= .cse10 .cse87) (>= aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_60_66_46_57_111_138 4294967296)))))))) (or (and (or (and .cse16 (forall ((v_arrayElimCell_150 Int) (aux_div_aux_mod_v_arrayElimCell_151_68_110 Int)) (let ((.cse92 (* 4294967296 aux_div_aux_mod_v_arrayElimCell_151_68_110))) (or (= .cse92 (+ c_~asum~0 c_~bsum~0 v_arrayElimCell_150 .cse33)) (forall ((aux_div_v_arrayElimCell_151_68 Int)) (let ((.cse93 (+ c_~asum~0 c_~bsum~0 .cse4 (* 3 v_arrayElimCell_150))) (.cse95 (+ c_~csum~0 (* 2 v_arrayElimCell_150))) (.cse94 (* aux_div_v_arrayElimCell_151_68 4294967296))) (or (< .cse93 (+ .cse92 .cse94)) (<= (+ .cse92 .cse94 4294967296) .cse93) (<= (+ .cse94 4294967296) .cse95) (< .cse95 .cse94)))))))) .cse35) (or (forall ((v_arrayElimCell_142 Int) (aux_mod_v_arrayElimCell_141_68 Int)) (or (> 0 aux_mod_v_arrayElimCell_141_68) (= (mod (+ c_~asum~0 c_~bsum~0 (* 4294967295 v_arrayElimCell_142) (* 2 aux_mod_v_arrayElimCell_141_68) .cse30) 4294967296) aux_mod_v_arrayElimCell_141_68) (>= aux_mod_v_arrayElimCell_141_68 4294967296))) .cse35)) .cse0) .cse39 (or (forall ((aux_mod_v_arrayElimCell_101_110 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101_128 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101_128 Int) (aux_div_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101 Int) (aux_div_aux_mod_v_arrayElimCell_102_68_47 Int)) (let ((.cse100 (* aux_div_aux_mod_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101_128 4294967296)) (.cse98 (* 4294967296 aux_div_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101))) (let ((.cse96 (+ .cse100 aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101_128 .cse98)) (.cse97 (+ .cse100 aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101_128)) (.cse99 (+ .cse100 (* aux_div_aux_mod_v_arrayElimCell_102_68_47 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101_128 .cse98))) (or (< .cse96 .cse9) (< .cse97 .cse13) (>= aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101_128 4294967296) (= .cse19 .cse98) (> 0 aux_mod_v_arrayElimCell_101_110) (<= .cse10 .cse96) (> 0 aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101_128) (= .cse99 (+ .cse2 (mod (+ (* 3 aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101_128) .cse5 .cse6 (* aux_mod_v_arrayElimCell_101_110 4294967295) .cse7) 4294967296) .cse3 .cse4)) (<= .cse11 .cse97) (< .cse99 .cse9) (<= .cse10 .cse99) (= aux_mod_v_arrayElimCell_101_110 aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_102_68_47_101_128) (>= aux_mod_v_arrayElimCell_101_110 4294967296))))) .cse16) .cse82 (forall ((v_arrayElimCell_90 Int)) (let ((.cse101 (* 2 v_arrayElimCell_90))) (let ((.cse102 (mod (+ c_~csum~0 .cse101) 4294967296))) (or (= (mod (+ c_~asum~0 c_~bsum~0 .cse101) 4294967296) .cse102) (= (mod (+ c_~asum~0 (* 4 v_arrayElimCell_90) c_~bsum~0) 4294967296) .cse102) (= (mod (+ c_~asum~0 (* 3 v_arrayElimCell_90) c_~bsum~0) 4294967296) .cse102))))) (or (and .cse36 .cse16) .cse34 (and (or (forall ((aux_mod_v_arrayElimCell_93_66 Int) (v_arrayElimCell_92 Int)) (or (> 0 aux_mod_v_arrayElimCell_93_66) (>= aux_mod_v_arrayElimCell_93_66 4294967296) (= aux_mod_v_arrayElimCell_93_66 (mod (+ c_~asum~0 c_~bsum~0 (* 2 aux_mod_v_arrayElimCell_93_66) (* 4294967295 v_arrayElimCell_92) .cse30) 4294967296)))) .cse16) (forall ((v_arrayElimCell_92 Int) (aux_div_v_arrayElimCell_93_66 Int)) (let ((.cse104 (+ c_~csum~0 (* 2 v_arrayElimCell_92))) (.cse103 (* aux_div_v_arrayElimCell_93_66 4294967296))) (or (= (+ .cse103 (mod (+ c_~asum~0 c_~bsum~0 (* 3 v_arrayElimCell_92)) 4294967296)) .cse104) (<= (+ .cse103 4294967296) .cse104) (< .cse104 .cse103)))))) (or (forall ((aux_div_aux_mod_v_arrayElimCell_89_66_46 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_89_66_46_57_111_138 Int) (aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_89_66_46_57_111_138 Int) (aux_div_aux_mod_aux_mod_v_arrayElimCell_89_66_46_57 Int) (aux_mod_v_arrayElimCell_90_108 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_arrayElimCell_89_66_46_57_111 Int)) (let ((.cse111 (* aux_div_aux_mod_aux_mod_v_arrayElimCell_89_66_46_57 4294967296)) (.cse110 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_v_arrayElimCell_89_66_46_57_111)) (.cse108 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_89_66_46_57_111_138 4294967296))) (let ((.cse105 (+ .cse108 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_89_66_46_57_111_138)) (.cse109 (+ .cse111 .cse108 (* aux_div_aux_mod_v_arrayElimCell_89_66_46 4294967296) aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_89_66_46_57_111_138 .cse110)) (.cse106 (+ .cse111 .cse108 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_89_66_46_57_111_138 .cse110)) (.cse107 (+ .cse108 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_89_66_46_57_111_138 .cse110))) (or (< .cse105 .cse13) (< .cse106 .cse9) (<= .cse11 .cse105) (<= .cse10 .cse107) (= .cse108 .cse13) (>= aux_mod_v_arrayElimCell_90_108 4294967296) (= .cse107 (+ .cse2 .cse3 .cse4 aux_mod_v_arrayElimCell_90_108)) (> 0 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_89_66_46_57_111_138) (> 0 aux_mod_v_arrayElimCell_90_108) (<= .cse10 .cse109) (= (+ .cse2 .cse3 (mod (+ c_~asum~0 c_~bsum~0 (* 2 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_89_66_46_57_111_138) .cse30) 4294967296) .cse4) .cse109) (>= aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_89_66_46_57_111_138 4294967296) (= (+ .cse2 .cse3 .cse4 (mod (+ (* 4294967295 aux_mod_v_arrayElimCell_90_108) .cse5 .cse6 (* 3 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_arrayElimCell_89_66_46_57_111_138) .cse7) 4294967296)) .cse106) (< .cse109 .cse9) (<= .cse10 .cse106) (< .cse107 .cse9))))) .cse16) (or .cse0 (and (or .cse16 (< (* (div (+ c_~asum~0 c_~bsum~0 4294967295 .cse33) 4294967296) 4294967296) (+ c_~asum~0 c_~bsum~0 .cse33 1))) (< (+ (* (div (+ c_~asum~0 c_~bsum~0 (* 2 .cse112)) 4294967296) 4294967296) c_~csum~0) (+ c_~asum~0 c_~bsum~0 1)) (< .cse19 (+ (* (div (+ (- 1) (* .cse113 (- 2)) .cse33) 4294967296) 4294967296) 4294967297)))))))) is different from false [2022-12-13 05:27:42,382 WARN L233 SmtUtils]: Spent 57.77s on a formula simplification. DAG size of input: 223 DAG size of output: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 05:27:43,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-12-13 05:27:43,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764928614] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:27:43,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:27:43,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-12-13 05:27:43,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005872609] [2022-12-13 05:27:43,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:27:43,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 05:27:43,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:27:43,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 05:27:43,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=625, Unknown=1, NotChecked=52, Total=812 [2022-12-13 05:27:43,141 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 05:27:43,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 150 transitions, 2134 flow. Second operand has 29 states, 28 states have (on average 2.892857142857143) internal successors, (81), 28 states have internal predecessors, (81), 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-13 05:27:43,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:27:43,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 05:27:43,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:27:52,671 WARN L233 SmtUtils]: Spent 9.05s on a formula simplification. DAG size of input: 653 DAG size of output: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 05:27:53,659 INFO L130 PetriNetUnfolder]: 1407/1961 cut-off events. [2022-12-13 05:27:53,659 INFO L131 PetriNetUnfolder]: For 4872/4872 co-relation queries the response was YES. [2022-12-13 05:27:53,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14532 conditions, 1961 events. 1407/1961 cut-off events. For 4872/4872 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6973 event pairs, 94 based on Foata normal form. 1/1496 useless extension candidates. Maximal degree in co-relation 12188. Up to 1786 conditions per place. [2022-12-13 05:27:53,678 INFO L137 encePairwiseOnDemand]: 20/33 looper letters, 244 selfloop transitions, 46 changer transitions 1/291 dead transitions. [2022-12-13 05:27:53,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 291 transitions, 4626 flow [2022-12-13 05:27:53,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 05:27:53,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 05:27:53,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2022-12-13 05:27:53,682 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3305785123966942 [2022-12-13 05:27:53,682 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2022-12-13 05:27:53,682 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 291 transitions, 4626 flow [2022-12-13 05:27:53,700 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 290 transitions, 4607 flow [2022-12-13 05:27:53,715 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:27:53,715 INFO L89 Accepts]: Start accepts. Operand has 59 places, 290 transitions, 4607 flow [2022-12-13 05:27:53,721 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:27:53,721 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:27:53,721 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 290 transitions, 4607 flow [2022-12-13 05:27:53,726 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 290 transitions, 4607 flow [2022-12-13 05:27:53,726 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:27:53,728 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:27:53,728 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 05:27:53,728 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 290 transitions, 4607 flow [2022-12-13 05:27:53,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.892857142857143) internal successors, (81), 28 states have internal predecessors, (81), 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-13 05:27:53,729 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:27:53,729 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] [2022-12-13 05:27:53,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 05:27:53,936 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,SelfDestructingSolverStorable6 [2022-12-13 05:27:53,937 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 05:27:53,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:27:53,937 INFO L85 PathProgramCache]: Analyzing trace with hash -286680230, now seen corresponding path program 2 times [2022-12-13 05:27:53,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:27:53,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147173383] [2022-12-13 05:27:53,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:27:53,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:27:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:27:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 05:27:55,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:27:55,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147173383] [2022-12-13 05:27:55,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147173383] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:27:55,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363806474] [2022-12-13 05:27:55,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 05:27:55,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:27:55,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:27:55,097 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-13 05:27:55,151 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-13 05:27:55,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 05:27:55,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:27:55,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 05:27:55,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:27:55,303 INFO L321 Elim1Store]: treesize reduction 134, result has 27.6 percent of original size [2022-12-13 05:27:55,304 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 4 case distinctions, treesize of input 18 treesize of output 56 [2022-12-13 05:27:55,357 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 05:27:55,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2022-12-13 05:27:55,548 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 05:27:55,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2022-12-13 05:27:55,751 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:27:55,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 23 [2022-12-13 05:27:55,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 05:27:55,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:27:55,909 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:27:55,910 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 606 treesize of output 542 [2022-12-13 05:27:56,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:27:56,175 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 417 treesize of output 321 [2022-12-13 05:27:56,642 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:27:56,642 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 205 treesize of output 169 [2022-12-13 05:27:56,750 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:27:56,750 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 205 treesize of output 157 [2022-12-13 05:27:56,838 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:27:56,838 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 258 treesize of output 210 [2022-12-13 05:27:56,873 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:27:56,873 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 308 treesize of output 236 [2022-12-13 05:27:57,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:27:57,067 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 95 treesize of output 84 [2022-12-13 05:27:57,125 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-13 05:27:57,125 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 308 treesize of output 228 [2022-12-13 05:27:57,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:27:57,164 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 71 [2022-12-13 05:27:57,184 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-13 05:27:57,184 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 205 treesize of output 161 [2022-12-13 05:27:57,213 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-13 05:27:57,214 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 95 treesize of output 76 [2022-12-13 05:27:57,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:27:57,230 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 147 [2022-12-13 05:27:57,272 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-13 05:27:57,273 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 95 treesize of output 76 [2022-12-13 05:27:58,202 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:27:58,202 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 95 treesize of output 84 [2022-12-13 05:27:58,219 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:27:58,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 98 [2022-12-13 05:27:58,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:27:58,296 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 417 treesize of output 321 [2022-12-13 05:27:58,350 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:27:58,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 414 treesize of output 338 [2022-12-13 05:31:54,235 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 05:31:54,244 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 05:31:54,245 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 05:31:54,257 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 05:31:54,258 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 05:31:54,258 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-13 05:35:22,514 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. Received shutdown request... [2022-12-13 05:37:30,368 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-13 05:37:30,369 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 05:37:30,971 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-13 05:37:30,972 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 05:37:30,979 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-13 05:37:31,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:37:31,173 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 28 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 35 for 3ms.. [2022-12-13 05:37:31,174 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 05:37:31,174 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 05:37:31,174 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 05:37:31,175 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-12-13 05:37:31,177 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 05:37:31,177 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 05:37:31,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 05:37:31 BasicIcfg [2022-12-13 05:37:31,189 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 05:37:31,189 INFO L158 Benchmark]: Toolchain (without parser) took 866327.36ms. Allocated memory was 180.4MB in the beginning and 463.5MB in the end (delta: 283.1MB). Free memory was 148.7MB in the beginning and 270.0MB in the end (delta: -121.3MB). Peak memory consumption was 314.1MB. Max. memory is 8.0GB. [2022-12-13 05:37:31,189 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 180.4MB. Free memory was 158.3MB in the beginning and 158.2MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 05:37:31,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.46ms. Allocated memory is still 180.4MB. Free memory was 148.7MB in the beginning and 136.6MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 05:37:31,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.96ms. Allocated memory is still 180.4MB. Free memory was 136.1MB in the beginning and 134.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 05:37:31,189 INFO L158 Benchmark]: Boogie Preprocessor took 37.73ms. Allocated memory is still 180.4MB. Free memory was 134.5MB in the beginning and 132.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 05:37:31,190 INFO L158 Benchmark]: RCFGBuilder took 476.13ms. Allocated memory is still 180.4MB. Free memory was 132.4MB in the beginning and 111.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-13 05:37:31,190 INFO L158 Benchmark]: TraceAbstraction took 865484.45ms. Allocated memory was 180.4MB in the beginning and 463.5MB in the end (delta: 283.1MB). Free memory was 110.4MB in the beginning and 270.0MB in the end (delta: -159.6MB). Peak memory consumption was 276.3MB. Max. memory is 8.0GB. [2022-12-13 05:37:31,191 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.12ms. Allocated memory is still 180.4MB. Free memory was 158.3MB in the beginning and 158.2MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 265.46ms. Allocated memory is still 180.4MB. Free memory was 148.7MB in the beginning and 136.6MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.96ms. Allocated memory is still 180.4MB. Free memory was 136.1MB in the beginning and 134.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.73ms. Allocated memory is still 180.4MB. Free memory was 134.5MB in the beginning and 132.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 476.13ms. Allocated memory is still 180.4MB. Free memory was 132.4MB in the beginning and 111.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 865484.45ms. Allocated memory was 180.4MB in the beginning and 463.5MB in the end (delta: 283.1MB). Free memory was 110.4MB in the beginning and 270.0MB in the end (delta: -159.6MB). Peak memory consumption was 276.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 185 PlacesBefore, 34 PlacesAfterwards, 195 TransitionsBefore, 31 TransitionsAfterwards, 1874 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 116 TrivialYvCompositions, 35 ConcurrentYvCompositions, 13 ChoiceCompositions, 164 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1092, independent: 1072, independent conditional: 1072, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1092, independent: 1072, independent conditional: 0, independent unconditional: 1072, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1092, independent: 1072, independent conditional: 0, independent unconditional: 1072, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1092, independent: 1072, independent conditional: 0, independent unconditional: 1072, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1017, independent: 1002, independent conditional: 0, independent unconditional: 1002, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1017, independent: 1002, independent conditional: 0, independent unconditional: 1002, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1092, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 1017, unknown conditional: 0, unknown unconditional: 1017] , Statistics on independence cache: Total cache size (in pairs): 1635, Positive cache size: 1620, Positive conditional cache size: 0, Positive unconditional cache size: 1620, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 52 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 44 PlacesBefore, 43 PlacesAfterwards, 76 TransitionsBefore, 75 TransitionsAfterwards, 6 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 47 PlacesBefore, 46 PlacesAfterwards, 113 TransitionsBefore, 112 TransitionsAfterwards, 6 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 150 TransitionsBefore, 150 TransitionsAfterwards, 6 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 290 TransitionsBefore, 290 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 28 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 35 for 3ms.. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 28 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 35 for 3ms.. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 28 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 35 for 3ms.. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 28 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 35 for 3ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 226 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 865.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 422 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 422 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 65 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1422 IncrementalHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 14 mSDtfsCounter, 1422 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 73.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4607occurred in iteration=7, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 264.8s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 274 ConstructedInterpolants, 5 QuantifiedInterpolants, 6083 SizeOfPredicates, 18 NumberOfNonLiveVariables, 583 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 26/37 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