./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread/queue_ok_longer.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok_longer.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:06:49,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:06:49,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:06:49,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:06:49,960 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:06:49,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:06:49,965 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:06:49,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:06:49,970 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:06:49,974 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:06:49,975 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:06:49,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:06:49,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:06:49,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:06:49,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:06:49,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:06:49,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:06:49,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:06:49,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:06:50,003 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:06:50,004 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:06:50,005 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:06:50,006 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:06:50,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:06:50,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:06:50,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:06:50,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:06:50,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:06:50,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:06:50,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:06:50,017 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:06:50,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:06:50,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:06:50,026 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:06:50,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:06:50,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:06:50,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:06:50,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:06:50,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:06:50,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:06:50,029 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:06:50,031 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 02:06:50,066 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:06:50,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:06:50,068 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:06:50,068 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:06:50,069 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:06:50,069 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:06:50,069 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:06:50,070 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:06:50,070 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:06:50,070 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:06:50,071 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:06:50,071 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:06:50,071 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:06:50,072 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:06:50,072 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:06:50,072 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:06:50,072 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:06:50,072 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:06:50,072 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:06:50,073 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:06:50,073 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:06:50,073 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:06:50,073 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:06:50,073 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:06:50,074 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:06:50,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:06:50,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:06:50,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:06:50,075 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:06:50,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:06:50,075 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:06:50,075 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:06:50,075 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:06:50,076 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:06:50,076 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 02:06:50,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:06:50,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:06:50,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:06:50,426 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:06:50,426 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:06:50,428 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longer.i [2023-08-30 02:06:51,558 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:06:51,852 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:06:51,855 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i [2023-08-30 02:06:51,871 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ba472bd7/9cad1c406e354bd5b95858ebd3a62bf1/FLAG8c2a418f9 [2023-08-30 02:06:51,883 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ba472bd7/9cad1c406e354bd5b95858ebd3a62bf1 [2023-08-30 02:06:51,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:06:51,887 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:06:51,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:06:51,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:06:51,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:06:51,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:06:51" (1/1) ... [2023-08-30 02:06:51,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f47023b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:51, skipping insertion in model container [2023-08-30 02:06:51,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:06:51" (1/1) ... [2023-08-30 02:06:51,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:06:51,946 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:06:52,333 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43272,43285] [2023-08-30 02:06:52,341 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43545,43558] [2023-08-30 02:06:52,350 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:06:52,363 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:06:52,422 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43272,43285] [2023-08-30 02:06:52,425 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43545,43558] [2023-08-30 02:06:52,427 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:06:52,487 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:06:52,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:52 WrapperNode [2023-08-30 02:06:52,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:06:52,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:06:52,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:06:52,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:06:52,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:52" (1/1) ... [2023-08-30 02:06:52,528 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:52" (1/1) ... [2023-08-30 02:06:52,553 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2023-08-30 02:06:52,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:06:52,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:06:52,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:06:52,554 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:06:52,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:52" (1/1) ... [2023-08-30 02:06:52,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:52" (1/1) ... [2023-08-30 02:06:52,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:52" (1/1) ... [2023-08-30 02:06:52,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:52" (1/1) ... [2023-08-30 02:06:52,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:52" (1/1) ... [2023-08-30 02:06:52,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:52" (1/1) ... [2023-08-30 02:06:52,601 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:52" (1/1) ... [2023-08-30 02:06:52,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:52" (1/1) ... [2023-08-30 02:06:52,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:06:52,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:06:52,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:06:52,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:06:52,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:52" (1/1) ... [2023-08-30 02:06:52,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:06:52,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:06:52,638 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 02:06:52,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 02:06:52,682 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-30 02:06:52,682 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-30 02:06:52,682 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-30 02:06:52,682 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-30 02:06:52,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:06:52,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:06:52,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 02:06:52,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:06:52,683 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-30 02:06:52,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:06:52,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:06:52,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:06:52,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:06:52,685 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:06:52,875 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:06:52,877 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:06:53,404 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:06:53,417 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:06:53,418 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-30 02:06:53,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:06:53 BoogieIcfgContainer [2023-08-30 02:06:53,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:06:53,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:06:53,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:06:53,426 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:06:53,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:06:51" (1/3) ... [2023-08-30 02:06:53,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2494dd3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:06:53, skipping insertion in model container [2023-08-30 02:06:53,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:52" (2/3) ... [2023-08-30 02:06:53,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2494dd3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:06:53, skipping insertion in model container [2023-08-30 02:06:53,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:06:53" (3/3) ... [2023-08-30 02:06:53,429 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2023-08-30 02:06:53,444 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:06:53,445 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2023-08-30 02:06:53,445 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:06:53,566 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-30 02:06:53,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 278 transitions, 572 flow [2023-08-30 02:06:53,684 INFO L130 PetriNetUnfolder]: 13/276 cut-off events. [2023-08-30 02:06:53,684 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 02:06:53,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 276 events. 13/276 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 677 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 185. Up to 3 conditions per place. [2023-08-30 02:06:53,702 INFO L82 GeneralOperation]: Start removeDead. Operand has 272 places, 278 transitions, 572 flow [2023-08-30 02:06:53,708 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 266 places, 272 transitions, 556 flow [2023-08-30 02:06:53,711 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:06:53,719 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 266 places, 272 transitions, 556 flow [2023-08-30 02:06:53,722 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 266 places, 272 transitions, 556 flow [2023-08-30 02:06:53,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 272 transitions, 556 flow [2023-08-30 02:06:53,769 INFO L130 PetriNetUnfolder]: 13/272 cut-off events. [2023-08-30 02:06:53,770 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 02:06:53,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 272 events. 13/272 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 660 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 185. Up to 3 conditions per place. [2023-08-30 02:06:53,780 INFO L119 LiptonReduction]: Number of co-enabled transitions 17820 [2023-08-30 02:07:06,973 INFO L134 LiptonReduction]: Checked pairs total: 64286 [2023-08-30 02:07:06,973 INFO L136 LiptonReduction]: Total number of compositions: 358 [2023-08-30 02:07:06,987 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:07:06,992 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@108cab79, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:07:06,993 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2023-08-30 02:07:06,994 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:07:06,994 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:07:06,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:07:06,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:07:06,996 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:07:07,000 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:07:07,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1161, now seen corresponding path program 1 times [2023-08-30 02:07:07,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:07:07,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196020748] [2023-08-30 02:07:07,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:07:07,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:07:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:07:07,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:07:07,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:07:07,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196020748] [2023-08-30 02:07:07,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196020748] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:07:07,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:07:07,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:07:07,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381777644] [2023-08-30 02:07:07,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:07:07,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:07:07,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:07:07,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:07:07,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:07:07,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 636 [2023-08-30 02:07:07,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 106 transitions, 224 flow. Second operand has 2 states, 2 states have (on average 267.5) internal successors, (535), 2 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:07,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:07:07,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 636 [2023-08-30 02:07:07,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:07:07,889 INFO L130 PetriNetUnfolder]: 3797/6059 cut-off events. [2023-08-30 02:07:07,889 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2023-08-30 02:07:07,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11913 conditions, 6059 events. 3797/6059 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 34868 event pairs, 3185 based on Foata normal form. 0/3159 useless extension candidates. Maximal degree in co-relation 11458. Up to 5786 conditions per place. [2023-08-30 02:07:07,953 INFO L137 encePairwiseOnDemand]: 600/636 looper letters, 61 selfloop transitions, 0 changer transitions 0/70 dead transitions. [2023-08-30 02:07:07,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 70 transitions, 274 flow [2023-08-30 02:07:07,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:07:07,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:07:07,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 631 transitions. [2023-08-30 02:07:07,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4960691823899371 [2023-08-30 02:07:07,974 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 631 transitions. [2023-08-30 02:07:07,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 631 transitions. [2023-08-30 02:07:07,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:07:07,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 631 transitions. [2023-08-30 02:07:07,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 315.5) internal successors, (631), 2 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:07,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 636.0) internal successors, (1908), 3 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:07,995 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 636.0) internal successors, (1908), 3 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:07,997 INFO L175 Difference]: Start difference. First operand has 106 places, 106 transitions, 224 flow. Second operand 2 states and 631 transitions. [2023-08-30 02:07:07,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 70 transitions, 274 flow [2023-08-30 02:07:08,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 70 transitions, 266 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:07:08,007 INFO L231 Difference]: Finished difference. Result has 67 places, 70 transitions, 144 flow [2023-08-30 02:07:08,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=70} [2023-08-30 02:07:08,012 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -39 predicate places. [2023-08-30 02:07:08,012 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 144 flow [2023-08-30 02:07:08,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 267.5) internal successors, (535), 2 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:08,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:07:08,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:07:08,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:07:08,014 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:07:08,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:07:08,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1154497, now seen corresponding path program 1 times [2023-08-30 02:07:08,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:07:08,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12697546] [2023-08-30 02:07:08,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:07:08,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:07:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:07:08,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:07:08,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:07:08,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12697546] [2023-08-30 02:07:08,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12697546] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:07:08,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:07:08,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:07:08,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790441417] [2023-08-30 02:07:08,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:07:08,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:07:08,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:07:08,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:07:08,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:07:08,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 636 [2023-08-30 02:07:08,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:08,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:07:08,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 636 [2023-08-30 02:07:08,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:07:08,983 INFO L130 PetriNetUnfolder]: 3749/5963 cut-off events. [2023-08-30 02:07:08,984 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-30 02:07:08,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11680 conditions, 5963 events. 3749/5963 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 34055 event pairs, 3144 based on Foata normal form. 0/3128 useless extension candidates. Maximal degree in co-relation 11677. Up to 5693 conditions per place. [2023-08-30 02:07:09,021 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 57 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-08-30 02:07:09,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 258 flow [2023-08-30 02:07:09,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:07:09,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:07:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 835 transitions. [2023-08-30 02:07:09,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43763102725366876 [2023-08-30 02:07:09,026 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 835 transitions. [2023-08-30 02:07:09,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 835 transitions. [2023-08-30 02:07:09,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:07:09,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 835 transitions. [2023-08-30 02:07:09,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:09,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:09,034 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:09,034 INFO L175 Difference]: Start difference. First operand has 67 places, 70 transitions, 144 flow. Second operand 3 states and 835 transitions. [2023-08-30 02:07:09,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 258 flow [2023-08-30 02:07:09,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 68 transitions, 258 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:07:09,038 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 144 flow [2023-08-30 02:07:09,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2023-08-30 02:07:09,039 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -39 predicate places. [2023-08-30 02:07:09,040 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 144 flow [2023-08-30 02:07:09,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:09,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:07:09,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:07:09,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:07:09,041 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:07:09,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:07:09,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1154498, now seen corresponding path program 1 times [2023-08-30 02:07:09,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:07:09,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542906728] [2023-08-30 02:07:09,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:07:09,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:07:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:07:09,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:07:09,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:07:09,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542906728] [2023-08-30 02:07:09,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542906728] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:07:09,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:07:09,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:07:09,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918745904] [2023-08-30 02:07:09,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:07:09,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:07:09,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:07:09,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:07:09,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:07:09,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-30 02:07:09,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:09,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:07:09,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-30 02:07:09,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:07:09,820 INFO L130 PetriNetUnfolder]: 3701/5867 cut-off events. [2023-08-30 02:07:09,821 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-30 02:07:09,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11496 conditions, 5867 events. 3701/5867 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 33381 event pairs, 3103 based on Foata normal form. 0/3097 useless extension candidates. Maximal degree in co-relation 11492. Up to 5602 conditions per place. [2023-08-30 02:07:09,852 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 55 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-30 02:07:09,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 66 transitions, 254 flow [2023-08-30 02:07:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:07:09,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:07:09,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 845 transitions. [2023-08-30 02:07:09,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44287211740041926 [2023-08-30 02:07:09,855 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 845 transitions. [2023-08-30 02:07:09,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 845 transitions. [2023-08-30 02:07:09,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:07:09,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 845 transitions. [2023-08-30 02:07:09,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:09,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:09,863 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:09,863 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 144 flow. Second operand 3 states and 845 transitions. [2023-08-30 02:07:09,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 66 transitions, 254 flow [2023-08-30 02:07:09,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 66 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:07:09,865 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 140 flow [2023-08-30 02:07:09,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2023-08-30 02:07:09,866 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -41 predicate places. [2023-08-30 02:07:09,866 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 140 flow [2023-08-30 02:07:09,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:09,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:07:09,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:07:09,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:07:09,868 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:07:09,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:07:09,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1109496233, now seen corresponding path program 1 times [2023-08-30 02:07:09,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:07:09,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180536291] [2023-08-30 02:07:09,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:07:09,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:07:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:07:10,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:07:10,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:07:10,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180536291] [2023-08-30 02:07:10,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180536291] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:07:10,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:07:10,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:07:10,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847230848] [2023-08-30 02:07:10,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:07:10,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:07:10,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:07:10,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:07:10,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:07:10,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 636 [2023-08-30 02:07:10,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 255.66666666666666) internal successors, (767), 3 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:10,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:07:10,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 636 [2023-08-30 02:07:10,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:07:10,963 INFO L130 PetriNetUnfolder]: 3800/6080 cut-off events. [2023-08-30 02:07:10,963 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-30 02:07:10,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11915 conditions, 6080 events. 3800/6080 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 35011 event pairs, 2674 based on Foata normal form. 0/3121 useless extension candidates. Maximal degree in co-relation 11911. Up to 5801 conditions per place. [2023-08-30 02:07:11,003 INFO L137 encePairwiseOnDemand]: 630/636 looper letters, 63 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2023-08-30 02:07:11,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 75 transitions, 292 flow [2023-08-30 02:07:11,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:07:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:07:11,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 831 transitions. [2023-08-30 02:07:11,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43553459119496857 [2023-08-30 02:07:11,007 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 831 transitions. [2023-08-30 02:07:11,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 831 transitions. [2023-08-30 02:07:11,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:07:11,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 831 transitions. [2023-08-30 02:07:11,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:11,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:11,015 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:11,016 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 140 flow. Second operand 3 states and 831 transitions. [2023-08-30 02:07:11,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 75 transitions, 292 flow [2023-08-30 02:07:11,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 75 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:07:11,019 INFO L231 Difference]: Finished difference. Result has 66 places, 69 transitions, 164 flow [2023-08-30 02:07:11,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=66, PETRI_TRANSITIONS=69} [2023-08-30 02:07:11,020 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -40 predicate places. [2023-08-30 02:07:11,021 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 69 transitions, 164 flow [2023-08-30 02:07:11,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.66666666666666) internal successors, (767), 3 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:11,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:07:11,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:07:11,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:07:11,022 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:07:11,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:07:11,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1109496236, now seen corresponding path program 1 times [2023-08-30 02:07:11,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:07:11,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695032882] [2023-08-30 02:07:11,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:07:11,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:07:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:07:11,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:07:11,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:07:11,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695032882] [2023-08-30 02:07:11,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695032882] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:07:11,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:07:11,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:07:11,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633857179] [2023-08-30 02:07:11,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:07:11,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:07:11,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:07:11,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:07:11,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:07:11,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 636 [2023-08-30 02:07:11,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 69 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:11,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:07:11,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 636 [2023-08-30 02:07:11,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:07:11,631 INFO L130 PetriNetUnfolder]: 3253/5163 cut-off events. [2023-08-30 02:07:11,631 INFO L131 PetriNetUnfolder]: For 213/296 co-relation queries the response was YES. [2023-08-30 02:07:11,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10409 conditions, 5163 events. 3253/5163 cut-off events. For 213/296 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 28741 event pairs, 2677 based on Foata normal form. 0/2957 useless extension candidates. Maximal degree in co-relation 10404. Up to 4914 conditions per place. [2023-08-30 02:07:11,669 INFO L137 encePairwiseOnDemand]: 631/636 looper letters, 54 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-30 02:07:11,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 66 transitions, 270 flow [2023-08-30 02:07:11,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:07:11,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:07:11,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 849 transitions. [2023-08-30 02:07:11,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4449685534591195 [2023-08-30 02:07:11,673 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 849 transitions. [2023-08-30 02:07:11,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 849 transitions. [2023-08-30 02:07:11,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:07:11,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 849 transitions. [2023-08-30 02:07:11,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:11,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:11,680 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:11,680 INFO L175 Difference]: Start difference. First operand has 66 places, 69 transitions, 164 flow. Second operand 3 states and 849 transitions. [2023-08-30 02:07:11,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 66 transitions, 270 flow [2023-08-30 02:07:11,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:07:11,683 INFO L231 Difference]: Finished difference. Result has 64 places, 66 transitions, 158 flow [2023-08-30 02:07:11,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=64, PETRI_TRANSITIONS=66} [2023-08-30 02:07:11,687 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -42 predicate places. [2023-08-30 02:07:11,687 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 158 flow [2023-08-30 02:07:11,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:11,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:07:11,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:07:11,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:07:11,688 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:07:11,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:07:11,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1109495978, now seen corresponding path program 1 times [2023-08-30 02:07:11,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:07:11,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736236822] [2023-08-30 02:07:11,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:07:11,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:07:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:07:11,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:07:11,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:07:11,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736236822] [2023-08-30 02:07:11,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736236822] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:07:11,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:07:11,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:07:11,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057135909] [2023-08-30 02:07:11,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:07:11,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:07:11,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:07:11,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:07:11,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:07:11,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-30 02:07:11,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 66 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:11,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:07:11,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-30 02:07:11,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:07:12,213 INFO L130 PetriNetUnfolder]: 2363/3821 cut-off events. [2023-08-30 02:07:12,213 INFO L131 PetriNetUnfolder]: For 169/231 co-relation queries the response was YES. [2023-08-30 02:07:12,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7709 conditions, 3821 events. 2363/3821 cut-off events. For 169/231 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 20578 event pairs, 1925 based on Foata normal form. 0/2357 useless extension candidates. Maximal degree in co-relation 7704. Up to 3628 conditions per place. [2023-08-30 02:07:12,232 INFO L137 encePairwiseOnDemand]: 633/636 looper letters, 53 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-08-30 02:07:12,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 266 flow [2023-08-30 02:07:12,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:07:12,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:07:12,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 840 transitions. [2023-08-30 02:07:12,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44025157232704404 [2023-08-30 02:07:12,235 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 840 transitions. [2023-08-30 02:07:12,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 840 transitions. [2023-08-30 02:07:12,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:07:12,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 840 transitions. [2023-08-30 02:07:12,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:12,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:12,242 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:12,243 INFO L175 Difference]: Start difference. First operand has 64 places, 66 transitions, 158 flow. Second operand 3 states and 840 transitions. [2023-08-30 02:07:12,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 266 flow [2023-08-30 02:07:12,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 65 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:07:12,247 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 156 flow [2023-08-30 02:07:12,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2023-08-30 02:07:12,249 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-08-30 02:07:12,249 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 156 flow [2023-08-30 02:07:12,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:12,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:07:12,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:07:12,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:07:12,251 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:07:12,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:07:12,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1109495977, now seen corresponding path program 1 times [2023-08-30 02:07:12,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:07:12,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460104417] [2023-08-30 02:07:12,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:07:12,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:07:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:07:12,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:07:12,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:07:12,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460104417] [2023-08-30 02:07:12,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460104417] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:07:12,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:07:12,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:07:12,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726651581] [2023-08-30 02:07:12,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:07:12,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:07:12,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:07:12,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:07:12,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:07:12,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 636 [2023-08-30 02:07:12,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 255.25) internal successors, (1021), 4 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:12,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:07:12,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 636 [2023-08-30 02:07:12,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:07:12,739 INFO L130 PetriNetUnfolder]: 1473/2479 cut-off events. [2023-08-30 02:07:12,739 INFO L131 PetriNetUnfolder]: For 125/166 co-relation queries the response was YES. [2023-08-30 02:07:12,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5015 conditions, 2479 events. 1473/2479 cut-off events. For 125/166 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 12930 event pairs, 1173 based on Foata normal form. 0/1757 useless extension candidates. Maximal degree in co-relation 5010. Up to 2342 conditions per place. [2023-08-30 02:07:12,748 INFO L137 encePairwiseOnDemand]: 633/636 looper letters, 52 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-08-30 02:07:12,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 64 transitions, 262 flow [2023-08-30 02:07:12,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:07:12,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:07:12,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 815 transitions. [2023-08-30 02:07:12,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4271488469601677 [2023-08-30 02:07:12,751 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 815 transitions. [2023-08-30 02:07:12,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 815 transitions. [2023-08-30 02:07:12,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:07:12,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 815 transitions. [2023-08-30 02:07:12,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:12,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:12,757 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:12,757 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 156 flow. Second operand 3 states and 815 transitions. [2023-08-30 02:07:12,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 64 transitions, 262 flow [2023-08-30 02:07:12,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 64 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:07:12,759 INFO L231 Difference]: Finished difference. Result has 62 places, 64 transitions, 154 flow [2023-08-30 02:07:12,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=62, PETRI_TRANSITIONS=64} [2023-08-30 02:07:12,760 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -44 predicate places. [2023-08-30 02:07:12,760 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 64 transitions, 154 flow [2023-08-30 02:07:12,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 255.25) internal successors, (1021), 4 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:12,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:07:12,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 02:07:12,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:07:12,761 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:07:12,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:07:12,762 INFO L85 PathProgramCache]: Analyzing trace with hash 34798183, now seen corresponding path program 1 times [2023-08-30 02:07:12,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:07:12,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556134804] [2023-08-30 02:07:12,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:07:12,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:07:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:07:13,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:07:13,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:07:13,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556134804] [2023-08-30 02:07:13,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556134804] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:07:13,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:07:13,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:07:13,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689699950] [2023-08-30 02:07:13,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:07:13,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:07:13,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:07:13,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:07:13,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:07:14,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 636 [2023-08-30 02:07:14,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 64 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 253.5) internal successors, (1014), 4 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:14,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:07:14,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 636 [2023-08-30 02:07:14,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:07:15,585 INFO L130 PetriNetUnfolder]: 1853/3134 cut-off events. [2023-08-30 02:07:15,585 INFO L131 PetriNetUnfolder]: For 123/123 co-relation queries the response was YES. [2023-08-30 02:07:15,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6363 conditions, 3134 events. 1853/3134 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 17498 event pairs, 443 based on Foata normal form. 25/2258 useless extension candidates. Maximal degree in co-relation 6358. Up to 2495 conditions per place. [2023-08-30 02:07:15,599 INFO L137 encePairwiseOnDemand]: 625/636 looper letters, 75 selfloop transitions, 8 changer transitions 0/91 dead transitions. [2023-08-30 02:07:15,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 91 transitions, 383 flow [2023-08-30 02:07:15,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:07:15,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:07:15,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1094 transitions. [2023-08-30 02:07:15,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4300314465408805 [2023-08-30 02:07:15,603 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1094 transitions. [2023-08-30 02:07:15,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1094 transitions. [2023-08-30 02:07:15,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:07:15,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1094 transitions. [2023-08-30 02:07:15,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 273.5) internal successors, (1094), 4 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:15,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 636.0) internal successors, (3180), 5 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:15,612 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 636.0) internal successors, (3180), 5 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:15,612 INFO L175 Difference]: Start difference. First operand has 62 places, 64 transitions, 154 flow. Second operand 4 states and 1094 transitions. [2023-08-30 02:07:15,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 91 transitions, 383 flow [2023-08-30 02:07:15,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 91 transitions, 377 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:07:15,616 INFO L231 Difference]: Finished difference. Result has 64 places, 69 transitions, 208 flow [2023-08-30 02:07:15,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=64, PETRI_TRANSITIONS=69} [2023-08-30 02:07:15,619 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -42 predicate places. [2023-08-30 02:07:15,620 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 69 transitions, 208 flow [2023-08-30 02:07:15,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 253.5) internal successors, (1014), 4 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:15,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:07:15,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 02:07:15,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:07:15,621 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:07:15,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:07:15,621 INFO L85 PathProgramCache]: Analyzing trace with hash 34645865, now seen corresponding path program 1 times [2023-08-30 02:07:15,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:07:15,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430017675] [2023-08-30 02:07:15,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:07:15,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:07:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:07:15,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:07:15,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:07:15,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430017675] [2023-08-30 02:07:15,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430017675] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:07:15,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:07:15,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:07:15,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241976696] [2023-08-30 02:07:15,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:07:15,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:07:15,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:07:15,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:07:15,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:07:15,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 636 [2023-08-30 02:07:15,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 69 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 256.5) internal successors, (1026), 4 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:15,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:07:15,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 636 [2023-08-30 02:07:15,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:07:16,347 INFO L130 PetriNetUnfolder]: 1643/2806 cut-off events. [2023-08-30 02:07:16,347 INFO L131 PetriNetUnfolder]: For 423/423 co-relation queries the response was YES. [2023-08-30 02:07:16,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5864 conditions, 2806 events. 1643/2806 cut-off events. For 423/423 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 15124 event pairs, 600 based on Foata normal form. 150/2328 useless extension candidates. Maximal degree in co-relation 5858. Up to 1639 conditions per place. [2023-08-30 02:07:16,364 INFO L137 encePairwiseOnDemand]: 627/636 looper letters, 81 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2023-08-30 02:07:16,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 95 transitions, 425 flow [2023-08-30 02:07:16,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:07:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:07:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1108 transitions. [2023-08-30 02:07:16,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43553459119496857 [2023-08-30 02:07:16,370 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1108 transitions. [2023-08-30 02:07:16,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1108 transitions. [2023-08-30 02:07:16,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:07:16,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1108 transitions. [2023-08-30 02:07:16,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:16,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 636.0) internal successors, (3180), 5 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:16,379 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 636.0) internal successors, (3180), 5 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:16,379 INFO L175 Difference]: Start difference. First operand has 64 places, 69 transitions, 208 flow. Second operand 4 states and 1108 transitions. [2023-08-30 02:07:16,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 95 transitions, 425 flow [2023-08-30 02:07:16,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 95 transitions, 418 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:07:16,382 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 184 flow [2023-08-30 02:07:16,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2023-08-30 02:07:16,384 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -45 predicate places. [2023-08-30 02:07:16,384 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 184 flow [2023-08-30 02:07:16,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 256.5) internal successors, (1026), 4 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:16,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:07:16,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:07:16,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:07:16,387 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:07:16,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:07:16,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1100843232, now seen corresponding path program 1 times [2023-08-30 02:07:16,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:07:16,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549341020] [2023-08-30 02:07:16,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:07:16,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:07:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:07:16,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:07:16,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:07:16,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549341020] [2023-08-30 02:07:16,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549341020] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:07:16,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:07:16,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:07:16,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764439165] [2023-08-30 02:07:16,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:07:16,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:07:16,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:07:16,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:07:16,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:07:16,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-30 02:07:16,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:16,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:07:16,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-30 02:07:16,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:07:16,615 INFO L130 PetriNetUnfolder]: 533/1074 cut-off events. [2023-08-30 02:07:16,616 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2023-08-30 02:07:16,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2238 conditions, 1074 events. 533/1074 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5574 event pairs, 318 based on Foata normal form. 38/941 useless extension candidates. Maximal degree in co-relation 2231. Up to 597 conditions per place. [2023-08-30 02:07:16,621 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 61 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2023-08-30 02:07:16,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 339 flow [2023-08-30 02:07:16,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:07:16,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:07:16,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 844 transitions. [2023-08-30 02:07:16,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44234800838574423 [2023-08-30 02:07:16,625 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 844 transitions. [2023-08-30 02:07:16,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 844 transitions. [2023-08-30 02:07:16,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:07:16,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 844 transitions. [2023-08-30 02:07:16,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:16,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:16,631 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:16,631 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 184 flow. Second operand 3 states and 844 transitions. [2023-08-30 02:07:16,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 339 flow [2023-08-30 02:07:16,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 74 transitions, 338 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:07:16,635 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 185 flow [2023-08-30 02:07:16,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=185, PETRI_PLACES=63, PETRI_TRANSITIONS=62} [2023-08-30 02:07:16,637 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-08-30 02:07:16,637 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 185 flow [2023-08-30 02:07:16,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:16,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:07:16,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:07:16,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:07:16,638 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:07:16,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:07:16,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1760781159, now seen corresponding path program 1 times [2023-08-30 02:07:16,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:07:16,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826221497] [2023-08-30 02:07:16,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:07:16,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:07:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:07:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:07:16,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:07:16,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826221497] [2023-08-30 02:07:16,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826221497] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:07:16,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:07:16,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:07:16,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569265807] [2023-08-30 02:07:16,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:07:16,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:07:16,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:07:16,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:07:16,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:07:16,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 636 [2023-08-30 02:07:16,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:16,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:07:16,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 636 [2023-08-30 02:07:16,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:07:17,033 INFO L130 PetriNetUnfolder]: 506/1041 cut-off events. [2023-08-30 02:07:17,034 INFO L131 PetriNetUnfolder]: For 131/133 co-relation queries the response was YES. [2023-08-30 02:07:17,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2201 conditions, 1041 events. 506/1041 cut-off events. For 131/133 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5453 event pairs, 423 based on Foata normal form. 0/911 useless extension candidates. Maximal degree in co-relation 2193. Up to 938 conditions per place. [2023-08-30 02:07:17,039 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 47 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2023-08-30 02:07:17,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 281 flow [2023-08-30 02:07:17,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:07:17,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:07:17,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 827 transitions. [2023-08-30 02:07:17,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4334381551362683 [2023-08-30 02:07:17,043 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 827 transitions. [2023-08-30 02:07:17,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 827 transitions. [2023-08-30 02:07:17,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:07:17,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 827 transitions. [2023-08-30 02:07:17,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:17,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:17,048 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:17,049 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 185 flow. Second operand 3 states and 827 transitions. [2023-08-30 02:07:17,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 281 flow [2023-08-30 02:07:17,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 275 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:07:17,052 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 181 flow [2023-08-30 02:07:17,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2023-08-30 02:07:17,052 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -45 predicate places. [2023-08-30 02:07:17,053 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 181 flow [2023-08-30 02:07:17,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:17,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:07:17,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:07:17,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 02:07:17,061 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:07:17,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:07:17,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1760781158, now seen corresponding path program 1 times [2023-08-30 02:07:17,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:07:17,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35847492] [2023-08-30 02:07:17,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:07:17,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:07:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:07:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:07:17,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:07:17,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35847492] [2023-08-30 02:07:17,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35847492] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:07:17,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:07:17,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:07:17,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155353497] [2023-08-30 02:07:17,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:07:17,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:07:17,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:07:17,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:07:17,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:07:17,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 636 [2023-08-30 02:07:17,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 263.5) internal successors, (1054), 4 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:17,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:07:17,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 636 [2023-08-30 02:07:17,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:07:17,576 INFO L130 PetriNetUnfolder]: 354/719 cut-off events. [2023-08-30 02:07:17,576 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2023-08-30 02:07:17,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1552 conditions, 719 events. 354/719 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3320 event pairs, 226 based on Foata normal form. 8/652 useless extension candidates. Maximal degree in co-relation 1544. Up to 514 conditions per place. [2023-08-30 02:07:17,579 INFO L137 encePairwiseOnDemand]: 631/636 looper letters, 59 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2023-08-30 02:07:17,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 72 transitions, 330 flow [2023-08-30 02:07:17,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:07:17,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:07:17,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1105 transitions. [2023-08-30 02:07:17,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4343553459119497 [2023-08-30 02:07:17,583 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1105 transitions. [2023-08-30 02:07:17,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1105 transitions. [2023-08-30 02:07:17,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:07:17,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1105 transitions. [2023-08-30 02:07:17,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 276.25) internal successors, (1105), 4 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:17,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 636.0) internal successors, (3180), 5 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:17,590 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 636.0) internal successors, (3180), 5 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:17,590 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 181 flow. Second operand 4 states and 1105 transitions. [2023-08-30 02:07:17,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 72 transitions, 330 flow [2023-08-30 02:07:17,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 320 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 02:07:17,592 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 179 flow [2023-08-30 02:07:17,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2023-08-30 02:07:17,593 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-08-30 02:07:17,593 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 179 flow [2023-08-30 02:07:17,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 263.5) internal successors, (1054), 4 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:17,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:07:17,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:07:17,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 02:07:17,594 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:07:17,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:07:17,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1250363540, now seen corresponding path program 1 times [2023-08-30 02:07:17,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:07:17,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277589803] [2023-08-30 02:07:17,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:07:17,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:07:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:07:18,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:07:18,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:07:18,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277589803] [2023-08-30 02:07:18,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277589803] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:07:18,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:07:18,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:07:18,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181908698] [2023-08-30 02:07:18,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:07:18,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:07:18,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:07:18,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:07:18,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:07:18,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 636 [2023-08-30 02:07:18,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 253.4) internal successors, (1267), 5 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:18,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:07:18,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 636 [2023-08-30 02:07:18,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:07:18,417 INFO L130 PetriNetUnfolder]: 368/732 cut-off events. [2023-08-30 02:07:18,418 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2023-08-30 02:07:18,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1629 conditions, 732 events. 368/732 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3372 event pairs, 286 based on Foata normal form. 0/664 useless extension candidates. Maximal degree in co-relation 1620. Up to 678 conditions per place. [2023-08-30 02:07:18,421 INFO L137 encePairwiseOnDemand]: 629/636 looper letters, 55 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2023-08-30 02:07:18,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 71 transitions, 343 flow [2023-08-30 02:07:18,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:07:18,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:07:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1567 transitions. [2023-08-30 02:07:18,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4106394129979036 [2023-08-30 02:07:18,426 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1567 transitions. [2023-08-30 02:07:18,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1567 transitions. [2023-08-30 02:07:18,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:07:18,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1567 transitions. [2023-08-30 02:07:18,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 261.1666666666667) internal successors, (1567), 6 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:18,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 636.0) internal successors, (4452), 7 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:18,437 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 636.0) internal successors, (4452), 7 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:18,437 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 179 flow. Second operand 6 states and 1567 transitions. [2023-08-30 02:07:18,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 71 transitions, 343 flow [2023-08-30 02:07:18,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 71 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:07:18,440 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 233 flow [2023-08-30 02:07:18,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2023-08-30 02:07:18,442 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -37 predicate places. [2023-08-30 02:07:18,442 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 233 flow [2023-08-30 02:07:18,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 253.4) internal successors, (1267), 5 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:18,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:07:18,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:07:18,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 02:07:18,443 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:07:18,443 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:07:18,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1718251328, now seen corresponding path program 1 times [2023-08-30 02:07:18,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:07:18,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966025961] [2023-08-30 02:07:18,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:07:18,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:07:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:07:19,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:07:19,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:07:19,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966025961] [2023-08-30 02:07:19,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966025961] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:07:19,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:07:19,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:07:19,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904695305] [2023-08-30 02:07:19,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:07:19,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:07:19,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:07:19,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:07:19,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:07:19,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 636 [2023-08-30 02:07:19,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 233 flow. Second operand has 6 states, 6 states have (on average 252.16666666666666) internal successors, (1513), 6 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:19,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:07:19,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 636 [2023-08-30 02:07:19,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:07:19,482 INFO L130 PetriNetUnfolder]: 458/907 cut-off events. [2023-08-30 02:07:19,482 INFO L131 PetriNetUnfolder]: For 189/189 co-relation queries the response was YES. [2023-08-30 02:07:19,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2133 conditions, 907 events. 458/907 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4423 event pairs, 111 based on Foata normal form. 7/847 useless extension candidates. Maximal degree in co-relation 2121. Up to 593 conditions per place. [2023-08-30 02:07:19,488 INFO L137 encePairwiseOnDemand]: 625/636 looper letters, 69 selfloop transitions, 19 changer transitions 0/95 dead transitions. [2023-08-30 02:07:19,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 95 transitions, 493 flow [2023-08-30 02:07:19,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:07:19,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:07:19,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1832 transitions. [2023-08-30 02:07:19,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4115004492362983 [2023-08-30 02:07:19,493 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1832 transitions. [2023-08-30 02:07:19,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1832 transitions. [2023-08-30 02:07:19,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:07:19,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1832 transitions. [2023-08-30 02:07:19,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 261.7142857142857) internal successors, (1832), 7 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:19,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 636.0) internal successors, (5088), 8 states have internal predecessors, (5088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:19,505 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 636.0) internal successors, (5088), 8 states have internal predecessors, (5088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:19,505 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 233 flow. Second operand 7 states and 1832 transitions. [2023-08-30 02:07:19,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 95 transitions, 493 flow [2023-08-30 02:07:19,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 95 transitions, 485 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 02:07:19,509 INFO L231 Difference]: Finished difference. Result has 77 places, 72 transitions, 333 flow [2023-08-30 02:07:19,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=333, PETRI_PLACES=77, PETRI_TRANSITIONS=72} [2023-08-30 02:07:19,510 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -29 predicate places. [2023-08-30 02:07:19,510 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 72 transitions, 333 flow [2023-08-30 02:07:19,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 252.16666666666666) internal successors, (1513), 6 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:19,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:07:19,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:07:19,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 02:07:19,511 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:07:19,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:07:19,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1250219982, now seen corresponding path program 2 times [2023-08-30 02:07:19,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:07:19,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533390122] [2023-08-30 02:07:19,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:07:19,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:07:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:07:19,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:07:19,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:07:19,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533390122] [2023-08-30 02:07:19,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533390122] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:07:19,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339043280] [2023-08-30 02:07:19,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:07:19,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:07:19,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:07:19,933 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:07:19,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-30 02:07:20,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 02:07:20,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:07:20,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-30 02:07:20,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:07:20,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-30 02:07:20,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:07:20,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 02:07:20,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:07:20,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:07:20,386 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 38 treesize of output 34 [2023-08-30 02:07:20,432 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_460 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_460) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_460 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_460) |c_~#queue~0.base|) .cse0) 402)))) is different from false [2023-08-30 02:07:20,456 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 02:07:20,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-08-30 02:07:20,484 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 02:07:20,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-08-30 02:07:20,489 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 11 treesize of output 7 [2023-08-30 02:07:20,512 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-08-30 02:07:20,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-08-30 02:07:20,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:07:20,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339043280] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:07:20,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:07:20,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2023-08-30 02:07:20,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049947053] [2023-08-30 02:07:20,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:07:20,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 02:07:20,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:07:20,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 02:07:20,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=115, Unknown=1, NotChecked=22, Total=182 [2023-08-30 02:07:20,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 636 [2023-08-30 02:07:20,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 333 flow. Second operand has 14 states, 14 states have (on average 176.78571428571428) internal successors, (2475), 14 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:20,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:07:20,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 636 [2023-08-30 02:07:20,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:07:21,294 INFO L130 PetriNetUnfolder]: 590/1180 cut-off events. [2023-08-30 02:07:21,294 INFO L131 PetriNetUnfolder]: For 521/521 co-relation queries the response was YES. [2023-08-30 02:07:21,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2998 conditions, 1180 events. 590/1180 cut-off events. For 521/521 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6356 event pairs, 226 based on Foata normal form. 8/1104 useless extension candidates. Maximal degree in co-relation 2983. Up to 727 conditions per place. [2023-08-30 02:07:21,302 INFO L137 encePairwiseOnDemand]: 628/636 looper letters, 96 selfloop transitions, 14 changer transitions 0/116 dead transitions. [2023-08-30 02:07:21,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 116 transitions, 689 flow [2023-08-30 02:07:21,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:07:21,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:07:21,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1315 transitions. [2023-08-30 02:07:21,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2953728661275831 [2023-08-30 02:07:21,307 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1315 transitions. [2023-08-30 02:07:21,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1315 transitions. [2023-08-30 02:07:21,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:07:21,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1315 transitions. [2023-08-30 02:07:21,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 187.85714285714286) internal successors, (1315), 7 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:21,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 636.0) internal successors, (5088), 8 states have internal predecessors, (5088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:21,316 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 636.0) internal successors, (5088), 8 states have internal predecessors, (5088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:21,316 INFO L175 Difference]: Start difference. First operand has 77 places, 72 transitions, 333 flow. Second operand 7 states and 1315 transitions. [2023-08-30 02:07:21,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 116 transitions, 689 flow [2023-08-30 02:07:21,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 116 transitions, 674 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-30 02:07:21,321 INFO L231 Difference]: Finished difference. Result has 83 places, 78 transitions, 402 flow [2023-08-30 02:07:21,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=402, PETRI_PLACES=83, PETRI_TRANSITIONS=78} [2023-08-30 02:07:21,322 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -23 predicate places. [2023-08-30 02:07:21,322 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 402 flow [2023-08-30 02:07:21,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 176.78571428571428) internal successors, (2475), 14 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:21,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:07:21,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:07:21,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-30 02:07:21,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-30 02:07:21,531 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:07:21,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:07:21,531 INFO L85 PathProgramCache]: Analyzing trace with hash 99588272, now seen corresponding path program 1 times [2023-08-30 02:07:21,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:07:21,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853981373] [2023-08-30 02:07:21,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:07:21,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:07:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:07:22,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:07:22,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:07:22,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853981373] [2023-08-30 02:07:22,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853981373] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:07:22,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153414496] [2023-08-30 02:07:22,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:07:22,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:07:22,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:07:22,408 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:07:22,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-30 02:07:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:07:22,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 64 conjunts are in the unsatisfiable core [2023-08-30 02:07:22,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:07:22,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:07:22,665 INFO L321 Elim1Store]: treesize reduction 98, result has 46.4 percent of original size [2023-08-30 02:07:22,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 314 treesize of output 312 [2023-08-30 02:07:22,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-30 02:07:22,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-08-30 02:07:22,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:07:22,758 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 02:07:22,776 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-08-30 02:07:22,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 123 treesize of output 122 [2023-08-30 02:07:22,875 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 02:07:22,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 23 [2023-08-30 02:07:22,881 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 9 treesize of output 7 [2023-08-30 02:07:23,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:07:23,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:07:23,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2023-08-30 02:07:23,464 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 51 treesize of output 49 [2023-08-30 02:07:23,469 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 49 treesize of output 45 [2023-08-30 02:07:23,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 30 [2023-08-30 02:07:23,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 44 treesize of output 37 [2023-08-30 02:07:23,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:07:23,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 60 [2023-08-30 02:07:23,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:07:23,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:07:23,993 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_555 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_555) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_555 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_555) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-30 02:07:29,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:07:29,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153414496] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:07:29,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:07:29,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 20 [2023-08-30 02:07:29,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059756124] [2023-08-30 02:07:29,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:07:29,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-30 02:07:29,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:07:29,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-30 02:07:29,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=285, Unknown=28, NotChecked=38, Total=462 [2023-08-30 02:07:29,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 636 [2023-08-30 02:07:29,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 78 transitions, 402 flow. Second operand has 22 states, 22 states have (on average 172.77272727272728) internal successors, (3801), 22 states have internal predecessors, (3801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:29,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:07:29,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 636 [2023-08-30 02:07:29,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:07:33,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:07:44,765 WARN L222 SmtUtils]: Spent 7.69s on a formula simplification. DAG size of input: 90 DAG size of output: 65 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:07:47,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:07:56,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:07:59,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:08:01,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:08:04,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:08:05,881 INFO L130 PetriNetUnfolder]: 1065/2153 cut-off events. [2023-08-30 02:08:05,882 INFO L131 PetriNetUnfolder]: For 1087/1087 co-relation queries the response was YES. [2023-08-30 02:08:05,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5446 conditions, 2153 events. 1065/2153 cut-off events. For 1087/1087 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 13242 event pairs, 602 based on Foata normal form. 16/2038 useless extension candidates. Maximal degree in co-relation 5429. Up to 1165 conditions per place. [2023-08-30 02:08:05,896 INFO L137 encePairwiseOnDemand]: 619/636 looper letters, 163 selfloop transitions, 51 changer transitions 0/220 dead transitions. [2023-08-30 02:08:05,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 220 transitions, 1373 flow [2023-08-30 02:08:05,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-30 02:08:05,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-30 02:08:05,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3616 transitions. [2023-08-30 02:08:05,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2842767295597484 [2023-08-30 02:08:05,907 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3616 transitions. [2023-08-30 02:08:05,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3616 transitions. [2023-08-30 02:08:05,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:08:05,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3616 transitions. [2023-08-30 02:08:05,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 180.8) internal successors, (3616), 20 states have internal predecessors, (3616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:08:05,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 636.0) internal successors, (13356), 21 states have internal predecessors, (13356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:08:05,968 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 636.0) internal successors, (13356), 21 states have internal predecessors, (13356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:08:05,969 INFO L175 Difference]: Start difference. First operand has 83 places, 78 transitions, 402 flow. Second operand 20 states and 3616 transitions. [2023-08-30 02:08:05,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 220 transitions, 1373 flow [2023-08-30 02:08:05,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 220 transitions, 1337 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-08-30 02:08:05,976 INFO L231 Difference]: Finished difference. Result has 108 places, 121 transitions, 856 flow [2023-08-30 02:08:05,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=856, PETRI_PLACES=108, PETRI_TRANSITIONS=121} [2023-08-30 02:08:05,977 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 2 predicate places. [2023-08-30 02:08:05,977 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 121 transitions, 856 flow [2023-08-30 02:08:05,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 172.77272727272728) internal successors, (3801), 22 states have internal predecessors, (3801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:08:05,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:08:05,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:08:05,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-30 02:08:06,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-30 02:08:06,186 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:08:06,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:08:06,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1733159420, now seen corresponding path program 1 times [2023-08-30 02:08:06,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:08:06,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494565340] [2023-08-30 02:08:06,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:08:06,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:08:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:08:07,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:08:07,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:08:07,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494565340] [2023-08-30 02:08:07,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494565340] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:08:07,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477886854] [2023-08-30 02:08:07,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:08:07,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:08:07,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:08:07,237 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:08:07,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-30 02:08:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:08:07,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 65 conjunts are in the unsatisfiable core [2023-08-30 02:08:07,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:08:07,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:08:07,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:08:07,434 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 02:08:07,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 29 [2023-08-30 02:08:07,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:08:07,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-30 02:08:07,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-30 02:08:07,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 22 [2023-08-30 02:08:07,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:08:07,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:08:07,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:08:07,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-30 02:08:07,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-08-30 02:08:08,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2023-08-30 02:08:08,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:08:08,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:08:08,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:08:08,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:08:08,200 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_650 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_650 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2023-08-30 02:08:08,216 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_650 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_650 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-30 02:08:08,230 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_650 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_650 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))))) is different from false [2023-08-30 02:08:08,249 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_650 (Array Int Int)) (v_ArrVal_647 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_647) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_650 (Array Int Int)) (v_ArrVal_647 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_647) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2023-08-30 02:08:08,283 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_650 (Array Int Int)) (v_ArrVal_647 Int) (v_ArrVal_645 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_645))) (store (store .cse0 .cse1 v_ArrVal_647) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_650 (Array Int Int)) (v_ArrVal_647 Int) (v_ArrVal_645 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_645))) (store (store .cse6 .cse1 v_ArrVal_647) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-30 02:08:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:08:18,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477886854] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:08:18,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:08:18,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 23 [2023-08-30 02:08:18,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028303544] [2023-08-30 02:08:18,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:08:18,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-30 02:08:18,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:08:18,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-30 02:08:18,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=301, Unknown=9, NotChecked=200, Total=600 [2023-08-30 02:08:19,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-30 02:08:19,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 121 transitions, 856 flow. Second operand has 25 states, 25 states have (on average 167.68) internal successors, (4192), 25 states have internal predecessors, (4192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:08:19,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:08:19,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-30 02:08:19,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:08:33,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:08:34,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:08:42,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:08:44,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:08:44,826 INFO L130 PetriNetUnfolder]: 2164/4428 cut-off events. [2023-08-30 02:08:44,826 INFO L131 PetriNetUnfolder]: For 4670/4676 co-relation queries the response was YES. [2023-08-30 02:08:44,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13323 conditions, 4428 events. 2164/4428 cut-off events. For 4670/4676 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 31897 event pairs, 607 based on Foata normal form. 29/4217 useless extension candidates. Maximal degree in co-relation 13297. Up to 1593 conditions per place. [2023-08-30 02:08:44,852 INFO L137 encePairwiseOnDemand]: 617/636 looper letters, 188 selfloop transitions, 152 changer transitions 0/346 dead transitions. [2023-08-30 02:08:44,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 346 transitions, 2729 flow [2023-08-30 02:08:44,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-30 02:08:44,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-30 02:08:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4070 transitions. [2023-08-30 02:08:44,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2782335247470604 [2023-08-30 02:08:44,865 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4070 transitions. [2023-08-30 02:08:44,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4070 transitions. [2023-08-30 02:08:44,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:08:44,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4070 transitions. [2023-08-30 02:08:44,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 176.95652173913044) internal successors, (4070), 23 states have internal predecessors, (4070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:08:44,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 636.0) internal successors, (15264), 24 states have internal predecessors, (15264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:08:44,887 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 636.0) internal successors, (15264), 24 states have internal predecessors, (15264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:08:44,887 INFO L175 Difference]: Start difference. First operand has 108 places, 121 transitions, 856 flow. Second operand 23 states and 4070 transitions. [2023-08-30 02:08:44,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 346 transitions, 2729 flow [2023-08-30 02:08:44,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 346 transitions, 2548 flow, removed 81 selfloop flow, removed 5 redundant places. [2023-08-30 02:08:44,911 INFO L231 Difference]: Finished difference. Result has 139 places, 269 transitions, 2220 flow [2023-08-30 02:08:44,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2220, PETRI_PLACES=139, PETRI_TRANSITIONS=269} [2023-08-30 02:08:44,912 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 33 predicate places. [2023-08-30 02:08:44,912 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 269 transitions, 2220 flow [2023-08-30 02:08:44,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 167.68) internal successors, (4192), 25 states have internal predecessors, (4192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:08:44,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:08:44,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:08:44,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-30 02:08:45,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:08:45,122 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:08:45,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:08:45,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1207708666, now seen corresponding path program 2 times [2023-08-30 02:08:45,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:08:45,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573553856] [2023-08-30 02:08:45,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:08:45,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:08:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:08:45,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:08:45,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:08:45,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573553856] [2023-08-30 02:08:45,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573553856] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:08:45,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263756155] [2023-08-30 02:08:45,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:08:45,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:08:45,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:08:45,973 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:08:45,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-30 02:08:46,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 02:08:46,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:08:46,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 78 conjunts are in the unsatisfiable core [2023-08-30 02:08:46,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:08:46,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:08:46,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:08:46,168 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 02:08:46,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-30 02:08:46,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:08:46,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-30 02:08:46,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-30 02:08:46,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 29 [2023-08-30 02:08:46,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 27 [2023-08-30 02:08:46,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 34 [2023-08-30 02:08:46,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:08:46,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2023-08-30 02:08:46,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:08:46,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2023-08-30 02:08:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:08:46,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:09:06,621 WARN L222 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:09:06,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:09:06,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263756155] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:09:06,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:09:06,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-08-30 02:09:06,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219277153] [2023-08-30 02:09:06,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:09:06,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-30 02:09:06,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:09:06,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-30 02:09:06,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=497, Unknown=18, NotChecked=0, Total=650 [2023-08-30 02:09:07,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-30 02:09:07,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 269 transitions, 2220 flow. Second operand has 26 states, 26 states have (on average 167.6153846153846) internal successors, (4358), 26 states have internal predecessors, (4358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:09:07,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:09:07,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-30 02:09:07,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:09:24,393 WARN L222 SmtUtils]: Spent 12.78s on a formula simplification. DAG size of input: 96 DAG size of output: 75 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:09:27,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:09:29,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:09:31,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:09:33,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:09:35,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:09:37,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:09:39,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:09:41,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:09:43,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:09:45,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:09:47,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:09:54,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:10:06,132 WARN L222 SmtUtils]: Spent 8.98s on a formula simplification. DAG size of input: 63 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:10:08,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:10,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:12,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:14,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:20,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:22,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:24,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:26,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:42,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:56,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:58,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:11:02,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:11:09,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:11:11,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:11:13,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:11:15,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:11:18,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:11:28,914 WARN L222 SmtUtils]: Spent 9.26s on a formula simplification. DAG size of input: 82 DAG size of output: 65 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:11:30,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:11:33,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:11:34,595 INFO L130 PetriNetUnfolder]: 2641/5313 cut-off events. [2023-08-30 02:11:34,595 INFO L131 PetriNetUnfolder]: For 10783/11012 co-relation queries the response was YES. [2023-08-30 02:11:34,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19848 conditions, 5313 events. 2641/5313 cut-off events. For 10783/11012 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 39568 event pairs, 794 based on Foata normal form. 51/5073 useless extension candidates. Maximal degree in co-relation 19808. Up to 2580 conditions per place. [2023-08-30 02:11:34,635 INFO L137 encePairwiseOnDemand]: 617/636 looper letters, 345 selfloop transitions, 108 changer transitions 0/459 dead transitions. [2023-08-30 02:11:34,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 459 transitions, 4325 flow [2023-08-30 02:11:34,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-30 02:11:34,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-30 02:11:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3855 transitions. [2023-08-30 02:11:34,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27551457975986277 [2023-08-30 02:11:34,643 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3855 transitions. [2023-08-30 02:11:34,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3855 transitions. [2023-08-30 02:11:34,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:11:34,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3855 transitions. [2023-08-30 02:11:34,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 175.22727272727272) internal successors, (3855), 22 states have internal predecessors, (3855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:11:34,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 636.0) internal successors, (14628), 23 states have internal predecessors, (14628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:11:34,661 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 636.0) internal successors, (14628), 23 states have internal predecessors, (14628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:11:34,661 INFO L175 Difference]: Start difference. First operand has 139 places, 269 transitions, 2220 flow. Second operand 22 states and 3855 transitions. [2023-08-30 02:11:34,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 459 transitions, 4325 flow [2023-08-30 02:11:34,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 459 transitions, 3922 flow, removed 200 selfloop flow, removed 1 redundant places. [2023-08-30 02:11:34,742 INFO L231 Difference]: Finished difference. Result has 166 places, 315 transitions, 2669 flow [2023-08-30 02:11:34,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1935, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2669, PETRI_PLACES=166, PETRI_TRANSITIONS=315} [2023-08-30 02:11:34,743 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 60 predicate places. [2023-08-30 02:11:34,743 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 315 transitions, 2669 flow [2023-08-30 02:11:34,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 167.6153846153846) internal successors, (4358), 26 states have internal predecessors, (4358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:11:34,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:11:34,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:11:34,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-30 02:11:34,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-30 02:11:34,950 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:11:34,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:11:34,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1055574398, now seen corresponding path program 1 times [2023-08-30 02:11:34,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:11:34,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153766830] [2023-08-30 02:11:34,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:11:34,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:11:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:11:35,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:11:35,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:11:35,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153766830] [2023-08-30 02:11:35,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153766830] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:11:35,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:11:35,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:11:35,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491239253] [2023-08-30 02:11:35,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:11:35,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:11:35,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:11:35,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:11:35,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:11:35,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-30 02:11:35,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 315 transitions, 2669 flow. Second operand has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:11:35,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:11:35,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-30 02:11:35,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:11:36,231 INFO L130 PetriNetUnfolder]: 2700/5488 cut-off events. [2023-08-30 02:11:36,232 INFO L131 PetriNetUnfolder]: For 14492/14569 co-relation queries the response was YES. [2023-08-30 02:11:36,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21558 conditions, 5488 events. 2700/5488 cut-off events. For 14492/14569 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 41433 event pairs, 719 based on Foata normal form. 13/5294 useless extension candidates. Maximal degree in co-relation 21511. Up to 2606 conditions per place. [2023-08-30 02:11:36,266 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 311 selfloop transitions, 3 changer transitions 0/342 dead transitions. [2023-08-30 02:11:36,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 342 transitions, 3479 flow [2023-08-30 02:11:36,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:11:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:11:36,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 843 transitions. [2023-08-30 02:11:36,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418238993710692 [2023-08-30 02:11:36,269 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 843 transitions. [2023-08-30 02:11:36,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 843 transitions. [2023-08-30 02:11:36,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:11:36,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 843 transitions. [2023-08-30 02:11:36,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:11:36,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:11:36,272 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:11:36,272 INFO L175 Difference]: Start difference. First operand has 166 places, 315 transitions, 2669 flow. Second operand 3 states and 843 transitions. [2023-08-30 02:11:36,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 342 transitions, 3479 flow [2023-08-30 02:11:36,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 342 transitions, 3390 flow, removed 37 selfloop flow, removed 3 redundant places. [2023-08-30 02:11:36,365 INFO L231 Difference]: Finished difference. Result has 161 places, 313 transitions, 2581 flow [2023-08-30 02:11:36,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=2575, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2581, PETRI_PLACES=161, PETRI_TRANSITIONS=313} [2023-08-30 02:11:36,366 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 55 predicate places. [2023-08-30 02:11:36,366 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 313 transitions, 2581 flow [2023-08-30 02:11:36,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:11:36,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:11:36,367 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:11:36,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 02:11:36,367 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:11:36,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:11:36,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2042297759, now seen corresponding path program 1 times [2023-08-30 02:11:36,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:11:36,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594718126] [2023-08-30 02:11:36,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:11:36,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:11:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:11:36,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:11:36,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:11:36,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594718126] [2023-08-30 02:11:36,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594718126] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:11:36,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136434273] [2023-08-30 02:11:36,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:11:36,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:11:36,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:11:36,657 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:11:36,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-30 02:11:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:11:36,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-30 02:11:36,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:11:36,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:11:36,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:11:36,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:11:36,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-30 02:11:37,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:11:37,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:11:37,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:11:37,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136434273] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:11:37,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:11:37,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-08-30 02:11:37,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419626074] [2023-08-30 02:11:37,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:11:37,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 02:11:37,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:11:37,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 02:11:37,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-08-30 02:11:40,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 636 [2023-08-30 02:11:40,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 313 transitions, 2581 flow. Second operand has 11 states, 11 states have (on average 261.6363636363636) internal successors, (2878), 11 states have internal predecessors, (2878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:11:40,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:11:40,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 636 [2023-08-30 02:11:40,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:11:42,639 INFO L130 PetriNetUnfolder]: 2421/4825 cut-off events. [2023-08-30 02:11:42,639 INFO L131 PetriNetUnfolder]: For 17732/17829 co-relation queries the response was YES. [2023-08-30 02:11:42,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22529 conditions, 4825 events. 2421/4825 cut-off events. For 17732/17829 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 31097 event pairs, 404 based on Foata normal form. 296/5038 useless extension candidates. Maximal degree in co-relation 22482. Up to 1525 conditions per place. [2023-08-30 02:11:42,677 INFO L137 encePairwiseOnDemand]: 631/636 looper letters, 432 selfloop transitions, 23 changer transitions 0/484 dead transitions. [2023-08-30 02:11:42,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 484 transitions, 4895 flow [2023-08-30 02:11:42,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:11:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:11:42,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1906 transitions. [2023-08-30 02:11:42,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4281221922731357 [2023-08-30 02:11:42,680 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1906 transitions. [2023-08-30 02:11:42,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1906 transitions. [2023-08-30 02:11:42,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:11:42,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1906 transitions. [2023-08-30 02:11:42,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 272.2857142857143) internal successors, (1906), 7 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:11:42,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 636.0) internal successors, (5088), 8 states have internal predecessors, (5088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:11:42,687 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 636.0) internal successors, (5088), 8 states have internal predecessors, (5088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:11:42,687 INFO L175 Difference]: Start difference. First operand has 161 places, 313 transitions, 2581 flow. Second operand 7 states and 1906 transitions. [2023-08-30 02:11:42,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 484 transitions, 4895 flow [2023-08-30 02:11:42,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 484 transitions, 4845 flow, removed 22 selfloop flow, removed 2 redundant places. [2023-08-30 02:11:42,875 INFO L231 Difference]: Finished difference. Result has 166 places, 306 transitions, 2600 flow [2023-08-30 02:11:42,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=2391, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2600, PETRI_PLACES=166, PETRI_TRANSITIONS=306} [2023-08-30 02:11:42,876 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 60 predicate places. [2023-08-30 02:11:42,876 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 306 transitions, 2600 flow [2023-08-30 02:11:42,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 261.6363636363636) internal successors, (2878), 11 states have internal predecessors, (2878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:11:42,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:11:42,877 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:11:42,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-30 02:11:43,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:11:43,083 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:11:43,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:11:43,084 INFO L85 PathProgramCache]: Analyzing trace with hash 152050041, now seen corresponding path program 1 times [2023-08-30 02:11:43,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:11:43,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774270632] [2023-08-30 02:11:43,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:11:43,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:11:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:11:44,329 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:11:44,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:11:44,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774270632] [2023-08-30 02:11:44,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774270632] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:11:44,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384024305] [2023-08-30 02:11:44,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:11:44,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:11:44,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:11:44,333 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:11:44,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-30 02:11:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:11:44,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 72 conjunts are in the unsatisfiable core [2023-08-30 02:11:44,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:11:44,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:11:44,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:11:44,575 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 02:11:44,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-30 02:11:44,590 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 14 treesize of output 12 [2023-08-30 02:11:44,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 29 [2023-08-30 02:11:44,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 27 [2023-08-30 02:11:45,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 38 treesize of output 31 [2023-08-30 02:11:45,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:11:45,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 51 [2023-08-30 02:11:45,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 56 [2023-08-30 02:11:45,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 59 treesize of output 54 [2023-08-30 02:11:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:11:45,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:11:46,378 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_985 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_983) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_985) .cse1)))))) is different from false [2023-08-30 02:11:46,422 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_980 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_985 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_980) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_983) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_985) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|)))) is different from false [2023-08-30 02:11:46,484 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_980 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_978 Int) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_985 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_978)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_980) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_983) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_985) .cse1) 400))))) is different from false [2023-08-30 02:11:46,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-08-30 02:11:46,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384024305] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:11:46,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:11:46,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 25 [2023-08-30 02:11:46,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182238311] [2023-08-30 02:11:46,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:11:46,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-30 02:11:46,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:11:46,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-30 02:11:46,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=380, Unknown=8, NotChecked=132, Total=650 [2023-08-30 02:11:47,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 636 [2023-08-30 02:11:47,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 306 transitions, 2600 flow. Second operand has 26 states, 26 states have (on average 199.0) internal successors, (5174), 26 states have internal predecessors, (5174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:11:47,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:11:47,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 636 [2023-08-30 02:11:47,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:11:49,755 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (and (forall ((v_ArrVal_980 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_985 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_980) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_983) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_985) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|)))) (not (= 401 |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1|)) (= .cse4 |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1|) (not (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1|))))) is different from false [2023-08-30 02:11:50,174 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (and (forall ((v_ArrVal_980 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_985 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_980) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_983) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_985) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|)))) (not (= 400 .cse4))))) is different from false [2023-08-30 02:11:51,295 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_985 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_983) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_985) .cse1)))))) (not (= 400 (select .cse2 .cse3))))) is different from false [2023-08-30 02:11:51,470 WARN L839 $PredicateComparison]: unable to prove that (and (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_985 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_983) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_985) .cse1))))))) is different from false [2023-08-30 02:11:53,454 INFO L130 PetriNetUnfolder]: 2358/4670 cut-off events. [2023-08-30 02:11:53,454 INFO L131 PetriNetUnfolder]: For 17237/17331 co-relation queries the response was YES. [2023-08-30 02:11:53,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22270 conditions, 4670 events. 2358/4670 cut-off events. For 17237/17331 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 29908 event pairs, 345 based on Foata normal form. 38/4595 useless extension candidates. Maximal degree in co-relation 22220. Up to 3283 conditions per place. [2023-08-30 02:11:53,485 INFO L137 encePairwiseOnDemand]: 620/636 looper letters, 307 selfloop transitions, 93 changer transitions 0/405 dead transitions. [2023-08-30 02:11:53,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 405 transitions, 4034 flow [2023-08-30 02:11:53,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-30 02:11:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-30 02:11:53,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 5675 transitions. [2023-08-30 02:11:53,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3186769991015274 [2023-08-30 02:11:53,494 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 5675 transitions. [2023-08-30 02:11:53,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 5675 transitions. [2023-08-30 02:11:53,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:11:53,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 5675 transitions. [2023-08-30 02:11:53,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 202.67857142857142) internal successors, (5675), 28 states have internal predecessors, (5675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:11:53,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 636.0) internal successors, (18444), 29 states have internal predecessors, (18444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:11:53,519 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 636.0) internal successors, (18444), 29 states have internal predecessors, (18444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:11:53,519 INFO L175 Difference]: Start difference. First operand has 166 places, 306 transitions, 2600 flow. Second operand 28 states and 5675 transitions. [2023-08-30 02:11:53,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 405 transitions, 4034 flow [2023-08-30 02:11:53,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 405 transitions, 3941 flow, removed 28 selfloop flow, removed 5 redundant places. [2023-08-30 02:11:53,658 INFO L231 Difference]: Finished difference. Result has 198 places, 320 transitions, 2980 flow [2023-08-30 02:11:53,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=2338, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=2980, PETRI_PLACES=198, PETRI_TRANSITIONS=320} [2023-08-30 02:11:53,659 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 92 predicate places. [2023-08-30 02:11:53,659 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 320 transitions, 2980 flow [2023-08-30 02:11:53,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 199.0) internal successors, (5174), 26 states have internal predecessors, (5174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:11:53,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:11:53,660 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 02:11:53,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-30 02:11:53,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:11:53,861 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:11:53,862 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:11:53,862 INFO L85 PathProgramCache]: Analyzing trace with hash -323090723, now seen corresponding path program 3 times [2023-08-30 02:11:53,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:11:53,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470624721] [2023-08-30 02:11:53,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:11:53,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:11:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:11:56,607 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:11:56,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:11:56,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470624721] [2023-08-30 02:11:56,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470624721] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:11:56,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008604130] [2023-08-30 02:11:56,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:11:56,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:11:56,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:11:56,609 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:11:56,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-30 02:11:56,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-30 02:11:56,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:11:56,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 87 conjunts are in the unsatisfiable core [2023-08-30 02:11:56,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:11:56,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:11:56,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:11:56,949 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 02:11:56,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 29 [2023-08-30 02:11:56,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:11:56,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-30 02:11:57,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-30 02:11:57,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 22 [2023-08-30 02:11:57,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:11:57,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:11:57,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-30 02:11:57,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-08-30 02:11:58,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2023-08-30 02:11:58,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:11:58,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:11:58,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:11:58,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:11:59,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:11:59,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-30 02:11:59,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-08-30 02:11:59,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2023-08-30 02:11:59,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:11:59,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:11:59,893 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:11:59,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:12:00,462 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1105 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1105) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1105 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1105) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-30 02:12:43,585 WARN L222 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:12:43,865 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-30 02:12:43,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008604130] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:12:43,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:12:43,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 15] total 39 [2023-08-30 02:12:43,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49801373] [2023-08-30 02:12:43,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:12:43,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-08-30 02:12:43,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:12:43,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-08-30 02:12:43,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1254, Unknown=50, NotChecked=76, Total=1640 [2023-08-30 02:12:45,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-30 02:12:45,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 320 transitions, 2980 flow. Second operand has 41 states, 41 states have (on average 167.609756097561) internal successors, (6872), 41 states have internal predecessors, (6872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:12:45,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:12:45,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-30 02:12:45,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:13:07,263 WARN L222 SmtUtils]: Spent 17.55s on a formula simplification. DAG size of input: 229 DAG size of output: 187 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:13:09,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:13:13,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:13:20,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:13:33,550 WARN L222 SmtUtils]: Spent 10.39s on a formula simplification that was a NOOP. DAG size: 96 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:13:35,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:13:40,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:13:40,623 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse5 .cse2 (+ (select .cse5 .cse2) 1))))) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (forall ((v_ArrVal_1105 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1105) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))) (.cse1 (forall ((v_ArrVal_1105 (Array Int Int))) (<= (+ (* (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1105) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) (and (or (and .cse0 .cse1) (< .cse2 0)) .cse0 .cse1)))) is different from false [2023-08-30 02:13:47,467 INFO L130 PetriNetUnfolder]: 1667/3365 cut-off events. [2023-08-30 02:13:47,467 INFO L131 PetriNetUnfolder]: For 16637/16735 co-relation queries the response was YES. [2023-08-30 02:13:47,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17475 conditions, 3365 events. 1667/3365 cut-off events. For 16637/16735 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 20220 event pairs, 246 based on Foata normal form. 76/3372 useless extension candidates. Maximal degree in co-relation 17419. Up to 1414 conditions per place. [2023-08-30 02:13:47,490 INFO L137 encePairwiseOnDemand]: 619/636 looper letters, 298 selfloop transitions, 107 changer transitions 0/410 dead transitions. [2023-08-30 02:13:47,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 410 transitions, 4564 flow [2023-08-30 02:13:47,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-30 02:13:47,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-30 02:13:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3834 transitions. [2023-08-30 02:13:47,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27401372212692965 [2023-08-30 02:13:47,496 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3834 transitions. [2023-08-30 02:13:47,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3834 transitions. [2023-08-30 02:13:47,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:13:47,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3834 transitions. [2023-08-30 02:13:47,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 174.27272727272728) internal successors, (3834), 22 states have internal predecessors, (3834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:13:47,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 636.0) internal successors, (14628), 23 states have internal predecessors, (14628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:13:47,512 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 636.0) internal successors, (14628), 23 states have internal predecessors, (14628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:13:47,512 INFO L175 Difference]: Start difference. First operand has 198 places, 320 transitions, 2980 flow. Second operand 22 states and 3834 transitions. [2023-08-30 02:13:47,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 410 transitions, 4564 flow [2023-08-30 02:13:47,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 410 transitions, 4430 flow, removed 30 selfloop flow, removed 14 redundant places. [2023-08-30 02:13:47,582 INFO L231 Difference]: Finished difference. Result has 216 places, 331 transitions, 3404 flow [2023-08-30 02:13:47,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=2585, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3404, PETRI_PLACES=216, PETRI_TRANSITIONS=331} [2023-08-30 02:13:47,583 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 110 predicate places. [2023-08-30 02:13:47,583 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 331 transitions, 3404 flow [2023-08-30 02:13:47,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 167.609756097561) internal successors, (6872), 41 states have internal predecessors, (6872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:13:47,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:13:47,584 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 02:13:47,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-30 02:13:47,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:13:47,785 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:13:47,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:13:47,785 INFO L85 PathProgramCache]: Analyzing trace with hash 202337711, now seen corresponding path program 4 times [2023-08-30 02:13:47,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:13:47,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405943341] [2023-08-30 02:13:47,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:13:47,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:13:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:13:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:13:49,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:13:49,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405943341] [2023-08-30 02:13:49,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405943341] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:13:49,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687762466] [2023-08-30 02:13:49,971 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 02:13:49,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:13:49,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:13:49,972 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:13:49,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-30 02:13:50,117 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 02:13:50,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:13:50,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 85 conjunts are in the unsatisfiable core [2023-08-30 02:13:50,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:13:50,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:13:50,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:13:50,222 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 02:13:50,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 29 [2023-08-30 02:13:50,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:13:50,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-30 02:13:50,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-30 02:13:50,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 22 [2023-08-30 02:13:50,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:13:50,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-30 02:13:51,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-08-30 02:13:51,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2023-08-30 02:13:51,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:13:51,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:13:51,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:13:51,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-30 02:13:52,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-08-30 02:13:52,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2023-08-30 02:13:52,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:13:52,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:13:52,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:13:52,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:13:52,832 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:13:52,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:13:52,923 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1223 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_1223 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-30 02:13:52,945 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-30 02:13:53,202 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2023-08-30 02:13:53,658 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_1216))) (store (store .cse0 .cse1 v_ArrVal_1218) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_1216))) (store (store .cse6 .cse1 v_ArrVal_1218) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-30 02:14:01,734 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse3 .cse4 v_ArrVal_1218) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (or (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse7 .cse4 v_ArrVal_1218) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4)))))))))) is different from false [2023-08-30 02:14:01,786 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int))) (let ((.cse2 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= (+ (* 4 (select (select (store (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse3 .cse4 v_ArrVal_1218) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int))) (let ((.cse6 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= 0 (+ (* 4 (select (select (store (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse7 .cse4 v_ArrVal_1218) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|))))))) is different from false [2023-08-30 02:14:01,846 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int))) (let ((.cse0 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= (+ (* (select (select (store (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse1 .cse2 v_ArrVal_1218) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int))) (let ((.cse6 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= 0 (+ (* (select (select (store (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse7 .cse2 v_ArrVal_1218) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|))))))) is different from false [2023-08-30 02:14:01,949 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (+ (select .cse5 .cse7) 1))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1212 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1212) .cse7 .cse8)) |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= 0 (+ (* (select (select (store (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse3 .cse4 v_ArrVal_1218) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1212 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1212) .cse7 .cse8)) |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= (+ (* (select (select (store (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse10 .cse4 v_ArrVal_1218) .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|)))))))) is different from false [2023-08-30 02:14:49,090 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 7 not checked. [2023-08-30 02:14:49,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687762466] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:14:49,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:14:49,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 14] total 36 [2023-08-30 02:14:49,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372980841] [2023-08-30 02:14:49,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:14:49,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-08-30 02:14:49,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:14:49,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-08-30 02:14:49,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=684, Unknown=40, NotChecked=504, Total=1406 [2023-08-30 02:14:49,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-30 02:14:49,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 331 transitions, 3404 flow. Second operand has 38 states, 38 states have (on average 167.73684210526315) internal successors, (6374), 38 states have internal predecessors, (6374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:14:49,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:14:49,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-30 02:14:49,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:15:02,472 WARN L222 SmtUtils]: Spent 8.98s on a formula simplification. DAG size of input: 117 DAG size of output: 78 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:15:13,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:15:16,122 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse8 (select .cse7 .cse1)) (.cse17 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse19 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse17 .cse19 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse5 (select |c_#length| |c_~#queue~0.base|)) (.cse18 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse20 (+ (select .cse17 .cse19) 1)) (.cse11 (* .cse8 4))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_113| Int)) (or (forall ((v_ArrVal_1209 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1212 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse6 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1209))) (store (store .cse6 .cse4 v_ArrVal_1212) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= (+ (* (select (select (store (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse3 .cse4 v_ArrVal_1218) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse5)))))) (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_113|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int)) (or (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse9 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse9 .cse4 v_ArrVal_1218) .cse1 (+ 1 (select .cse9 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int)) (or (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= (+ (* (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse10 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse10 .cse4 v_ArrVal_1218) .cse1 (+ 1 (select .cse10 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse5)))) (<= (+ .cse11 |c_~#queue~0.offset| 4) .cse5) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (<= (+ (* (select (select (store (store .cse12 |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse5)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_113| Int)) (or (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_113|) (forall ((v_ArrVal_1209 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1212 Int)) (let ((.cse13 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse16 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1209))) (store (store .cse16 .cse4 v_ArrVal_1212) .cse1 (+ (select .cse16 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= 0 (+ (* (select (select (store (store (store .cse13 |c_~#queue~0.base| (let ((.cse14 (store .cse15 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse14 .cse4 v_ArrVal_1218) .cse1 (+ (select .cse14 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (< (select .cse15 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|))))))) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse12 |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1218 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse17 .cse18 v_ArrVal_1218) .cse19 .cse20)) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4)) .cse5)) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1218 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse17 .cse18 v_ArrVal_1218) .cse19 .cse20)) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4)))) (<= 0 (+ .cse11 |c_~#queue~0.offset|)))))) is different from false [2023-08-30 02:15:18,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:15:18,478 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse10 (+ (select .cse7 .cse9) 1)) (.cse5 (select |c_#length| |c_~#queue~0.base|)) (.cse6 (* (select (select |c_#memory_int| |c_~#queue~0.base|) .cse1) 4)) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse3 .cse4 v_ArrVal_1218) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4)) .cse5)))))) (<= (+ .cse6 |c_~#queue~0.offset| 4) .cse5) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1218 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 .cse8 v_ArrVal_1218) .cse9 .cse10)) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4)) .cse5)) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1218 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 .cse8 v_ArrVal_1218) .cse9 .cse10)) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse5)) (<= 0 (+ .cse6 |c_~#queue~0.offset|)) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse11 (select .cse12 |c_~#queue~0.base|))) (or (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse13 .cse4 v_ArrVal_1218) .cse1 (+ (select .cse13 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4))))))))))) is different from false [2023-08-30 02:15:20,871 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse4 .cse3)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse1 .cse2 v_ArrVal_1218) .cse3 (+ 1 (select .cse1 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))) (forall ((v_ArrVal_1223 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse3) 4)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= (+ (* (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse5 .cse2 v_ArrVal_1218) .cse3 (+ 1 (select .cse5 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse6)))) (forall ((v_ArrVal_1223 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse3) 4)) .cse6))))) is different from false [2023-08-30 02:15:27,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:15:29,689 INFO L130 PetriNetUnfolder]: 2221/4479 cut-off events. [2023-08-30 02:15:29,689 INFO L131 PetriNetUnfolder]: For 34207/34542 co-relation queries the response was YES. [2023-08-30 02:15:29,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26403 conditions, 4479 events. 2221/4479 cut-off events. For 34207/34542 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 28044 event pairs, 319 based on Foata normal form. 63/4434 useless extension candidates. Maximal degree in co-relation 26337. Up to 1995 conditions per place. [2023-08-30 02:15:29,727 INFO L137 encePairwiseOnDemand]: 617/636 looper letters, 231 selfloop transitions, 317 changer transitions 0/553 dead transitions. [2023-08-30 02:15:29,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 553 transitions, 6818 flow [2023-08-30 02:15:29,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-08-30 02:15:29,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-08-30 02:15:29,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 5579 transitions. [2023-08-30 02:15:29,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.274125393081761 [2023-08-30 02:15:29,735 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 5579 transitions. [2023-08-30 02:15:29,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 5579 transitions. [2023-08-30 02:15:29,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:15:29,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 5579 transitions. [2023-08-30 02:15:29,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 174.34375) internal successors, (5579), 32 states have internal predecessors, (5579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:29,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 636.0) internal successors, (20988), 33 states have internal predecessors, (20988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:29,761 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 636.0) internal successors, (20988), 33 states have internal predecessors, (20988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:29,761 INFO L175 Difference]: Start difference. First operand has 216 places, 331 transitions, 3404 flow. Second operand 32 states and 5579 transitions. [2023-08-30 02:15:29,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 553 transitions, 6818 flow [2023-08-30 02:15:29,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 553 transitions, 6537 flow, removed 113 selfloop flow, removed 7 redundant places. [2023-08-30 02:15:29,877 INFO L231 Difference]: Finished difference. Result has 260 places, 510 transitions, 6393 flow [2023-08-30 02:15:29,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=3181, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=6393, PETRI_PLACES=260, PETRI_TRANSITIONS=510} [2023-08-30 02:15:29,878 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 154 predicate places. [2023-08-30 02:15:29,878 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 510 transitions, 6393 flow [2023-08-30 02:15:29,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 167.73684210526315) internal successors, (6374), 38 states have internal predecessors, (6374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:15:29,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:15:29,879 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2023-08-30 02:15:29,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-30 02:15:30,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-08-30 02:15:30,080 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-30 02:15:30,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:15:30,081 INFO L85 PathProgramCache]: Analyzing trace with hash -80884552, now seen corresponding path program 5 times [2023-08-30 02:15:30,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:15:30,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789226262] [2023-08-30 02:15:30,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:15:30,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:15:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:15:34,685 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:15:34,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:15:34,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789226262] [2023-08-30 02:15:34,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789226262] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:15:34,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526549157] [2023-08-30 02:15:34,686 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 02:15:34,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:15:34,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:15:34,689 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:15:34,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-30 02:15:34,938 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-08-30 02:15:34,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:15:34,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 117 conjunts are in the unsatisfiable core [2023-08-30 02:15:34,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:15:34,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:15:35,080 INFO L321 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2023-08-30 02:15:35,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2023-08-30 02:15:35,121 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-30 02:15:35,121 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 1 case distinctions, treesize of input 9 treesize of output 11 [2023-08-30 02:15:35,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 42 treesize of output 35 [2023-08-30 02:15:36,025 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-30 02:15:36,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 24 [2023-08-30 02:15:36,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 27 [2023-08-30 02:15:37,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 38 treesize of output 31 [2023-08-30 02:15:37,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:15:37,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 51 [2023-08-30 02:15:38,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 67 treesize of output 58 [2023-08-30 02:15:38,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 78 treesize of output 73 [2023-08-30 02:15:39,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 84 treesize of output 77 [2023-08-30 02:15:39,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:15:39,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 143 [2023-08-30 02:15:40,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 155 treesize of output 148 [2023-08-30 02:15:40,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 151 treesize of output 146 [2023-08-30 02:15:41,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 157 treesize of output 150 [2023-08-30 02:15:41,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:15:41,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 287 treesize of output 289 [2023-08-30 02:15:42,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:15:42,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 287 treesize of output 289 [2023-08-30 02:15:42,714 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:15:42,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:15:42,880 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1365 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_1365 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-30 02:15:43,724 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2023-08-30 02:15:57,184 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse4 .cse3)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ (* (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse1 .cse2 v_ArrVal_1361) .cse3 (+ (select .cse1 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse5 .cse2 v_ArrVal_1361) .cse3 (+ (select .cse5 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|)))))))) is different from false [2023-08-30 02:15:58,194 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_1357 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse2 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ (* (select (select (store (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse3 .cse4 v_ArrVal_1361) .cse1 (+ (select .cse3 .cse1) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))) (forall ((v_ArrVal_1357 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse7 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (or (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ (* (select (select (store (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse8 .cse4 v_ArrVal_1361) .cse1 (+ (select .cse8 .cse1) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))))))) is different from false [2023-08-30 02:15:58,248 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))))) (and (forall ((v_ArrVal_1357 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse0 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ (* 4 (select (select (store (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse1 .cse2 v_ArrVal_1361) .cse3 (+ (select .cse1 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|))))) (forall ((v_ArrVal_1357 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse6 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ (* 4 (select (select (store (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse7 .cse2 v_ArrVal_1361) .cse3 (+ (select .cse7 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|))))))) is different from false [2023-08-30 02:16:14,818 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1350 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse9 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (+ (* (select .cse9 .cse4) 4) |c_~#queue~0.offset|))) (or (< .cse0 0) (forall ((v_ArrVal_1352 Int)) (let ((.cse7 (store .cse9 .cse0 v_ArrVal_1352))) (let ((.cse8 (select .cse7 .cse4))) (or (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse1 (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_1354) .cse4 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ (* (select (select (store (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse2 .cse3 v_ArrVal_1361) .cse4 (+ (select .cse2 .cse4) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|))))) (= 400 .cse8)))))))))) (forall ((v_ArrVal_1350 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (let ((.cse17 (+ (* (select .cse16 .cse4) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1352 Int)) (let ((.cse15 (store .cse16 .cse17 v_ArrVal_1352))) (let ((.cse10 (select .cse15 .cse4))) (or (= 400 .cse10) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse11 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse3 v_ArrVal_1354) .cse4 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ (* (select (select (store (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse12 .cse3 v_ArrVal_1361) .cse4 (+ (select .cse12 .cse4) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse13 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|))))))))) (< .cse17 0)))))))) is different from false [2023-08-30 02:16:15,668 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse19 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse20 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse19 .cse20 (+ (select .cse19 .cse20) 1)))))) (and (forall ((v_ArrVal_1350 (Array Int Int))) (let ((.cse5 (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse8 (select .cse5 |c_~#queue~0.base|))) (let ((.cse9 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1352 Int)) (let ((.cse6 (store .cse8 .cse9 v_ArrVal_1352))) (let ((.cse7 (select .cse6 .cse1))) (or (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse2 (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_1354) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ (* (select (select (store (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse3 .cse4 v_ArrVal_1361) .cse1 (+ (select .cse3 .cse1) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))))) (= 400 .cse7))))) (< .cse9 0)))))) (forall ((v_ArrVal_1350 (Array Int Int))) (let ((.cse14 (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse17 (select .cse14 |c_~#queue~0.base|))) (let ((.cse18 (+ (* (select .cse17 .cse1) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1352 Int)) (let ((.cse15 (store .cse17 .cse18 v_ArrVal_1352))) (let ((.cse16 (select .cse15 .cse1))) (or (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse4 v_ArrVal_1354) .cse1 (+ .cse16 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse11 (select .cse12 |c_~#queue~0.base|))) (or (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ (* (select (select (store (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse13 .cse4 v_ArrVal_1361) .cse1 (+ (select .cse13 .cse1) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))) (= 400 .cse16))))) (< .cse18 0)))))))) is different from false [2023-08-30 02:16:29,090 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 10 refuted. 4 times theorem prover too weak. 0 trivial. 13 not checked. [2023-08-30 02:16:29,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526549157] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:16:29,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:16:29,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 23] total 58 [2023-08-30 02:16:29,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156630511] [2023-08-30 02:16:29,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:16:29,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2023-08-30 02:16:29,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:16:29,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2023-08-30 02:16:29,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=2311, Unknown=133, NotChecked=756, Total=3540 [2023-08-30 02:16:32,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 636 [2023-08-30 02:16:32,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 510 transitions, 6393 flow. Second operand has 60 states, 60 states have (on average 161.5) internal successors, (9690), 60 states have internal predecessors, (9690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:16:32,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:16:32,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 636 [2023-08-30 02:16:32,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:17:10,374 WARN L222 SmtUtils]: Spent 8.49s on a formula simplification. DAG size of input: 221 DAG size of output: 114 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:17:23,345 WARN L222 SmtUtils]: Spent 9.11s on a formula simplification. DAG size of input: 185 DAG size of output: 114 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:17:39,578 WARN L222 SmtUtils]: Spent 10.02s on a formula simplification. DAG size of input: 199 DAG size of output: 114 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:17:57,452 WARN L222 SmtUtils]: Spent 8.88s on a formula simplification. DAG size of input: 175 DAG size of output: 114 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:18:46,915 WARN L222 SmtUtils]: Spent 45.61s on a formula simplification. DAG size of input: 291 DAG size of output: 123 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:18:52,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:18:54,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:18:56,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:18:58,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:19:00,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:19:02,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:19:04,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:19:06,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:19:08,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:19:10,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:19:12,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:19:14,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:19:17,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:19:19,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:19:21,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:19:23,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:19:25,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:19:27,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:19:29,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:19:29,560 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse30 (select .cse0 .cse2))) (let ((.cse5 (= 400 .cse30)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ .cse30 1)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse10 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1361) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (or .cse5 (and (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1354) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse9 (select .cse6 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ (* (select (select (store (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse7 .cse8 v_ArrVal_1361) .cse4 (+ (select .cse7 .cse4) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) .cse10)) (< (select .cse9 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|))))) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1354) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse11 (select .cse12 |c_~#queue~0.base|))) (or (< (select .cse11 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ (* (select (select (store (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse13 .cse8 v_ArrVal_1361) .cse4 (+ (select .cse13 .cse4) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))))))))) (or (< (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 1612 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) .cse5 (and (forall ((v_ArrVal_1347 Int) (v_ArrVal_1350 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1347) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse20 (select .cse18 |c_~#queue~0.base|))) (let ((.cse21 (+ (* 4 (select .cse20 .cse4)) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1352 Int)) (let ((.cse19 (store .cse20 .cse21 v_ArrVal_1352))) (let ((.cse14 (select .cse19 .cse4))) (or (= 400 .cse14) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse16 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse8 v_ArrVal_1354) .cse4 (+ .cse14 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse15 (select .cse16 |c_~#queue~0.base|))) (or (< (select .cse15 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ (* (select (select (store (store (store .cse16 |c_~#queue~0.base| (let ((.cse17 (store .cse15 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse17 .cse8 v_ArrVal_1361) .cse4 (+ (select .cse17 .cse4) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) .cse10)))))))))) (< .cse21 0)))))) (forall ((v_ArrVal_1347 Int) (v_ArrVal_1350 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1347) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse28 (select .cse26 |c_~#queue~0.base|))) (let ((.cse29 (+ (* 4 (select .cse28 .cse4)) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1352 Int)) (let ((.cse27 (store .cse28 .cse29 v_ArrVal_1352))) (let ((.cse22 (select .cse27 .cse4))) (or (= 400 .cse22) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse24 (store (store .cse26 |c_~#queue~0.base| (store (store .cse27 .cse8 v_ArrVal_1354) .cse4 (+ .cse22 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse23 (select .cse24 |c_~#queue~0.base|))) (or (< (select .cse23 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ (* (select (select (store (store (store .cse24 |c_~#queue~0.base| (let ((.cse25 (store .cse23 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse25 .cse8 v_ArrVal_1361) .cse4 (+ (select .cse25 .cse4) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))))))))))) (< .cse29 0)))))))) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (<= (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1361) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) .cse10)))))) is different from false [2023-08-30 02:19:31,990 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse30 (select .cse12 .cse14))) (let ((.cse0 (= 400 .cse30)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse13 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse15 (+ .cse30 1)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse7 (select |c_#length| |c_~#queue~0.base|))) (and (or .cse0 (and (forall ((v_ArrVal_1347 Int) (v_ArrVal_1350 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 v_ArrVal_1347) .cse14 .cse15)) |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse11 (+ (* 4 (select .cse10 .cse3)) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1352 Int)) (let ((.cse9 (store .cse10 .cse11 v_ArrVal_1352))) (let ((.cse1 (select .cse9 .cse3))) (or (= 400 .cse1) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse4 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_1354) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (or (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ (* (select (select (store (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse5 .cse6 v_ArrVal_1361) .cse3 (+ (select .cse5 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse7)))))))))) (< .cse11 0)))))) (forall ((v_ArrVal_1347 Int) (v_ArrVal_1350 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 v_ArrVal_1347) .cse14 .cse15)) |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (let ((.cse23 (+ (* 4 (select .cse22 .cse3)) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1352 Int)) (let ((.cse21 (store .cse22 .cse23 v_ArrVal_1352))) (let ((.cse16 (select .cse21 .cse3))) (or (= 400 .cse16) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse18 (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse6 v_ArrVal_1354) .cse3 (+ .cse16 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse17 (select .cse18 |c_~#queue~0.base|))) (or (< (select .cse17 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ (* (select (select (store (store (store .cse18 |c_~#queue~0.base| (let ((.cse19 (store .cse17 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse19 .cse6 v_ArrVal_1361) .cse3 (+ (select .cse19 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))))))))) (< .cse23 0)))))))) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 v_ArrVal_1361) .cse14 .cse15)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (or .cse0 (and (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse24 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 v_ArrVal_1354) .cse14 .cse15)) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse26 (select .cse24 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ (* (select (select (store (store (store .cse24 |c_~#queue~0.base| (let ((.cse25 (store .cse26 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse25 .cse6 v_ArrVal_1361) .cse3 (+ (select .cse25 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse7)) (< (select .cse26 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|))))) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse28 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 v_ArrVal_1354) .cse14 .cse15)) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse27 (select .cse28 |c_~#queue~0.base|))) (or (< (select .cse27 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ (* (select (select (store (store (store .cse28 |c_~#queue~0.base| (let ((.cse29 (store .cse27 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse29 .cse6 v_ArrVal_1361) .cse3 (+ (select .cse29 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))))))) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (<= (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse13 v_ArrVal_1361) .cse14 .cse15)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse7)))))) is different from false [2023-08-30 02:19:34,223 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse27 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse28 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse29 (select .cse27 .cse28))) (let ((.cse10 (= 400 .cse29)) (.cse2 (select |c_#length| |c_~#queue~0.base|)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse27 .cse28 (+ .cse29 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse1) 4) 4) .cse2)) (or (and (forall ((v_ArrVal_1357 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse3 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ (* 4 (select (select (store (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse4 .cse5 v_ArrVal_1361) .cse1 (+ (select .cse4 .cse1) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|))))) (forall ((v_ArrVal_1357 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse7 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ (* 4 (select (select (store (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse8 .cse5 v_ArrVal_1361) .cse1 (+ (select .cse8 .cse1) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) .cse2)) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|)))))) .cse10) (or .cse10 (and (forall ((v_ArrVal_1350 (Array Int Int))) (let ((.cse14 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse17 (select .cse14 |c_~#queue~0.base|))) (let ((.cse18 (+ (* (select .cse17 .cse1) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1352 Int)) (let ((.cse15 (store .cse17 .cse18 v_ArrVal_1352))) (let ((.cse16 (select .cse15 .cse1))) (or (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse5 v_ArrVal_1354) .cse1 (+ .cse16 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse11 (select .cse12 |c_~#queue~0.base|))) (or (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ (* (select (select (store (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse13 .cse5 v_ArrVal_1361) .cse1 (+ (select .cse13 .cse1) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))))) (= 400 .cse16))))) (< .cse18 0)))))) (forall ((v_ArrVal_1350 (Array Int Int))) (let ((.cse22 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse25 (select .cse22 |c_~#queue~0.base|))) (let ((.cse26 (+ (* (select .cse25 .cse1) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1352 Int)) (let ((.cse23 (store .cse25 .cse26 v_ArrVal_1352))) (let ((.cse24 (select .cse23 .cse1))) (or (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse20 (store (store .cse22 |c_~#queue~0.base| (store (store .cse23 .cse5 v_ArrVal_1354) .cse1 (+ .cse24 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse19 (select .cse20 |c_~#queue~0.base|))) (or (< (select .cse19 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ (* (select (select (store (store (store .cse20 |c_~#queue~0.base| (let ((.cse21 (store .cse19 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse21 .cse5 v_ArrVal_1361) .cse1 (+ (select .cse21 .cse1) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse2)))))) (= 400 .cse24))))) (< .cse26 0)))))))) (forall ((v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse1) 4)))))))) is different from false [2023-08-30 02:19:34,614 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (select |c_#length| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse26 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse27 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse26 .cse27 (+ (select .cse26 .cse27) 1)))))) (and (forall ((v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse1) 4) 4) .cse2)) (forall ((v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_1350 (Array Int Int))) (let ((.cse7 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse10 (select .cse7 |c_~#queue~0.base|))) (let ((.cse11 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1352 Int)) (let ((.cse8 (store .cse10 .cse11 v_ArrVal_1352))) (let ((.cse9 (select .cse8 .cse1))) (or (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse6 v_ArrVal_1354) .cse1 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (or (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ (* (select (select (store (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse5 .cse6 v_ArrVal_1361) .cse1 (+ (select .cse5 .cse1) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))))) (= 400 .cse9))))) (< .cse11 0)))))) (forall ((v_ArrVal_1357 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse12 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ (* 4 (select (select (store (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse14 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse13 .cse6 v_ArrVal_1361) .cse1 (+ (select .cse13 .cse1) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (< (select .cse14 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|))))) (forall ((v_ArrVal_1350 (Array Int Int))) (let ((.cse18 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse21 (select .cse18 |c_~#queue~0.base|))) (let ((.cse22 (+ (* (select .cse21 .cse1) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1352 Int)) (let ((.cse19 (store .cse21 .cse22 v_ArrVal_1352))) (let ((.cse20 (select .cse19 .cse1))) (or (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse16 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse6 v_ArrVal_1354) .cse1 (+ .cse20 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse15 (select .cse16 |c_~#queue~0.base|))) (or (< (select .cse15 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ (* (select (select (store (store (store .cse16 |c_~#queue~0.base| (let ((.cse17 (store .cse15 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse17 .cse6 v_ArrVal_1361) .cse1 (+ (select .cse17 .cse1) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse2)))))) (= 400 .cse20))))) (< .cse22 0)))))) (forall ((v_ArrVal_1357 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse23 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse25 (select .cse23 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ (* 4 (select (select (store (store (store .cse23 |c_~#queue~0.base| (let ((.cse24 (store .cse25 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse24 .cse6 v_ArrVal_1361) .cse1 (+ (select .cse24 .cse1) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) .cse2)) (< (select .cse25 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|))))))) is different from false [2023-08-30 02:19:50,104 WARN L222 SmtUtils]: Spent 14.23s on a formula simplification that was a NOOP. DAG size: 199 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:19:50,199 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#length| |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_1350 (Array Int Int))) (let ((.cse6 (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse9 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (+ (* 4 (select .cse9 .cse4)) |c_~#queue~0.offset|))) (or (< .cse0 0) (forall ((v_ArrVal_1352 Int)) (let ((.cse7 (store .cse9 .cse0 v_ArrVal_1352))) (let ((.cse8 (select .cse7 .cse4))) (or (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse1 (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_1354) .cse4 (+ 1 .cse8))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse2 .cse3 v_ArrVal_1361) .cse4 (+ (select .cse2 .cse4) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse4) 4)))) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|))))) (= 400 .cse8)))))))))) (forall ((v_ArrVal_1357 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse12 (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse11 (select .cse12 |c_~#queue~0.base|))) (or (< (select .cse11 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ (* (select (select (store (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse13 .cse3 v_ArrVal_1361) .cse4 (+ (select .cse13 .cse4) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) .cse14)))))) (forall ((v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (<= (+ (* (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) .cse14)) (forall ((v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1350 (Array Int Int))) (let ((.cse20 (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (let ((.cse15 (+ (* 4 (select .cse22 .cse4)) |c_~#queue~0.offset|))) (or (< .cse15 0) (forall ((v_ArrVal_1352 Int)) (let ((.cse21 (store .cse22 .cse15 v_ArrVal_1352))) (let ((.cse16 (select .cse21 .cse4))) (or (= 400 .cse16) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse17 (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse3 v_ArrVal_1354) .cse4 (+ 1 .cse16))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse17 |c_~#queue~0.base| (let ((.cse18 (store .cse19 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse18 .cse3 v_ArrVal_1361) .cse4 (+ (select .cse18 .cse4) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse4) 4) 4) .cse14)) (< (select .cse19 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|)))))))))))))) (forall ((v_ArrVal_1357 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse24 (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse23 (select .cse24 |c_~#queue~0.base|))) (or (< (select .cse23 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ (* (select (select (store (store (store .cse24 |c_~#queue~0.base| (let ((.cse25 (store .cse23 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse25 .cse3 v_ArrVal_1361) .cse4 (+ (select .cse25 .cse4) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))))))))) is different from false [2023-08-30 02:19:51,083 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (select |c_#length| |c_~#queue~0.base|)) (.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) .cse1)) (forall ((v_ArrVal_1357 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse3 .cse4 v_ArrVal_1361) .cse0 (+ (select .cse3 .cse0) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse0) 4)))) (< (select .cse5 .cse0) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|))))) (forall ((v_ArrVal_1350 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse13 (select .cse10 |c_~#queue~0.base|))) (let ((.cse6 (+ (* (select .cse13 .cse0) 4) |c_~#queue~0.offset|))) (or (< .cse6 0) (forall ((v_ArrVal_1352 Int)) (let ((.cse11 (store .cse13 .cse6 v_ArrVal_1352))) (let ((.cse12 (select .cse11 .cse0))) (or (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse7 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse4 v_ArrVal_1354) .cse0 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ (* (select (select (store (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse8 .cse4 v_ArrVal_1361) .cse0 (+ (select .cse8 .cse0) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (< (select .cse9 .cse0) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|))))) (= 400 .cse12)))))))))) (forall ((v_ArrVal_1350 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse20 (select .cse18 |c_~#queue~0.base|))) (let ((.cse21 (+ (* (select .cse20 .cse0) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1352 Int)) (let ((.cse19 (store .cse20 .cse21 v_ArrVal_1352))) (let ((.cse14 (select .cse19 .cse0))) (or (= 400 .cse14) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse15 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse4 v_ArrVal_1354) .cse0 (+ .cse14 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ (* (select (select (store (store (store .cse15 |c_~#queue~0.base| (let ((.cse16 (store .cse17 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse16 .cse4 v_ArrVal_1361) .cse0 (+ (select .cse16 .cse0) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) .cse1)) (< (select .cse17 .cse0) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|))))))))) (< .cse21 0)))))) (forall ((v_ArrVal_1357 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse22 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse24 (select .cse22 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse22 |c_~#queue~0.base| (let ((.cse23 (store .cse24 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse23 .cse4 v_ArrVal_1361) .cse0 (+ (select .cse23 .cse0) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse0) 4) 4) .cse1)) (< (select .cse24 .cse0) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|))))))) is different from false [2023-08-30 02:20:13,655 WARN L222 SmtUtils]: Spent 12.24s on a formula simplification that was a NOOP. DAG size: 91 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:20:15,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:20:17,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:20:19,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:20:22,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:20:24,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:20:26,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:20:28,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:20:30,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:20:33,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:20:35,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:20:37,236 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse22 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse20 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse29 (select .cse22 .cse20))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse23 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse19 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse38 (+ .cse29 1)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse7 (select |c_#length| |c_~#queue~0.base|))) (and (let ((.cse9 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|))) (or (< .cse0 0) (and (forall ((v_ArrVal_1352 Int)) (let ((.cse8 (store .cse9 .cse0 v_ArrVal_1352))) (let ((.cse1 (select .cse8 .cse3))) (or (= 400 .cse1) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse4 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse6 v_ArrVal_1354) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (or (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse5 .cse6 v_ArrVal_1361) .cse3 (+ (select .cse5 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4)) .cse7)))))))))) (forall ((v_ArrVal_1352 Int)) (let ((.cse14 (store .cse9 .cse0 v_ArrVal_1352))) (let ((.cse10 (select .cse14 .cse3))) (or (= 400 .cse10) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse11 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse14 .cse6 v_ArrVal_1354) .cse3 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse12 .cse6 v_ArrVal_1361) .cse3 (+ (select .cse12 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4)))) (< (select .cse13 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|))))))))))))) (or (and (forall ((v_ArrVal_1352 Int)) (let ((.cse18 (store .cse22 .cse23 v_ArrVal_1352))) (let ((.cse21 (select .cse18 .cse20))) (or (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse18 .cse19 v_ArrVal_1354) .cse20 (+ .cse21 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse15 (select .cse16 |c_~#queue~0.base|))) (or (< (select .cse15 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store .cse16 |c_~#queue~0.base| (let ((.cse17 (store .cse15 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse17 .cse6 v_ArrVal_1361) .cse3 (+ (select .cse17 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4)) .cse7)))))) (= 400 .cse21))))) (forall ((v_ArrVal_1352 Int)) (let ((.cse27 (store .cse22 .cse23 v_ArrVal_1352))) (let ((.cse28 (select .cse27 .cse20))) (or (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse24 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse27 .cse19 v_ArrVal_1354) .cse20 (+ .cse28 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse26 (select .cse24 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse24 |c_~#queue~0.base| (let ((.cse25 (store .cse26 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse25 .cse6 v_ArrVal_1361) .cse3 (+ (select .cse25 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4)))) (< (select .cse26 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|))))) (= 400 .cse28)))))) (< .cse23 0)) (or (= 400 .cse29) (and (forall ((v_ArrVal_1347 Int) (v_ArrVal_1350 (Array Int Int))) (let ((.cse34 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse22 .cse19 v_ArrVal_1347) .cse20 .cse38)) |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse36 (select .cse34 |c_~#queue~0.base|))) (let ((.cse37 (+ (* 4 (select .cse36 .cse3)) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1352 Int)) (let ((.cse35 (store .cse36 .cse37 v_ArrVal_1352))) (let ((.cse30 (select .cse35 .cse3))) (or (= 400 .cse30) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse32 (store (store .cse34 |c_~#queue~0.base| (store (store .cse35 .cse6 v_ArrVal_1354) .cse3 (+ .cse30 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse31 (select .cse32 |c_~#queue~0.base|))) (or (< (select .cse31 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ (* (select (select (store (store (store .cse32 |c_~#queue~0.base| (let ((.cse33 (store .cse31 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse33 .cse6 v_ArrVal_1361) .cse3 (+ (select .cse33 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse7)))))))))) (< .cse37 0)))))) (forall ((v_ArrVal_1347 Int) (v_ArrVal_1350 (Array Int Int))) (let ((.cse43 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse22 .cse19 v_ArrVal_1347) .cse20 .cse38)) |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse45 (select .cse43 |c_~#queue~0.base|))) (let ((.cse46 (+ (* 4 (select .cse45 .cse3)) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1352 Int)) (let ((.cse44 (store .cse45 .cse46 v_ArrVal_1352))) (let ((.cse39 (select .cse44 .cse3))) (or (= 400 .cse39) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse41 (store (store .cse43 |c_~#queue~0.base| (store (store .cse44 .cse6 v_ArrVal_1354) .cse3 (+ .cse39 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse40 (select .cse41 |c_~#queue~0.base|))) (or (< (select .cse40 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ (* (select (select (store (store (store .cse41 |c_~#queue~0.base| (let ((.cse42 (store .cse40 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse42 .cse6 v_ArrVal_1361) .cse3 (+ (select .cse42 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))))))))) (< .cse46 0)))))))) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse22 .cse19 v_ArrVal_1361) .cse20 .cse38)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse47 (store .cse22 .cse23 v_ArrVal_1358))) (store (store .cse47 .cse19 v_ArrVal_1361) .cse20 (+ (select .cse47 .cse20) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse7)) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse48 (store .cse22 .cse23 v_ArrVal_1358))) (store (store .cse48 .cse19 v_ArrVal_1361) .cse20 (+ (select .cse48 .cse20) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (<= (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse22 .cse19 v_ArrVal_1361) .cse20 .cse38)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse7)))))) is different from false [2023-08-30 02:20:40,549 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse50 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse48 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse127 (select .cse50 .cse48))) (let ((.cse33 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse9 (select |c_#length| |c_~#queue~0.base|)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse47 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse58 (+ .cse127 1))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse50 .cse48 .cse58))) (.cse51 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse81 (< (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 1612 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (.cse10 (= 400 .cse127)) (.cse57 (and (forall ((v_ArrVal_1347 Int) (v_ArrVal_1350 (Array Int Int))) (let ((.cse115 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse50 .cse47 v_ArrVal_1347) .cse48 .cse58)) |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse117 (select .cse115 |c_~#queue~0.base|))) (let ((.cse118 (+ (* 4 (select .cse117 .cse3)) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1352 Int)) (let ((.cse116 (store .cse117 .cse118 v_ArrVal_1352))) (let ((.cse111 (select .cse116 .cse3))) (or (= 400 .cse111) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse113 (store (store .cse115 |c_~#queue~0.base| (store (store .cse116 .cse2 v_ArrVal_1354) .cse3 (+ .cse111 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse112 (select .cse113 |c_~#queue~0.base|))) (or (< (select .cse112 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ (* (select (select (store (store (store .cse113 |c_~#queue~0.base| (let ((.cse114 (store .cse112 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse114 .cse2 v_ArrVal_1361) .cse3 (+ (select .cse114 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse9)))))))))) (< .cse118 0)))))) (forall ((v_ArrVal_1347 Int) (v_ArrVal_1350 (Array Int Int))) (let ((.cse123 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse50 .cse47 v_ArrVal_1347) .cse48 .cse58)) |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse125 (select .cse123 |c_~#queue~0.base|))) (let ((.cse126 (+ (* 4 (select .cse125 .cse3)) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1352 Int)) (let ((.cse124 (store .cse125 .cse126 v_ArrVal_1352))) (let ((.cse119 (select .cse124 .cse3))) (or (= 400 .cse119) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse121 (store (store .cse123 |c_~#queue~0.base| (store (store .cse124 .cse2 v_ArrVal_1354) .cse3 (+ .cse119 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse120 (select .cse121 |c_~#queue~0.base|))) (or (< (select .cse120 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ (* (select (select (store (store (store .cse121 |c_~#queue~0.base| (let ((.cse122 (store .cse120 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse122 .cse2 v_ArrVal_1361) .cse3 (+ (select .cse122 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))))))))) (< .cse126 0)))))))) (.cse39 (select .cse33 .cse3))) (and (or (and (forall ((v_ArrVal_1357 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse0 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ (* 4 (select (select (store (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse1 .cse2 v_ArrVal_1361) .cse3 (+ (select .cse1 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|))))) (forall ((v_ArrVal_1357 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse6 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ (* 4 (select (select (store (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse7 .cse2 v_ArrVal_1361) .cse3 (+ (select .cse7 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset| 4) .cse9)) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|)))))) .cse10) (or .cse10 (and (forall ((v_ArrVal_1350 (Array Int Int))) (let ((.cse14 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse17 (select .cse14 |c_~#queue~0.base|))) (let ((.cse18 (+ (* (select .cse17 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1352 Int)) (let ((.cse15 (store .cse17 .cse18 v_ArrVal_1352))) (let ((.cse16 (select .cse15 .cse3))) (or (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse2 v_ArrVal_1354) .cse3 (+ .cse16 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse11 (select .cse12 |c_~#queue~0.base|))) (or (< (select .cse11 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ (* (select (select (store (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse13 .cse2 v_ArrVal_1361) .cse3 (+ (select .cse13 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))))) (= 400 .cse16))))) (< .cse18 0)))))) (forall ((v_ArrVal_1350 (Array Int Int))) (let ((.cse22 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse25 (select .cse22 |c_~#queue~0.base|))) (let ((.cse26 (+ (* (select .cse25 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1352 Int)) (let ((.cse23 (store .cse25 .cse26 v_ArrVal_1352))) (let ((.cse24 (select .cse23 .cse3))) (or (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse20 (store (store .cse22 |c_~#queue~0.base| (store (store .cse23 .cse2 v_ArrVal_1354) .cse3 (+ .cse24 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse19 (select .cse20 |c_~#queue~0.base|))) (or (< (select .cse19 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ (* (select (select (store (store (store .cse20 |c_~#queue~0.base| (let ((.cse21 (store .cse19 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse21 .cse2 v_ArrVal_1361) .cse3 (+ (select .cse21 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse9)))))) (= 400 .cse24))))) (< .cse26 0)))))))) (let ((.cse27 (+ (* .cse39 4) |c_~#queue~0.offset|))) (or (< .cse27 0) (and (forall ((v_ArrVal_1352 Int)) (let ((.cse32 (store .cse33 .cse27 v_ArrVal_1352))) (let ((.cse28 (select .cse32 .cse3))) (or (= 400 .cse28) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse30 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse32 .cse2 v_ArrVal_1354) .cse3 (+ .cse28 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse29 (select .cse30 |c_~#queue~0.base|))) (or (< (select .cse29 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store .cse30 |c_~#queue~0.base| (let ((.cse31 (store .cse29 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse31 .cse2 v_ArrVal_1361) .cse3 (+ (select .cse31 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4)) .cse9)))))))))) (forall ((v_ArrVal_1352 Int)) (let ((.cse38 (store .cse33 .cse27 v_ArrVal_1352))) (let ((.cse34 (select .cse38 .cse3))) (or (= 400 .cse34) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse35 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse38 .cse2 v_ArrVal_1354) .cse3 (+ .cse34 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse37 (select .cse35 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse35 |c_~#queue~0.base| (let ((.cse36 (store .cse37 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse36 .cse2 v_ArrVal_1361) .cse3 (+ (select .cse36 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4)))) (< (select .cse37 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|)))))))))))) (forall ((v_ArrVal_1357 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse40 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse42 (select .cse40 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse40 |c_~#queue~0.base| (let ((.cse41 (store .cse42 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse41 .cse2 v_ArrVal_1361) .cse3 (+ (select .cse41 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4)))) (< (select .cse42 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|))))) (or (and (forall ((v_ArrVal_1352 Int)) (let ((.cse46 (store .cse50 .cse51 v_ArrVal_1352))) (let ((.cse49 (select .cse46 .cse48))) (or (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse44 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse46 .cse47 v_ArrVal_1354) .cse48 (+ .cse49 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse43 (select .cse44 |c_~#queue~0.base|))) (or (< (select .cse43 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store .cse44 |c_~#queue~0.base| (let ((.cse45 (store .cse43 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse45 .cse2 v_ArrVal_1361) .cse3 (+ (select .cse45 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4)) .cse9)))))) (= 400 .cse49))))) (forall ((v_ArrVal_1352 Int)) (let ((.cse55 (store .cse50 .cse51 v_ArrVal_1352))) (let ((.cse56 (select .cse55 .cse48))) (or (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse52 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse55 .cse47 v_ArrVal_1354) .cse48 (+ .cse56 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse54 (select .cse52 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse52 |c_~#queue~0.base| (let ((.cse53 (store .cse54 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse53 .cse2 v_ArrVal_1361) .cse3 (+ (select .cse53 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4)))) (< (select .cse54 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|))))) (= 400 .cse56)))))) (< .cse51 0)) (or .cse10 .cse57) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse50 .cse47 v_ArrVal_1361) .cse48 .cse58)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse59 (store .cse50 .cse51 v_ArrVal_1358))) (store (store .cse59 .cse47 v_ArrVal_1361) .cse48 (+ (select .cse59 .cse48) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse9)) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse60 (store .cse50 .cse51 v_ArrVal_1358))) (store (store .cse60 .cse47 v_ArrVal_1361) .cse48 (+ (select .cse60 .cse48) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (or (and (forall ((v_ArrVal_1345 Int)) (let ((.cse69 (store .cse50 .cse51 v_ArrVal_1345))) (let ((.cse70 (select .cse69 .cse48))) (or (forall ((v_ArrVal_1347 Int) (v_ArrVal_1350 (Array Int Int))) (let ((.cse65 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse69 .cse47 v_ArrVal_1347) .cse48 (+ .cse70 1))) |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse68 (select .cse65 |c_~#queue~0.base|))) (let ((.cse61 (+ |c_~#queue~0.offset| (* (select .cse68 .cse3) 4)))) (or (< .cse61 0) (forall ((v_ArrVal_1352 Int)) (let ((.cse66 (store .cse68 .cse61 v_ArrVal_1352))) (let ((.cse67 (select .cse66 .cse3))) (or (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse63 (store (store .cse65 |c_~#queue~0.base| (store (store .cse66 .cse2 v_ArrVal_1354) .cse3 (+ .cse67 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse62 (select .cse63 |c_~#queue~0.base|))) (or (< (select .cse62 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ (* (select (select (store (store (store .cse63 |c_~#queue~0.base| (let ((.cse64 (store .cse62 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse64 .cse2 v_ArrVal_1361) .cse3 (+ (select .cse64 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))))) (= 400 .cse67)))))))))) (= 400 .cse70))))) (forall ((v_ArrVal_1345 Int)) (let ((.cse80 (store .cse50 .cse51 v_ArrVal_1345))) (let ((.cse71 (select .cse80 .cse48))) (or (= 400 .cse71) (forall ((v_ArrVal_1347 Int) (v_ArrVal_1350 (Array Int Int))) (let ((.cse75 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse80 .cse47 v_ArrVal_1347) .cse48 (+ .cse71 1))) |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse78 (select .cse75 |c_~#queue~0.base|))) (let ((.cse79 (+ |c_~#queue~0.offset| (* (select .cse78 .cse3) 4)))) (or (forall ((v_ArrVal_1352 Int)) (let ((.cse76 (store .cse78 .cse79 v_ArrVal_1352))) (let ((.cse77 (select .cse76 .cse3))) (or (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse73 (store (store .cse75 |c_~#queue~0.base| (store (store .cse76 .cse2 v_ArrVal_1354) .cse3 (+ .cse77 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse72 (select .cse73 |c_~#queue~0.base|))) (or (< (select .cse72 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ (* (select (select (store (store (store .cse73 |c_~#queue~0.base| (let ((.cse74 (store .cse72 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse74 .cse2 v_ArrVal_1361) .cse3 (+ (select .cse74 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse9)))))) (= 400 .cse77))))) (< .cse79 0))))))))))) .cse81) (or .cse10 (and (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse82 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse50 .cse47 v_ArrVal_1354) .cse48 .cse58)) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse84 (select .cse82 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ (* (select (select (store (store (store .cse82 |c_~#queue~0.base| (let ((.cse83 (store .cse84 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse83 .cse2 v_ArrVal_1361) .cse3 (+ (select .cse83 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse9)) (< (select .cse84 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|))))) (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse86 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse50 .cse47 v_ArrVal_1354) .cse48 .cse58)) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse85 (select .cse86 |c_~#queue~0.base|))) (or (< (select .cse85 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ (* (select (select (store (store (store .cse86 |c_~#queue~0.base| (let ((.cse87 (store .cse85 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse87 .cse2 v_ArrVal_1361) .cse3 (+ (select .cse87 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))))))) (or .cse81 .cse10 .cse57) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (<= (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse50 .cse47 v_ArrVal_1361) .cse48 .cse58)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse9)) (forall ((v_ArrVal_1357 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse88 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse90 (select .cse88 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse88 |c_~#queue~0.base| (let ((.cse89 (store .cse90 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse89 .cse2 v_ArrVal_1361) .cse3 (+ (select .cse89 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) 4) .cse9)) (< (select .cse90 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|))))) (or (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_122| Int)) (or (< .cse39 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_122|) (forall ((v_ArrVal_1345 Int)) (let ((.cse99 (store .cse33 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_122| 4) |c_~#queue~0.offset|) v_ArrVal_1345))) (let ((.cse100 (select .cse99 .cse3))) (or (forall ((v_ArrVal_1347 Int) (v_ArrVal_1350 (Array Int Int))) (let ((.cse94 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse99 .cse2 v_ArrVal_1347) .cse3 (+ .cse100 1))) |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse97 (select .cse94 |c_~#queue~0.base|))) (let ((.cse98 (+ (* (select .cse97 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1352 Int)) (let ((.cse95 (store .cse97 .cse98 v_ArrVal_1352))) (let ((.cse96 (select .cse95 .cse3))) (or (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse92 (store (store .cse94 |c_~#queue~0.base| (store (store .cse95 .cse2 v_ArrVal_1354) .cse3 (+ .cse96 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse91 (select .cse92 |c_~#queue~0.base|))) (or (< (select .cse91 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse92 |c_~#queue~0.base| (let ((.cse93 (store .cse91 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse93 .cse2 v_ArrVal_1361) .cse3 (+ (select .cse93 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4)))))))) (= 400 .cse96))))) (< .cse98 0)))))) (= 400 .cse100))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_122| Int)) (or (< .cse39 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_122|) (forall ((v_ArrVal_1345 Int)) (let ((.cse109 (store .cse33 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_122| 4) |c_~#queue~0.offset|) v_ArrVal_1345))) (let ((.cse110 (select .cse109 .cse3))) (or (forall ((v_ArrVal_1347 Int) (v_ArrVal_1350 (Array Int Int))) (let ((.cse104 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse109 .cse2 v_ArrVal_1347) .cse3 (+ .cse110 1))) |c_~#stored_elements~0.base| v_ArrVal_1350))) (let ((.cse107 (select .cse104 |c_~#queue~0.base|))) (let ((.cse108 (+ (* (select .cse107 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1352 Int)) (let ((.cse105 (store .cse107 .cse108 v_ArrVal_1352))) (let ((.cse106 (select .cse105 .cse3))) (or (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse102 (store (store .cse104 |c_~#queue~0.base| (store (store .cse105 .cse2 v_ArrVal_1354) .cse3 (+ .cse106 1))) |c_~#stored_elements~0.base| v_ArrVal_1357))) (let ((.cse101 (select .cse102 |c_~#queue~0.base|))) (or (< (select .cse101 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1361 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1358 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse102 |c_~#queue~0.base| (let ((.cse103 (store .cse101 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1358))) (store (store .cse103 .cse2 v_ArrVal_1361) .cse3 (+ (select .cse103 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1364) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse3) 4) 4) .cse9)))))) (= 400 .cse106))))) (< .cse108 0)))))) (= 400 .cse110)))))))) (< .cse9 (+ |c_~#queue~0.offset| 1612)))))))) is different from false [2023-08-30 02:20:42,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:20:44,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:20:47,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:20:49,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15