./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread/queue_ok.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --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.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 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 22:07:34,252 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 22:07:34,253 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 22:07:34,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 22:07:34,286 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 22:07:34,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 22:07:34,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 22:07:34,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 22:07:34,293 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 22:07:34,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 22:07:34,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 22:07:34,300 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 22:07:34,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 22:07:34,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 22:07:34,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 22:07:34,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 22:07:34,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 22:07:34,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 22:07:34,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 22:07:34,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 22:07:34,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 22:07:34,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 22:07:34,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 22:07:34,323 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 22:07:34,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 22:07:34,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 22:07:34,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 22:07:34,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 22:07:34,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 22:07:34,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 22:07:34,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 22:07:34,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 22:07:34,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 22:07:34,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 22:07:34,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 22:07:34,334 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 22:07:34,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 22:07:34,335 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 22:07:34,335 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 22:07:34,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 22:07:34,336 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 22:07:34,337 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 22:07:34,358 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 22:07:34,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 22:07:34,359 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 22:07:34,359 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 22:07:34,360 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 22:07:34,360 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 22:07:34,360 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 22:07:34,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 22:07:34,360 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 22:07:34,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 22:07:34,361 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 22:07:34,361 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 22:07:34,361 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 22:07:34,362 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 22:07:34,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 22:07:34,362 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 22:07:34,362 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 22:07:34,362 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 22:07:34,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 22:07:34,362 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 22:07:34,363 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 22:07:34,363 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 22:07:34,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 22:07:34,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 22:07:34,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 22:07:34,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 22:07:34,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 22:07:34,364 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 22:07:34,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 22:07:34,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 22:07:34,364 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 22:07:34,364 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 22:07:34,364 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 22:07:34,365 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 22:07:34,365 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 -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 22:07:34,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 22:07:34,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 22:07:34,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 22:07:34,592 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 22:07:34,592 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 22:07:34,593 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2023-08-31 22:07:35,544 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 22:07:35,754 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 22:07:35,755 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2023-08-31 22:07:35,766 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b89cff45a/4ea1f312af4f45feb9646cf2d5d4d9cd/FLAG8f6bc0db4 [2023-08-31 22:07:35,781 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b89cff45a/4ea1f312af4f45feb9646cf2d5d4d9cd [2023-08-31 22:07:35,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 22:07:35,787 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 22:07:35,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 22:07:35,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 22:07:35,791 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 22:07:35,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 10:07:35" (1/1) ... [2023-08-31 22:07:35,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a4b870c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:35, skipping insertion in model container [2023-08-31 22:07:35,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 10:07:35" (1/1) ... [2023-08-31 22:07:35,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 22:07:35,854 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 22:07:36,132 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.i[43266,43279] [2023-08-31 22:07:36,138 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.i[43543,43556] [2023-08-31 22:07:36,141 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 22:07:36,150 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 22:07:36,195 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.i[43266,43279] [2023-08-31 22:07:36,202 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.i[43543,43556] [2023-08-31 22:07:36,204 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 22:07:36,247 INFO L208 MainTranslator]: Completed translation [2023-08-31 22:07:36,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36 WrapperNode [2023-08-31 22:07:36,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 22:07:36,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 22:07:36,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 22:07:36,249 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 22:07:36,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,288 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2023-08-31 22:07:36,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 22:07:36,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 22:07:36,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 22:07:36,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 22:07:36,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,308 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 22:07:36,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 22:07:36,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 22:07:36,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 22:07:36,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 22:07:36,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:07:36,350 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-31 22:07:36,353 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-31 22:07:36,376 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-31 22:07:36,376 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-31 22:07:36,377 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-31 22:07:36,377 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-31 22:07:36,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 22:07:36,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 22:07:36,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 22:07:36,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 22:07:36,377 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-31 22:07:36,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 22:07:36,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 22:07:36,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 22:07:36,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 22:07:36,379 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 22:07:36,528 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 22:07:36,530 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 22:07:36,806 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 22:07:36,817 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 22:07:36,817 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-31 22:07:36,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 10:07:36 BoogieIcfgContainer [2023-08-31 22:07:36,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 22:07:36,821 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 22:07:36,821 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 22:07:36,823 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 22:07:36,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 10:07:35" (1/3) ... [2023-08-31 22:07:36,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1773ab63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 10:07:36, skipping insertion in model container [2023-08-31 22:07:36,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36" (2/3) ... [2023-08-31 22:07:36,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1773ab63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 10:07:36, skipping insertion in model container [2023-08-31 22:07:36,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 10:07:36" (3/3) ... [2023-08-31 22:07:36,826 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-08-31 22:07:36,837 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 22:07:36,838 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2023-08-31 22:07:36,838 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 22:07:36,960 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-31 22:07:36,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 278 transitions, 572 flow [2023-08-31 22:07:37,086 INFO L130 PetriNetUnfolder]: 13/276 cut-off events. [2023-08-31 22:07:37,087 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 22:07:37,093 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-31 22:07:37,094 INFO L82 GeneralOperation]: Start removeDead. Operand has 272 places, 278 transitions, 572 flow [2023-08-31 22:07:37,103 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 266 places, 272 transitions, 556 flow [2023-08-31 22:07:37,105 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 22:07:37,117 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 266 places, 272 transitions, 556 flow [2023-08-31 22:07:37,118 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 266 places, 272 transitions, 556 flow [2023-08-31 22:07:37,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 272 transitions, 556 flow [2023-08-31 22:07:37,159 INFO L130 PetriNetUnfolder]: 13/272 cut-off events. [2023-08-31 22:07:37,160 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 22:07:37,163 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-31 22:07:37,176 INFO L119 LiptonReduction]: Number of co-enabled transitions 17820 [2023-08-31 22:07:48,343 INFO L134 LiptonReduction]: Checked pairs total: 64286 [2023-08-31 22:07:48,343 INFO L136 LiptonReduction]: Total number of compositions: 358 [2023-08-31 22:07:48,358 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 22:07:48,363 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;@25f7805b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 22:07:48,363 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2023-08-31 22:07:48,365 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 22:07:48,365 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 22:07:48,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:48,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 22:07:48,366 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-31 22:07:48,369 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:48,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1161, now seen corresponding path program 1 times [2023-08-31 22:07:48,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:48,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389389584] [2023-08-31 22:07:48,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:48,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:48,451 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-31 22:07:48,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:48,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389389584] [2023-08-31 22:07:48,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389389584] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:48,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:48,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 22:07:48,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016711451] [2023-08-31 22:07:48,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:48,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 22:07:48,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:48,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 22:07:48,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 22:07:48,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 636 [2023-08-31 22:07:48,486 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-31 22:07:48,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:48,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 636 [2023-08-31 22:07:48,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:48,940 INFO L130 PetriNetUnfolder]: 3797/6059 cut-off events. [2023-08-31 22:07:48,940 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2023-08-31 22:07:48,944 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-31 22:07:48,962 INFO L137 encePairwiseOnDemand]: 600/636 looper letters, 61 selfloop transitions, 0 changer transitions 0/70 dead transitions. [2023-08-31 22:07:48,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 70 transitions, 274 flow [2023-08-31 22:07:48,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 22:07:48,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 22:07:48,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 631 transitions. [2023-08-31 22:07:48,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4960691823899371 [2023-08-31 22:07:48,977 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 631 transitions. [2023-08-31 22:07:48,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 631 transitions. [2023-08-31 22:07:48,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:48,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 631 transitions. [2023-08-31 22:07:48,985 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-31 22:07:48,989 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-31 22:07:48,990 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-31 22:07:48,991 INFO L175 Difference]: Start difference. First operand has 106 places, 106 transitions, 224 flow. Second operand 2 states and 631 transitions. [2023-08-31 22:07:48,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 70 transitions, 274 flow [2023-08-31 22:07:48,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 70 transitions, 266 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 22:07:48,998 INFO L231 Difference]: Finished difference. Result has 67 places, 70 transitions, 144 flow [2023-08-31 22:07:49,000 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-31 22:07:49,003 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -39 predicate places. [2023-08-31 22:07:49,003 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 144 flow [2023-08-31 22:07:49,004 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-31 22:07:49,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:49,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 22:07:49,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 22:07:49,005 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-31 22:07:49,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:49,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1154497, now seen corresponding path program 1 times [2023-08-31 22:07:49,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:49,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117704297] [2023-08-31 22:07:49,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:49,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:49,210 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-31 22:07:49,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:49,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117704297] [2023-08-31 22:07:49,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117704297] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:49,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:49,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 22:07:49,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57875079] [2023-08-31 22:07:49,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:49,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:07:49,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:49,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:07:49,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:07:49,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 636 [2023-08-31 22:07:49,369 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-31 22:07:49,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:49,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 636 [2023-08-31 22:07:49,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:49,756 INFO L130 PetriNetUnfolder]: 3749/5963 cut-off events. [2023-08-31 22:07:49,756 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-31 22:07:49,759 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-31 22:07:49,779 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 57 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-08-31 22:07:49,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 258 flow [2023-08-31 22:07:49,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:07:49,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:07:49,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 835 transitions. [2023-08-31 22:07:49,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43763102725366876 [2023-08-31 22:07:49,782 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 835 transitions. [2023-08-31 22:07:49,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 835 transitions. [2023-08-31 22:07:49,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:49,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 835 transitions. [2023-08-31 22:07:49,784 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-31 22:07:49,786 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-31 22:07:49,787 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-31 22:07:49,787 INFO L175 Difference]: Start difference. First operand has 67 places, 70 transitions, 144 flow. Second operand 3 states and 835 transitions. [2023-08-31 22:07:49,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 258 flow [2023-08-31 22:07:49,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 68 transitions, 258 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 22:07:49,790 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 144 flow [2023-08-31 22:07:49,790 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-31 22:07:49,791 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -39 predicate places. [2023-08-31 22:07:49,791 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 144 flow [2023-08-31 22:07:49,791 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-31 22:07:49,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:49,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 22:07:49,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 22:07:49,792 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-31 22:07:49,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:49,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1154498, now seen corresponding path program 1 times [2023-08-31 22:07:49,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:49,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331541106] [2023-08-31 22:07:49,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:49,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:49,858 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-31 22:07:49,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:49,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331541106] [2023-08-31 22:07:49,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331541106] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:49,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:49,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 22:07:49,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523692635] [2023-08-31 22:07:49,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:49,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:07:49,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:49,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:07:49,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:07:49,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-31 22:07:49,952 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-31 22:07:49,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:49,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-31 22:07:49,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:50,322 INFO L130 PetriNetUnfolder]: 3701/5867 cut-off events. [2023-08-31 22:07:50,322 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-31 22:07:50,326 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-31 22:07:50,340 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 55 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-31 22:07:50,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 66 transitions, 254 flow [2023-08-31 22:07:50,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:07:50,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:07:50,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 845 transitions. [2023-08-31 22:07:50,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44287211740041926 [2023-08-31 22:07:50,342 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 845 transitions. [2023-08-31 22:07:50,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 845 transitions. [2023-08-31 22:07:50,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:50,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 845 transitions. [2023-08-31 22:07:50,344 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-31 22:07:50,347 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-31 22:07:50,347 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-31 22:07:50,347 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 144 flow. Second operand 3 states and 845 transitions. [2023-08-31 22:07:50,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 66 transitions, 254 flow [2023-08-31 22:07:50,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 66 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 22:07:50,349 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 140 flow [2023-08-31 22:07:50,349 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-31 22:07:50,350 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -41 predicate places. [2023-08-31 22:07:50,350 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 140 flow [2023-08-31 22:07:50,350 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-31 22:07:50,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:50,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 22:07:50,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 22:07:50,351 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-31 22:07:50,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:50,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1109496233, now seen corresponding path program 1 times [2023-08-31 22:07:50,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:50,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558130684] [2023-08-31 22:07:50,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:50,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:50,607 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-31 22:07:50,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:50,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558130684] [2023-08-31 22:07:50,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558130684] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:50,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:50,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 22:07:50,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098314378] [2023-08-31 22:07:50,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:50,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:07:50,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:50,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:07:50,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:07:50,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 636 [2023-08-31 22:07:50,716 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-31 22:07:50,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:50,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 636 [2023-08-31 22:07:50,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:51,134 INFO L130 PetriNetUnfolder]: 3800/6080 cut-off events. [2023-08-31 22:07:51,137 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-31 22:07:51,142 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-31 22:07:51,178 INFO L137 encePairwiseOnDemand]: 630/636 looper letters, 63 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2023-08-31 22:07:51,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 75 transitions, 292 flow [2023-08-31 22:07:51,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:07:51,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:07:51,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 831 transitions. [2023-08-31 22:07:51,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43553459119496857 [2023-08-31 22:07:51,181 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 831 transitions. [2023-08-31 22:07:51,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 831 transitions. [2023-08-31 22:07:51,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:51,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 831 transitions. [2023-08-31 22:07:51,185 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-31 22:07:51,187 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-31 22:07:51,188 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-31 22:07:51,188 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 140 flow. Second operand 3 states and 831 transitions. [2023-08-31 22:07:51,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 75 transitions, 292 flow [2023-08-31 22:07:51,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 75 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 22:07:51,192 INFO L231 Difference]: Finished difference. Result has 66 places, 69 transitions, 164 flow [2023-08-31 22:07:51,192 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-31 22:07:51,193 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -40 predicate places. [2023-08-31 22:07:51,193 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 69 transitions, 164 flow [2023-08-31 22:07:51,193 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-31 22:07:51,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:51,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 22:07:51,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 22:07:51,194 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-31 22:07:51,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:51,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1109496236, now seen corresponding path program 1 times [2023-08-31 22:07:51,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:51,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933171996] [2023-08-31 22:07:51,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:51,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:51,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-31 22:07:51,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:51,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933171996] [2023-08-31 22:07:51,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933171996] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:51,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:51,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 22:07:51,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145125489] [2023-08-31 22:07:51,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:51,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:07:51,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:51,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:07:51,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:07:51,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 636 [2023-08-31 22:07:51,347 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-31 22:07:51,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:51,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 636 [2023-08-31 22:07:51,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:51,634 INFO L130 PetriNetUnfolder]: 3253/5163 cut-off events. [2023-08-31 22:07:51,635 INFO L131 PetriNetUnfolder]: For 213/296 co-relation queries the response was YES. [2023-08-31 22:07:51,638 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-31 22:07:51,652 INFO L137 encePairwiseOnDemand]: 631/636 looper letters, 54 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-31 22:07:51,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 66 transitions, 270 flow [2023-08-31 22:07:51,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:07:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:07:51,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 849 transitions. [2023-08-31 22:07:51,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4449685534591195 [2023-08-31 22:07:51,655 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 849 transitions. [2023-08-31 22:07:51,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 849 transitions. [2023-08-31 22:07:51,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:51,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 849 transitions. [2023-08-31 22:07:51,657 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-31 22:07:51,659 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-31 22:07:51,660 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-31 22:07:51,660 INFO L175 Difference]: Start difference. First operand has 66 places, 69 transitions, 164 flow. Second operand 3 states and 849 transitions. [2023-08-31 22:07:51,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 66 transitions, 270 flow [2023-08-31 22:07:51,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 22:07:51,661 INFO L231 Difference]: Finished difference. Result has 64 places, 66 transitions, 158 flow [2023-08-31 22:07:51,661 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-31 22:07:51,662 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -42 predicate places. [2023-08-31 22:07:51,662 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 158 flow [2023-08-31 22:07:51,663 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-31 22:07:51,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:51,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 22:07:51,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 22:07:51,663 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-31 22:07:51,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:51,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1109495978, now seen corresponding path program 1 times [2023-08-31 22:07:51,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:51,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599818013] [2023-08-31 22:07:51,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:51,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:51,708 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-31 22:07:51,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:51,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599818013] [2023-08-31 22:07:51,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599818013] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:51,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:51,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 22:07:51,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534392908] [2023-08-31 22:07:51,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:51,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:07:51,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:51,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:07:51,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:07:51,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-31 22:07:51,793 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-31 22:07:51,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:51,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-31 22:07:51,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:52,002 INFO L130 PetriNetUnfolder]: 2363/3821 cut-off events. [2023-08-31 22:07:52,002 INFO L131 PetriNetUnfolder]: For 169/231 co-relation queries the response was YES. [2023-08-31 22:07:52,005 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-31 22:07:52,015 INFO L137 encePairwiseOnDemand]: 633/636 looper letters, 53 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-08-31 22:07:52,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 266 flow [2023-08-31 22:07:52,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:07:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:07:52,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 840 transitions. [2023-08-31 22:07:52,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44025157232704404 [2023-08-31 22:07:52,018 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 840 transitions. [2023-08-31 22:07:52,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 840 transitions. [2023-08-31 22:07:52,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:52,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 840 transitions. [2023-08-31 22:07:52,019 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-31 22:07:52,022 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-31 22:07:52,022 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-31 22:07:52,023 INFO L175 Difference]: Start difference. First operand has 64 places, 66 transitions, 158 flow. Second operand 3 states and 840 transitions. [2023-08-31 22:07:52,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 266 flow [2023-08-31 22:07:52,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 65 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 22:07:52,024 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 156 flow [2023-08-31 22:07:52,024 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-31 22:07:52,025 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-08-31 22:07:52,025 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 156 flow [2023-08-31 22:07:52,025 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-31 22:07:52,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:52,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 22:07:52,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 22:07:52,026 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-31 22:07:52,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:52,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1109495977, now seen corresponding path program 1 times [2023-08-31 22:07:52,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:52,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641882307] [2023-08-31 22:07:52,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:52,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:52,081 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-31 22:07:52,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:52,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641882307] [2023-08-31 22:07:52,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641882307] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:52,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:52,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 22:07:52,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271997431] [2023-08-31 22:07:52,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:52,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 22:07:52,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:52,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 22:07:52,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 22:07:52,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 636 [2023-08-31 22:07:52,229 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-31 22:07:52,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:52,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 636 [2023-08-31 22:07:52,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:52,387 INFO L130 PetriNetUnfolder]: 1473/2479 cut-off events. [2023-08-31 22:07:52,388 INFO L131 PetriNetUnfolder]: For 125/166 co-relation queries the response was YES. [2023-08-31 22:07:52,390 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-31 22:07:52,395 INFO L137 encePairwiseOnDemand]: 633/636 looper letters, 52 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-08-31 22:07:52,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 64 transitions, 262 flow [2023-08-31 22:07:52,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:07:52,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:07:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 815 transitions. [2023-08-31 22:07:52,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4271488469601677 [2023-08-31 22:07:52,398 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 815 transitions. [2023-08-31 22:07:52,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 815 transitions. [2023-08-31 22:07:52,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:52,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 815 transitions. [2023-08-31 22:07:52,400 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-31 22:07:52,402 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-31 22:07:52,403 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-31 22:07:52,404 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 156 flow. Second operand 3 states and 815 transitions. [2023-08-31 22:07:52,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 64 transitions, 262 flow [2023-08-31 22:07:52,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 64 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 22:07:52,405 INFO L231 Difference]: Finished difference. Result has 62 places, 64 transitions, 154 flow [2023-08-31 22:07:52,406 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-31 22:07:52,406 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -44 predicate places. [2023-08-31 22:07:52,406 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 64 transitions, 154 flow [2023-08-31 22:07:52,407 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-31 22:07:52,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:52,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-31 22:07:52,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 22:07:52,407 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-31 22:07:52,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:52,408 INFO L85 PathProgramCache]: Analyzing trace with hash 34798183, now seen corresponding path program 1 times [2023-08-31 22:07:52,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:52,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837642493] [2023-08-31 22:07:52,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:52,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:52,952 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-31 22:07:52,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:52,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837642493] [2023-08-31 22:07:52,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837642493] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:52,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:52,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 22:07:52,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994010322] [2023-08-31 22:07:52,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:52,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 22:07:52,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:52,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 22:07:52,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 22:07:53,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 636 [2023-08-31 22:07:53,705 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-31 22:07:53,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:53,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 636 [2023-08-31 22:07:53,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:54,241 INFO L130 PetriNetUnfolder]: 1853/3134 cut-off events. [2023-08-31 22:07:54,241 INFO L131 PetriNetUnfolder]: For 123/123 co-relation queries the response was YES. [2023-08-31 22:07:54,244 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-31 22:07:54,274 INFO L137 encePairwiseOnDemand]: 625/636 looper letters, 75 selfloop transitions, 8 changer transitions 0/91 dead transitions. [2023-08-31 22:07:54,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 91 transitions, 383 flow [2023-08-31 22:07:54,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 22:07:54,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 22:07:54,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1094 transitions. [2023-08-31 22:07:54,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4300314465408805 [2023-08-31 22:07:54,277 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1094 transitions. [2023-08-31 22:07:54,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1094 transitions. [2023-08-31 22:07:54,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:54,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1094 transitions. [2023-08-31 22:07:54,282 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-31 22:07:54,284 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-31 22:07:54,285 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-31 22:07:54,285 INFO L175 Difference]: Start difference. First operand has 62 places, 64 transitions, 154 flow. Second operand 4 states and 1094 transitions. [2023-08-31 22:07:54,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 91 transitions, 383 flow [2023-08-31 22:07:54,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 91 transitions, 377 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 22:07:54,288 INFO L231 Difference]: Finished difference. Result has 64 places, 69 transitions, 208 flow [2023-08-31 22:07:54,288 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-31 22:07:54,290 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -42 predicate places. [2023-08-31 22:07:54,290 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 69 transitions, 208 flow [2023-08-31 22:07:54,290 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-31 22:07:54,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:54,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-31 22:07:54,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 22:07:54,291 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-31 22:07:54,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:54,291 INFO L85 PathProgramCache]: Analyzing trace with hash 34645865, now seen corresponding path program 1 times [2023-08-31 22:07:54,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:54,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118467429] [2023-08-31 22:07:54,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:54,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:54,374 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-31 22:07:54,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:54,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118467429] [2023-08-31 22:07:54,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118467429] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:54,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:54,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 22:07:54,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006346762] [2023-08-31 22:07:54,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:54,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 22:07:54,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:54,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 22:07:54,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 22:07:54,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 636 [2023-08-31 22:07:54,553 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-31 22:07:54,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:54,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 636 [2023-08-31 22:07:54,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:54,822 INFO L130 PetriNetUnfolder]: 1643/2806 cut-off events. [2023-08-31 22:07:54,822 INFO L131 PetriNetUnfolder]: For 423/423 co-relation queries the response was YES. [2023-08-31 22:07:54,825 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-31 22:07:54,832 INFO L137 encePairwiseOnDemand]: 627/636 looper letters, 81 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2023-08-31 22:07:54,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 95 transitions, 425 flow [2023-08-31 22:07:54,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 22:07:54,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 22:07:54,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1108 transitions. [2023-08-31 22:07:54,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43553459119496857 [2023-08-31 22:07:54,835 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1108 transitions. [2023-08-31 22:07:54,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1108 transitions. [2023-08-31 22:07:54,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:54,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1108 transitions. [2023-08-31 22:07:54,837 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-31 22:07:54,840 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-31 22:07:54,840 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-31 22:07:54,840 INFO L175 Difference]: Start difference. First operand has 64 places, 69 transitions, 208 flow. Second operand 4 states and 1108 transitions. [2023-08-31 22:07:54,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 95 transitions, 425 flow [2023-08-31 22:07:54,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 95 transitions, 418 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 22:07:54,843 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 184 flow [2023-08-31 22:07:54,843 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-31 22:07:54,843 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -45 predicate places. [2023-08-31 22:07:54,843 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 184 flow [2023-08-31 22:07:54,844 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-31 22:07:54,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:54,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:54,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 22:07:54,844 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-31 22:07:54,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:54,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1100843232, now seen corresponding path program 1 times [2023-08-31 22:07:54,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:54,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99161553] [2023-08-31 22:07:54,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:54,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:54,879 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-31 22:07:54,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:54,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99161553] [2023-08-31 22:07:54,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99161553] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:54,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:54,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 22:07:54,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832842013] [2023-08-31 22:07:54,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:54,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:07:54,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:54,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:07:54,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:07:54,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-31 22:07:54,887 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-31 22:07:54,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:54,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-31 22:07:54,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:54,999 INFO L130 PetriNetUnfolder]: 533/1074 cut-off events. [2023-08-31 22:07:54,999 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2023-08-31 22:07:55,000 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-31 22:07:55,003 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 61 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2023-08-31 22:07:55,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 339 flow [2023-08-31 22:07:55,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:07:55,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:07:55,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 844 transitions. [2023-08-31 22:07:55,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44234800838574423 [2023-08-31 22:07:55,005 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 844 transitions. [2023-08-31 22:07:55,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 844 transitions. [2023-08-31 22:07:55,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:55,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 844 transitions. [2023-08-31 22:07:55,007 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-31 22:07:55,009 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-31 22:07:55,009 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-31 22:07:55,010 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 184 flow. Second operand 3 states and 844 transitions. [2023-08-31 22:07:55,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 339 flow [2023-08-31 22:07:55,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 74 transitions, 338 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 22:07:55,012 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 185 flow [2023-08-31 22:07:55,012 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-31 22:07:55,012 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-08-31 22:07:55,012 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 185 flow [2023-08-31 22:07:55,013 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-31 22:07:55,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:55,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:55,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 22:07:55,013 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-31 22:07:55,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:55,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1760781159, now seen corresponding path program 1 times [2023-08-31 22:07:55,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:55,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213739051] [2023-08-31 22:07:55,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:55,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:55,083 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-31 22:07:55,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:55,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213739051] [2023-08-31 22:07:55,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213739051] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:55,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:55,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 22:07:55,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851009352] [2023-08-31 22:07:55,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:55,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:07:55,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:55,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:07:55,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:07:55,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 636 [2023-08-31 22:07:55,174 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-31 22:07:55,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:55,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 636 [2023-08-31 22:07:55,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:55,278 INFO L130 PetriNetUnfolder]: 506/1041 cut-off events. [2023-08-31 22:07:55,278 INFO L131 PetriNetUnfolder]: For 131/133 co-relation queries the response was YES. [2023-08-31 22:07:55,280 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-31 22:07:55,282 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 47 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2023-08-31 22:07:55,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 281 flow [2023-08-31 22:07:55,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:07:55,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:07:55,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 827 transitions. [2023-08-31 22:07:55,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4334381551362683 [2023-08-31 22:07:55,285 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 827 transitions. [2023-08-31 22:07:55,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 827 transitions. [2023-08-31 22:07:55,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:55,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 827 transitions. [2023-08-31 22:07:55,286 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-31 22:07:55,288 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-31 22:07:55,289 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-31 22:07:55,289 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 185 flow. Second operand 3 states and 827 transitions. [2023-08-31 22:07:55,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 281 flow [2023-08-31 22:07:55,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 275 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 22:07:55,291 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 181 flow [2023-08-31 22:07:55,291 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-31 22:07:55,291 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -45 predicate places. [2023-08-31 22:07:55,291 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 181 flow [2023-08-31 22:07:55,292 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-31 22:07:55,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:55,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:55,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 22:07:55,292 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-31 22:07:55,293 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:55,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1760781158, now seen corresponding path program 1 times [2023-08-31 22:07:55,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:55,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144179401] [2023-08-31 22:07:55,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:55,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:55,386 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-31 22:07:55,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:55,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144179401] [2023-08-31 22:07:55,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144179401] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:55,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:55,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 22:07:55,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109457770] [2023-08-31 22:07:55,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:55,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 22:07:55,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:55,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 22:07:55,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 22:07:55,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 636 [2023-08-31 22:07:55,535 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-31 22:07:55,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:55,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 636 [2023-08-31 22:07:55,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:55,634 INFO L130 PetriNetUnfolder]: 354/719 cut-off events. [2023-08-31 22:07:55,634 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2023-08-31 22:07:55,635 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-31 22:07:55,636 INFO L137 encePairwiseOnDemand]: 631/636 looper letters, 59 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2023-08-31 22:07:55,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 72 transitions, 330 flow [2023-08-31 22:07:55,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 22:07:55,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 22:07:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1105 transitions. [2023-08-31 22:07:55,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4343553459119497 [2023-08-31 22:07:55,638 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1105 transitions. [2023-08-31 22:07:55,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1105 transitions. [2023-08-31 22:07:55,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:55,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1105 transitions. [2023-08-31 22:07:55,641 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-31 22:07:55,643 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-31 22:07:55,643 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-31 22:07:55,643 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 181 flow. Second operand 4 states and 1105 transitions. [2023-08-31 22:07:55,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 72 transitions, 330 flow [2023-08-31 22:07:55,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 320 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-31 22:07:55,645 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 179 flow [2023-08-31 22:07:55,645 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-31 22:07:55,646 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-08-31 22:07:55,646 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 179 flow [2023-08-31 22:07:55,646 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-31 22:07:55,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:55,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:55,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 22:07:55,646 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-31 22:07:55,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:55,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1250363540, now seen corresponding path program 1 times [2023-08-31 22:07:55,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:55,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076317602] [2023-08-31 22:07:55,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:55,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:56,019 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-31 22:07:56,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:56,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076317602] [2023-08-31 22:07:56,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076317602] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:56,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:56,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 22:07:56,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165615356] [2023-08-31 22:07:56,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:56,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 22:07:56,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:56,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 22:07:56,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 22:07:56,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 636 [2023-08-31 22:07:56,157 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-31 22:07:56,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:56,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 636 [2023-08-31 22:07:56,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:56,271 INFO L130 PetriNetUnfolder]: 368/732 cut-off events. [2023-08-31 22:07:56,271 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2023-08-31 22:07:56,272 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-31 22:07:56,273 INFO L137 encePairwiseOnDemand]: 629/636 looper letters, 55 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2023-08-31 22:07:56,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 71 transitions, 343 flow [2023-08-31 22:07:56,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 22:07:56,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 22:07:56,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1567 transitions. [2023-08-31 22:07:56,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4106394129979036 [2023-08-31 22:07:56,277 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1567 transitions. [2023-08-31 22:07:56,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1567 transitions. [2023-08-31 22:07:56,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:56,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1567 transitions. [2023-08-31 22:07:56,279 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-31 22:07:56,283 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-31 22:07:56,283 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-31 22:07:56,283 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 179 flow. Second operand 6 states and 1567 transitions. [2023-08-31 22:07:56,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 71 transitions, 343 flow [2023-08-31 22:07:56,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 71 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 22:07:56,285 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 233 flow [2023-08-31 22:07:56,285 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-31 22:07:56,287 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -37 predicate places. [2023-08-31 22:07:56,287 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 233 flow [2023-08-31 22:07:56,287 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-31 22:07:56,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:56,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:56,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 22:07:56,288 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-31 22:07:56,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:56,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1718251328, now seen corresponding path program 1 times [2023-08-31 22:07:56,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:56,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998226145] [2023-08-31 22:07:56,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:56,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:56,940 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-31 22:07:56,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:56,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998226145] [2023-08-31 22:07:56,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998226145] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:56,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:56,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 22:07:56,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791689493] [2023-08-31 22:07:56,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:56,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 22:07:56,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:56,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 22:07:56,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-31 22:07:57,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 636 [2023-08-31 22:07:57,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 233 flow. Second operand has 7 states, 7 states have (on average 248.85714285714286) internal successors, (1742), 7 states have internal predecessors, (1742), 0 states have call successors, (0), 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-31 22:07:57,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:57,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 636 [2023-08-31 22:07:57,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:58,226 INFO L130 PetriNetUnfolder]: 416/820 cut-off events. [2023-08-31 22:07:58,227 INFO L131 PetriNetUnfolder]: For 170/170 co-relation queries the response was YES. [2023-08-31 22:07:58,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1928 conditions, 820 events. 416/820 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3858 event pairs, 103 based on Foata normal form. 7/772 useless extension candidates. Maximal degree in co-relation 1916. Up to 600 conditions per place. [2023-08-31 22:07:58,229 INFO L137 encePairwiseOnDemand]: 628/636 looper letters, 70 selfloop transitions, 14 changer transitions 0/91 dead transitions. [2023-08-31 22:07:58,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 91 transitions, 467 flow [2023-08-31 22:07:58,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 22:07:58,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 22:07:58,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1809 transitions. [2023-08-31 22:07:58,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4063342318059299 [2023-08-31 22:07:58,233 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1809 transitions. [2023-08-31 22:07:58,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1809 transitions. [2023-08-31 22:07:58,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:58,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1809 transitions. [2023-08-31 22:07:58,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 258.42857142857144) internal successors, (1809), 7 states have internal predecessors, (1809), 0 states have call successors, (0), 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-31 22:07:58,239 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-31 22:07:58,240 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-31 22:07:58,240 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 233 flow. Second operand 7 states and 1809 transitions. [2023-08-31 22:07:58,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 91 transitions, 467 flow [2023-08-31 22:07:58,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 91 transitions, 459 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-31 22:07:58,242 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 283 flow [2023-08-31 22:07:58,242 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=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=283, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2023-08-31 22:07:58,242 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -30 predicate places. [2023-08-31 22:07:58,242 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 283 flow [2023-08-31 22:07:58,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 248.85714285714286) internal successors, (1742), 7 states have internal predecessors, (1742), 0 states have call successors, (0), 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-31 22:07:58,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:58,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:58,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 22:07:58,243 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-31 22:07:58,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:58,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1250219982, now seen corresponding path program 2 times [2023-08-31 22:07:58,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:58,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735171969] [2023-08-31 22:07:58,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:58,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:58,569 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-31 22:07:58,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:58,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735171969] [2023-08-31 22:07:58,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735171969] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:58,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:58,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 22:07:58,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544165046] [2023-08-31 22:07:58,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:58,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 22:07:58,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:58,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 22:07:58,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 22:07:58,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 636 [2023-08-31 22:07:58,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 283 flow. Second operand has 6 states, 6 states have (on average 250.16666666666666) internal successors, (1501), 6 states have internal predecessors, (1501), 0 states have call successors, (0), 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-31 22:07:58,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:58,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 636 [2023-08-31 22:07:58,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:59,052 INFO L130 PetriNetUnfolder]: 448/892 cut-off events. [2023-08-31 22:07:59,052 INFO L131 PetriNetUnfolder]: For 324/324 co-relation queries the response was YES. [2023-08-31 22:07:59,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2188 conditions, 892 events. 448/892 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4343 event pairs, 271 based on Foata normal form. 7/838 useless extension candidates. Maximal degree in co-relation 2173. Up to 585 conditions per place. [2023-08-31 22:07:59,056 INFO L137 encePairwiseOnDemand]: 628/636 looper letters, 72 selfloop transitions, 14 changer transitions 0/93 dead transitions. [2023-08-31 22:07:59,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 93 transitions, 519 flow [2023-08-31 22:07:59,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 22:07:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 22:07:59,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1567 transitions. [2023-08-31 22:07:59,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4106394129979036 [2023-08-31 22:07:59,059 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1567 transitions. [2023-08-31 22:07:59,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1567 transitions. [2023-08-31 22:07:59,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:59,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1567 transitions. [2023-08-31 22:07:59,062 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-31 22:07:59,065 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-31 22:07:59,065 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-31 22:07:59,065 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 283 flow. Second operand 6 states and 1567 transitions. [2023-08-31 22:07:59,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 93 transitions, 519 flow [2023-08-31 22:07:59,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 93 transitions, 498 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-31 22:07:59,068 INFO L231 Difference]: Finished difference. Result has 81 places, 70 transitions, 321 flow [2023-08-31 22:07:59,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=321, PETRI_PLACES=81, PETRI_TRANSITIONS=70} [2023-08-31 22:07:59,068 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -25 predicate places. [2023-08-31 22:07:59,068 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 70 transitions, 321 flow [2023-08-31 22:07:59,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 250.16666666666666) internal successors, (1501), 6 states have internal predecessors, (1501), 0 states have call successors, (0), 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-31 22:07:59,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:59,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:59,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 22:07:59,069 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-31 22:07:59,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:59,069 INFO L85 PathProgramCache]: Analyzing trace with hash 223203624, now seen corresponding path program 3 times [2023-08-31 22:07:59,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:59,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021903819] [2023-08-31 22:07:59,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:59,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:59,440 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-31 22:07:59,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:59,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021903819] [2023-08-31 22:07:59,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021903819] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:59,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:59,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 22:07:59,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678903854] [2023-08-31 22:07:59,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:59,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 22:07:59,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:59,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 22:07:59,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 22:07:59,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 636 [2023-08-31 22:07:59,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 70 transitions, 321 flow. Second operand has 6 states, 6 states have (on average 248.16666666666666) internal successors, (1489), 6 states have internal predecessors, (1489), 0 states have call successors, (0), 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-31 22:07:59,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:59,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 636 [2023-08-31 22:07:59,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:59,868 INFO L130 PetriNetUnfolder]: 433/864 cut-off events. [2023-08-31 22:07:59,868 INFO L131 PetriNetUnfolder]: For 403/403 co-relation queries the response was YES. [2023-08-31 22:07:59,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2183 conditions, 864 events. 433/864 cut-off events. For 403/403 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4131 event pairs, 132 based on Foata normal form. 7/813 useless extension candidates. Maximal degree in co-relation 2166. Up to 506 conditions per place. [2023-08-31 22:07:59,871 INFO L137 encePairwiseOnDemand]: 629/636 looper letters, 73 selfloop transitions, 14 changer transitions 0/94 dead transitions. [2023-08-31 22:07:59,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 94 transitions, 553 flow [2023-08-31 22:07:59,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 22:07:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 22:07:59,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1555 transitions. [2023-08-31 22:07:59,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40749475890985326 [2023-08-31 22:07:59,874 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1555 transitions. [2023-08-31 22:07:59,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1555 transitions. [2023-08-31 22:07:59,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:59,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1555 transitions. [2023-08-31 22:07:59,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 259.1666666666667) internal successors, (1555), 6 states have internal predecessors, (1555), 0 states have call successors, (0), 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-31 22:07:59,880 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-31 22:07:59,880 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-31 22:07:59,880 INFO L175 Difference]: Start difference. First operand has 81 places, 70 transitions, 321 flow. Second operand 6 states and 1555 transitions. [2023-08-31 22:07:59,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 94 transitions, 553 flow [2023-08-31 22:07:59,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 94 transitions, 536 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-31 22:07:59,883 INFO L231 Difference]: Finished difference. Result has 85 places, 71 transitions, 349 flow [2023-08-31 22:07:59,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=349, PETRI_PLACES=85, PETRI_TRANSITIONS=71} [2023-08-31 22:07:59,883 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -21 predicate places. [2023-08-31 22:07:59,884 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 71 transitions, 349 flow [2023-08-31 22:07:59,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 248.16666666666666) internal successors, (1489), 6 states have internal predecessors, (1489), 0 states have call successors, (0), 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-31 22:07:59,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:59,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:59,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 22:07:59,884 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-31 22:07:59,885 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:59,885 INFO L85 PathProgramCache]: Analyzing trace with hash 99588272, now seen corresponding path program 1 times [2023-08-31 22:07:59,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:59,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467245858] [2023-08-31 22:07:59,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:59,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:00,363 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-31 22:08:00,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:08:00,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467245858] [2023-08-31 22:08:00,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467245858] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:08:00,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860860296] [2023-08-31 22:08:00,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:00,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:08:00,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:08:00,366 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-31 22:08:00,371 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-31 22:08:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:00,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 55 conjunts are in the unsatisfiable core [2023-08-31 22:08:00,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:08:00,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:00,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:00,556 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 22:08:00,557 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-31 22:08:00,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:00,564 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-31 22:08:00,569 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-31 22:08:00,590 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-31 22:08:00,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:00,702 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-31 22:08:00,761 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-31 22:08:00,824 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-31 22:08:00,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:00,855 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-31 22:08:00,873 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-31 22:08:00,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:08:00,897 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_546 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse0)) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_546 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse0))))))) is different from false [2023-08-31 22:08:00,978 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_542) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_542) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2023-08-31 22:08:00,996 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.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 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_ArrVal_540 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_540))) (store (store .cse0 .cse1 v_ArrVal_542) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_ArrVal_540 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_540))) (store (store .cse6 .cse1 v_ArrVal_542) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-31 22:08:03,207 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-31 22:08:03,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860860296] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:08:03,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:08:03,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 20 [2023-08-31 22:08:03,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052878725] [2023-08-31 22:08:03,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:08:03,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-31 22:08:03,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:08:03,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-31 22:08:03,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=246, Unknown=8, NotChecked=108, Total=462 [2023-08-31 22:08:03,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 636 [2023-08-31 22:08:03,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 71 transitions, 349 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-31 22:08:03,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:08:03,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 636 [2023-08-31 22:08:03,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:08:08,543 INFO L130 PetriNetUnfolder]: 591/1195 cut-off events. [2023-08-31 22:08:08,543 INFO L131 PetriNetUnfolder]: For 705/705 co-relation queries the response was YES. [2023-08-31 22:08:08,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3006 conditions, 1195 events. 591/1195 cut-off events. For 705/705 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6436 event pairs, 390 based on Foata normal form. 10/1109 useless extension candidates. Maximal degree in co-relation 2988. Up to 850 conditions per place. [2023-08-31 22:08:08,548 INFO L137 encePairwiseOnDemand]: 623/636 looper letters, 101 selfloop transitions, 31 changer transitions 0/138 dead transitions. [2023-08-31 22:08:08,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 138 transitions, 848 flow [2023-08-31 22:08:08,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-31 22:08:08,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-31 22:08:08,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2690 transitions. [2023-08-31 22:08:08,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28197064989517817 [2023-08-31 22:08:08,554 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2690 transitions. [2023-08-31 22:08:08,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2690 transitions. [2023-08-31 22:08:08,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:08:08,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2690 transitions. [2023-08-31 22:08:08,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 179.33333333333334) internal successors, (2690), 15 states have internal predecessors, (2690), 0 states have call successors, (0), 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-31 22:08:08,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 636.0) internal successors, (10176), 16 states have internal predecessors, (10176), 0 states have call successors, (0), 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-31 22:08:08,568 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 636.0) internal successors, (10176), 16 states have internal predecessors, (10176), 0 states have call successors, (0), 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-31 22:08:08,568 INFO L175 Difference]: Start difference. First operand has 85 places, 71 transitions, 349 flow. Second operand 15 states and 2690 transitions. [2023-08-31 22:08:08,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 138 transitions, 848 flow [2023-08-31 22:08:08,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 138 transitions, 818 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-31 22:08:08,572 INFO L231 Difference]: Finished difference. Result has 103 places, 94 transitions, 561 flow [2023-08-31 22:08:08,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=561, PETRI_PLACES=103, PETRI_TRANSITIONS=94} [2023-08-31 22:08:08,572 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -3 predicate places. [2023-08-31 22:08:08,572 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 94 transitions, 561 flow [2023-08-31 22:08:08,573 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-31 22:08:08,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:08:08,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:08:08,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-31 22:08:08,778 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,SelfDestructingSolverStorable16 [2023-08-31 22:08:08,779 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-31 22:08:08,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:08:08,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1733159420, now seen corresponding path program 1 times [2023-08-31 22:08:08,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:08:08,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83029494] [2023-08-31 22:08:08,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:08,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:08:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:09,423 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-31 22:08:09,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:08:09,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83029494] [2023-08-31 22:08:09,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83029494] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:08:09,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089951627] [2023-08-31 22:08:09,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:09,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:08:09,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:08:09,424 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-31 22:08:09,438 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-31 22:08:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:09,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 77 conjunts are in the unsatisfiable core [2023-08-31 22:08:09,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:08:09,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:09,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:09,570 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 22:08:09,570 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-31 22:08:09,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:09,579 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-31 22:08:09,583 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-31 22:08:09,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:09,683 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 22 treesize of output 24 [2023-08-31 22:08:09,809 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-31 22:08:09,901 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-31 22:08:10,057 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-31 22:08:10,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:10,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 52 treesize of output 54 [2023-08-31 22:08:10,150 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-31 22:08:10,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:08:10,219 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_645 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_645) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_645 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_645) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-31 22:08:10,288 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int)) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_642) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_645) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int)) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_642) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_645) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2023-08-31 22:08:10,305 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.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 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (v_ArrVal_640 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_640))) (store (store .cse0 .cse1 v_ArrVal_642) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_645) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (v_ArrVal_640 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_640))) (store (store .cse6 .cse1 v_ArrVal_642) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_645) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-31 22:08:22,877 WARN L222 SmtUtils]: Spent 6.21s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:08:22,901 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_638 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_638))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (v_ArrVal_640 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|)) v_ArrVal_640))) (store (store .cse1 .cse2 v_ArrVal_642) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_645) |c_~#queue~0.base|) .cse3) 4)))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|))))) (forall ((v_ArrVal_638 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_638))) (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (v_ArrVal_640 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|)) v_ArrVal_640))) (store (store .cse6 .cse2 v_ArrVal_642) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_645) |c_~#queue~0.base|) .cse3) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|))))))) is different from false [2023-08-31 22:08:22,959 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-31 22:08:22,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089951627] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:08:22,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:08:22,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2023-08-31 22:08:22,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933246644] [2023-08-31 22:08:22,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:08:22,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-31 22:08:22,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:08:22,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-31 22:08:22,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=384, Unknown=11, NotChecked=180, Total=702 [2023-08-31 22:08:23,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-31 22:08:23,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 94 transitions, 561 flow. Second operand has 27 states, 27 states have (on average 167.55555555555554) internal successors, (4524), 27 states have internal predecessors, (4524), 0 states have call successors, (0), 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-31 22:08:23,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:08:23,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-31 22:08:23,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:08:27,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:08:33,119 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-31 22:08:34,431 INFO L130 PetriNetUnfolder]: 1071/2165 cut-off events. [2023-08-31 22:08:34,431 INFO L131 PetriNetUnfolder]: For 1890/1890 co-relation queries the response was YES. [2023-08-31 22:08:34,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5663 conditions, 2165 events. 1071/2165 cut-off events. For 1890/1890 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 13257 event pairs, 313 based on Foata normal form. 21/2042 useless extension candidates. Maximal degree in co-relation 5637. Up to 623 conditions per place. [2023-08-31 22:08:34,438 INFO L137 encePairwiseOnDemand]: 618/636 looper letters, 182 selfloop transitions, 68 changer transitions 0/256 dead transitions. [2023-08-31 22:08:34,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 256 transitions, 1664 flow [2023-08-31 22:08:34,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-31 22:08:34,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-31 22:08:34,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3031 transitions. [2023-08-31 22:08:34,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2803366629670736 [2023-08-31 22:08:34,451 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3031 transitions. [2023-08-31 22:08:34,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3031 transitions. [2023-08-31 22:08:34,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:08:34,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3031 transitions. [2023-08-31 22:08:34,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 178.2941176470588) internal successors, (3031), 17 states have internal predecessors, (3031), 0 states have call successors, (0), 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-31 22:08:34,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 636.0) internal successors, (11448), 18 states have internal predecessors, (11448), 0 states have call successors, (0), 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-31 22:08:34,463 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 636.0) internal successors, (11448), 18 states have internal predecessors, (11448), 0 states have call successors, (0), 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-31 22:08:34,463 INFO L175 Difference]: Start difference. First operand has 103 places, 94 transitions, 561 flow. Second operand 17 states and 3031 transitions. [2023-08-31 22:08:34,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 256 transitions, 1664 flow [2023-08-31 22:08:34,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 256 transitions, 1526 flow, removed 59 selfloop flow, removed 4 redundant places. [2023-08-31 22:08:34,472 INFO L231 Difference]: Finished difference. Result has 122 places, 142 transitions, 989 flow [2023-08-31 22:08:34,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=989, PETRI_PLACES=122, PETRI_TRANSITIONS=142} [2023-08-31 22:08:34,472 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 16 predicate places. [2023-08-31 22:08:34,472 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 142 transitions, 989 flow [2023-08-31 22:08:34,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 167.55555555555554) internal successors, (4524), 27 states have internal predecessors, (4524), 0 states have call successors, (0), 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-31 22:08:34,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:08:34,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:08:34,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-31 22:08:34,679 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,SelfDestructingSolverStorable17 [2023-08-31 22:08:34,679 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-31 22:08:34,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:08:34,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1207730986, now seen corresponding path program 2 times [2023-08-31 22:08:34,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:08:34,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090998818] [2023-08-31 22:08:34,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:34,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:08:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:35,353 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-31 22:08:35,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:08:35,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090998818] [2023-08-31 22:08:35,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090998818] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:08:35,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456265641] [2023-08-31 22:08:35,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 22:08:35,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:08:35,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:08:35,355 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-31 22:08:35,357 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-31 22:08:35,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 22:08:35,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:08:35,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 71 conjunts are in the unsatisfiable core [2023-08-31 22:08:35,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:08:35,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:35,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:35,506 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 22:08:35,506 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-31 22:08:35,518 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-31 22:08:35,518 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-31 22:08:35,657 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-31 22:08:35,724 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-31 22:08:35,904 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-31 22:08:35,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:35,961 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-31 22:08:36,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:36,015 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-31 22:08:36,058 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-31 22:08:36,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:08:40,202 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_741) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_742) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_741) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_742) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-31 22:08:40,217 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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_741) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_742) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_741) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_742) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-31 22:08:44,805 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-31 22:08:44,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456265641] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:08:44,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:08:44,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 25 [2023-08-31 22:08:44,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292252146] [2023-08-31 22:08:44,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:08:44,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-31 22:08:44,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:08:44,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-31 22:08:44,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=436, Unknown=19, NotChecked=94, Total=702 [2023-08-31 22:08:45,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-31 22:08:45,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 142 transitions, 989 flow. Second operand has 27 states, 27 states have (on average 167.55555555555554) internal successors, (4524), 27 states have internal predecessors, (4524), 0 states have call successors, (0), 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-31 22:08:45,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:08:45,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-31 22:08:45,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:08:47,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:09:02,386 WARN L222 SmtUtils]: Spent 14.52s 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-31 22:09:04,400 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-31 22:09:16,218 WARN L222 SmtUtils]: Spent 8.65s on a formula simplification that was a NOOP. DAG size: 86 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:09:18,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 [0, 1] [2023-08-31 22:09:23,754 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-31 22:09:24,241 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select .cse5 .cse6))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 (+ .cse2 1)))) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (forall ((v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_741) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_742) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))) (.cse1 (forall ((v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= (+ (* (select (select (store (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_741) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_742) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) (and .cse0 .cse1 (or (and .cse0 .cse1) (= .cse2 20))))))) is different from false [2023-08-31 22:09:26,498 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-31 22:09:29,711 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-31 22:09:32,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:39,695 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-31 22:09:42,293 INFO L130 PetriNetUnfolder]: 1636/3296 cut-off events. [2023-08-31 22:09:42,293 INFO L131 PetriNetUnfolder]: For 9088/9227 co-relation queries the response was YES. [2023-08-31 22:09:42,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12172 conditions, 3296 events. 1636/3296 cut-off events. For 9088/9227 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 22165 event pairs, 483 based on Foata normal form. 20/3156 useless extension candidates. Maximal degree in co-relation 12139. Up to 1177 conditions per place. [2023-08-31 22:09:42,307 INFO L137 encePairwiseOnDemand]: 615/636 looper letters, 211 selfloop transitions, 89 changer transitions 0/306 dead transitions. [2023-08-31 22:09:42,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 306 transitions, 2593 flow [2023-08-31 22:09:42,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-31 22:09:42,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-31 22:09:42,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3536 transitions. [2023-08-31 22:09:42,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2779874213836478 [2023-08-31 22:09:42,313 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3536 transitions. [2023-08-31 22:09:42,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3536 transitions. [2023-08-31 22:09:42,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:09:42,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3536 transitions. [2023-08-31 22:09:42,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 176.8) internal successors, (3536), 20 states have internal predecessors, (3536), 0 states have call successors, (0), 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-31 22:09:42,325 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-31 22:09:42,326 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-31 22:09:42,326 INFO L175 Difference]: Start difference. First operand has 122 places, 142 transitions, 989 flow. Second operand 20 states and 3536 transitions. [2023-08-31 22:09:42,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 306 transitions, 2593 flow [2023-08-31 22:09:42,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 306 transitions, 2538 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-08-31 22:09:42,340 INFO L231 Difference]: Finished difference. Result has 146 places, 186 transitions, 1593 flow [2023-08-31 22:09:42,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1593, PETRI_PLACES=146, PETRI_TRANSITIONS=186} [2023-08-31 22:09:42,340 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 40 predicate places. [2023-08-31 22:09:42,340 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 186 transitions, 1593 flow [2023-08-31 22:09:42,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 167.55555555555554) internal successors, (4524), 27 states have internal predecessors, (4524), 0 states have call successors, (0), 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-31 22:09:42,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:09:42,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:09:42,348 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-31 22:09:42,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:09:42,546 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-31 22:09:42,547 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:09:42,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1155826660, now seen corresponding path program 1 times [2023-08-31 22:09:42,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:09:42,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263618784] [2023-08-31 22:09:42,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:09:42,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:09:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:09:42,648 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-31 22:09:42,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:09:42,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263618784] [2023-08-31 22:09:42,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263618784] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:09:42,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:09:42,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 22:09:42,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250877292] [2023-08-31 22:09:42,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:09:42,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:09:42,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:09:42,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:09:42,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:09:42,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-31 22:09:42,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 186 transitions, 1593 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-31 22:09:42,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:09:42,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-31 22:09:42,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:09:43,340 INFO L130 PetriNetUnfolder]: 1635/3331 cut-off events. [2023-08-31 22:09:43,341 INFO L131 PetriNetUnfolder]: For 16944/17195 co-relation queries the response was YES. [2023-08-31 22:09:43,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14862 conditions, 3331 events. 1635/3331 cut-off events. For 16944/17195 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 22709 event pairs, 703 based on Foata normal form. 13/3180 useless extension candidates. Maximal degree in co-relation 14819. Up to 1605 conditions per place. [2023-08-31 22:09:43,364 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 173 selfloop transitions, 3 changer transitions 0/201 dead transitions. [2023-08-31 22:09:43,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 201 transitions, 2067 flow [2023-08-31 22:09:43,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:09:43,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:09:43,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 843 transitions. [2023-08-31 22:09:43,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418238993710692 [2023-08-31 22:09:43,366 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 843 transitions. [2023-08-31 22:09:43,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 843 transitions. [2023-08-31 22:09:43,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:09:43,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 843 transitions. [2023-08-31 22:09:43,368 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-31 22:09:43,369 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-31 22:09:43,369 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-31 22:09:43,370 INFO L175 Difference]: Start difference. First operand has 146 places, 186 transitions, 1593 flow. Second operand 3 states and 843 transitions. [2023-08-31 22:09:43,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 201 transitions, 2067 flow [2023-08-31 22:09:43,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 201 transitions, 1949 flow, removed 45 selfloop flow, removed 6 redundant places. [2023-08-31 22:09:43,397 INFO L231 Difference]: Finished difference. Result has 139 places, 184 transitions, 1474 flow [2023-08-31 22:09:43,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=139, PETRI_TRANSITIONS=184} [2023-08-31 22:09:43,397 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 33 predicate places. [2023-08-31 22:09:43,397 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 184 transitions, 1474 flow [2023-08-31 22:09:43,398 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-31 22:09:43,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:09:43,398 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:09:43,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-31 22:09:43,398 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-31 22:09:43,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:09:43,398 INFO L85 PathProgramCache]: Analyzing trace with hash -2042297759, now seen corresponding path program 1 times [2023-08-31 22:09:43,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:09:43,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658668416] [2023-08-31 22:09:43,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:09:43,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:09:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:09:43,694 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-31 22:09:43,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:09:43,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658668416] [2023-08-31 22:09:43,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658668416] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:09:43,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485042850] [2023-08-31 22:09:43,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:09:43,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:09:43,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:09:43,696 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-31 22:09:43,698 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-31 22:09:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:09:43,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-31 22:09:43,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:09:43,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:09:43,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:09:43,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:09:43,848 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-31 22:09:44,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-31 22:09:44,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:09:45,016 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-31 22:09:45,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485042850] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:09:45,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:09:45,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-08-31 22:09:45,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912323755] [2023-08-31 22:09:45,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:09:45,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-31 22:09:45,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:09:45,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-31 22:09:45,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-08-31 22:09:50,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 636 [2023-08-31 22:09:50,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 184 transitions, 1474 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-31 22:09:50,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:09:50,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 636 [2023-08-31 22:09:50,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:09:52,037 INFO L130 PetriNetUnfolder]: 1052/2078 cut-off events. [2023-08-31 22:09:52,037 INFO L131 PetriNetUnfolder]: For 15019/15283 co-relation queries the response was YES. [2023-08-31 22:09:52,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11578 conditions, 2078 events. 1052/2078 cut-off events. For 15019/15283 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 10809 event pairs, 320 based on Foata normal form. 136/2157 useless extension candidates. Maximal degree in co-relation 11534. Up to 848 conditions per place. [2023-08-31 22:09:52,050 INFO L137 encePairwiseOnDemand]: 631/636 looper letters, 206 selfloop transitions, 13 changer transitions 0/245 dead transitions. [2023-08-31 22:09:52,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 245 transitions, 2480 flow [2023-08-31 22:09:52,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 22:09:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 22:09:52,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1906 transitions. [2023-08-31 22:09:52,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4281221922731357 [2023-08-31 22:09:52,053 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1906 transitions. [2023-08-31 22:09:52,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1906 transitions. [2023-08-31 22:09:52,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:09:52,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1906 transitions. [2023-08-31 22:09:52,055 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-31 22:09:52,058 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-31 22:09:52,058 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-31 22:09:52,058 INFO L175 Difference]: Start difference. First operand has 139 places, 184 transitions, 1474 flow. Second operand 7 states and 1906 transitions. [2023-08-31 22:09:52,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 245 transitions, 2480 flow [2023-08-31 22:09:52,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 245 transitions, 2438 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-08-31 22:09:52,085 INFO L231 Difference]: Finished difference. Result has 144 places, 172 transitions, 1413 flow [2023-08-31 22:09:52,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1413, PETRI_PLACES=144, PETRI_TRANSITIONS=172} [2023-08-31 22:09:52,085 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 38 predicate places. [2023-08-31 22:09:52,085 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 172 transitions, 1413 flow [2023-08-31 22:09:52,086 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-31 22:09:52,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:09:52,086 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:09:52,092 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-31 22:09:52,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:09:52,286 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-31 22:09:52,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:09:52,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1672765241, now seen corresponding path program 1 times [2023-08-31 22:09:52,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:09:52,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033479476] [2023-08-31 22:09:52,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:09:52,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:09:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:09:54,657 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-31 22:09:54,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:09:54,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033479476] [2023-08-31 22:09:54,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033479476] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:09:54,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022398145] [2023-08-31 22:09:54,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:09:54,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:09:54,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:09:54,658 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-31 22:09:54,658 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-31 22:09:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:09:54,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-31 22:09:54,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:09:55,672 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-31 22:09:55,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:09:55,859 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-31 22:09:55,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 22:09:55,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:09:56,118 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_958 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_958) |c_~#queue~0.base|) .cse0))) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_958 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_958) |c_~#queue~0.base|) .cse0))))))) is different from false [2023-08-31 22:09:56,139 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 22:09:56,140 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 29 treesize of output 30 [2023-08-31 22:09:56,176 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 22:09:56,177 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 50 treesize of output 49 [2023-08-31 22:09:56,233 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 10 [2023-08-31 22:09:56,252 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 22:09:56,253 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-31 22:09:56,258 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 22:09:56,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:09:56,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-08-31 22:09:56,980 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-08-31 22:09:56,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022398145] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:09:56,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:09:56,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4, 4] total 20 [2023-08-31 22:09:56,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189993167] [2023-08-31 22:09:56,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:09:56,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-31 22:09:56,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:09:56,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-31 22:09:56,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=295, Unknown=1, NotChecked=36, Total=420 [2023-08-31 22:09:57,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-31 22:09:57,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 172 transitions, 1413 flow. Second operand has 21 states, 21 states have (on average 169.0) internal successors, (3549), 21 states have internal predecessors, (3549), 0 states have call successors, (0), 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-31 22:09:57,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:09:57,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-31 22:09:57,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:02,750 INFO L130 PetriNetUnfolder]: 1175/2305 cut-off events. [2023-08-31 22:10:02,750 INFO L131 PetriNetUnfolder]: For 18189/18538 co-relation queries the response was YES. [2023-08-31 22:10:02,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12767 conditions, 2305 events. 1175/2305 cut-off events. For 18189/18538 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 12189 event pairs, 227 based on Foata normal form. 38/2239 useless extension candidates. Maximal degree in co-relation 12720. Up to 1040 conditions per place. [2023-08-31 22:10:02,761 INFO L137 encePairwiseOnDemand]: 625/636 looper letters, 178 selfloop transitions, 31 changer transitions 0/214 dead transitions. [2023-08-31 22:10:02,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 214 transitions, 2205 flow [2023-08-31 22:10:02,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-31 22:10:02,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-31 22:10:02,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1953 transitions. [2023-08-31 22:10:02,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27915951972555747 [2023-08-31 22:10:02,763 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1953 transitions. [2023-08-31 22:10:02,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1953 transitions. [2023-08-31 22:10:02,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:02,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1953 transitions. [2023-08-31 22:10:02,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 177.54545454545453) internal successors, (1953), 11 states have internal predecessors, (1953), 0 states have call successors, (0), 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-31 22:10:02,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 636.0) internal successors, (7632), 12 states have internal predecessors, (7632), 0 states have call successors, (0), 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-31 22:10:02,769 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 636.0) internal successors, (7632), 12 states have internal predecessors, (7632), 0 states have call successors, (0), 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-31 22:10:02,769 INFO L175 Difference]: Start difference. First operand has 144 places, 172 transitions, 1413 flow. Second operand 11 states and 1953 transitions. [2023-08-31 22:10:02,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 214 transitions, 2205 flow [2023-08-31 22:10:02,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 214 transitions, 2123 flow, removed 30 selfloop flow, removed 4 redundant places. [2023-08-31 22:10:02,786 INFO L231 Difference]: Finished difference. Result has 153 places, 152 transitions, 1282 flow [2023-08-31 22:10:02,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1282, PETRI_PLACES=153, PETRI_TRANSITIONS=152} [2023-08-31 22:10:02,787 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 47 predicate places. [2023-08-31 22:10:02,787 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 152 transitions, 1282 flow [2023-08-31 22:10:02,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 169.0) internal successors, (3549), 21 states have internal predecessors, (3549), 0 states have call successors, (0), 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-31 22:10:02,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:02,787 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-31 22:10:02,795 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-31 22:10:02,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-08-31 22:10:02,992 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-31 22:10:02,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:02,992 INFO L85 PathProgramCache]: Analyzing trace with hash -78893555, now seen corresponding path program 3 times [2023-08-31 22:10:02,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:10:02,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530164927] [2023-08-31 22:10:02,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:02,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:10:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:05,667 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-31 22:10:05,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:10:05,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530164927] [2023-08-31 22:10:05,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530164927] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:10:05,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752383244] [2023-08-31 22:10:05,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 22:10:05,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:10:05,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:10:05,668 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-31 22:10:05,668 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-31 22:10:05,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-31 22:10:05,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:10:05,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 102 conjunts are in the unsatisfiable core [2023-08-31 22:10:05,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:05,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:10:06,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:10:06,066 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 22:10:06,066 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-31 22:10:06,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:10:06,116 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-31 22:10:06,142 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-31 22:10:06,907 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 33 treesize of output 26 [2023-08-31 22:10:07,309 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 30 treesize of output 25 [2023-08-31 22:10:12,083 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-31 22:10:14,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:10:14,364 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 31 treesize of output 33 [2023-08-31 22:10:16,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:10:16,669 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 31 treesize of output 33 [2023-08-31 22:10:19,111 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 45 treesize of output 38 [2023-08-31 22:10:19,573 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 36 [2023-08-31 22:10:20,482 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 47 treesize of output 40 [2023-08-31 22:10:20,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:10:20,825 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 67 treesize of output 69 [2023-08-31 22:10:21,124 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-31 22:10:21,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:10:21,300 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1080 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1080 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-31 22:10:21,725 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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1080 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1080 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-31 22:10:52,701 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-31 22:10:52,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752383244] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:10:52,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:10:52,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 16] total 39 [2023-08-31 22:10:52,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584886134] [2023-08-31 22:10:52,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:10:52,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-08-31 22:10:52,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:10:52,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-08-31 22:10:52,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1209, Unknown=36, NotChecked=150, Total=1640 [2023-08-31 22:10:53,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-31 22:10:53,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 152 transitions, 1282 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-31 22:10:53,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:53,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-31 22:10:53,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:11:17,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:11:20,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:11:22,317 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-31 22:11:35,144 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-31 22:11:37,581 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-31 22:11:39,599 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-31 22:11:41,868 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-31 22:11:43,872 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-31 22:11:45,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:11:47,267 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-31 22:11:58,399 WARN L222 SmtUtils]: Spent 6.83s on a formula simplification. DAG size of input: 201 DAG size of output: 77 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:12:34,015 WARN L222 SmtUtils]: Spent 28.85s on a formula simplification. DAG size of input: 254 DAG size of output: 200 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:12:56,047 WARN L222 SmtUtils]: Spent 8.02s on a formula simplification. DAG size of input: 230 DAG size of output: 191 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:12:58,787 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-31 22:13:00,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:13:02,625 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-31 22:13:46,599 WARN L222 SmtUtils]: Spent 38.02s on a formula simplification. DAG size of input: 244 DAG size of output: 194 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:13:50,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:13:54,578 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-31 22:14:07,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:14:09,996 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-31 22:14:16,074 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-31 22:14:18,973 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-31 22:14:22,217 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-31 22:14:25,592 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-31 22:14:27,823 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-31 22:14:29,939 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-31 22:14:31,945 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-31 22:14:34,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:14:36,423 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-31 22:14:38,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:14:40,134 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-31 22:14:42,182 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-31 22:14:44,196 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-31 22:14:46,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:14:49,403 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-31 22:15:28,004 WARN L222 SmtUtils]: Spent 31.66s on a formula simplification. DAG size of input: 146 DAG size of output: 77 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:15:36,998 WARN L222 SmtUtils]: Spent 6.38s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:15:45,209 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-31 22:15:48,639 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-31 22:15:52,194 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-31 22:15:54,205 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-31 22:15:56,209 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-31 22:16:06,828 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (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 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (forall ((v_ArrVal_1080 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|)))) (.cse1 (forall ((v_ArrVal_1080 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1080) |c_~#queue~0.base|) .cse4)) |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-31 22:16:17,835 INFO L130 PetriNetUnfolder]: 1517/2970 cut-off events. [2023-08-31 22:16:17,835 INFO L131 PetriNetUnfolder]: For 24938/25275 co-relation queries the response was YES. [2023-08-31 22:16:17,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17110 conditions, 2970 events. 1517/2970 cut-off events. For 24938/25275 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 16873 event pairs, 287 based on Foata normal form. 50/2933 useless extension candidates. Maximal degree in co-relation 17062. Up to 1326 conditions per place. [2023-08-31 22:16:17,852 INFO L137 encePairwiseOnDemand]: 619/636 looper letters, 220 selfloop transitions, 129 changer transitions 0/354 dead transitions. [2023-08-31 22:16:17,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 354 transitions, 4316 flow [2023-08-31 22:16:17,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-08-31 22:16:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-08-31 22:16:17,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 6910 transitions. [2023-08-31 22:16:17,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2716194968553459 [2023-08-31 22:16:17,858 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 6910 transitions. [2023-08-31 22:16:17,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 6910 transitions. [2023-08-31 22:16:17,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:16:17,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 6910 transitions. [2023-08-31 22:16:17,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 172.75) internal successors, (6910), 40 states have internal predecessors, (6910), 0 states have call successors, (0), 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-31 22:16:17,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 636.0) internal successors, (26076), 41 states have internal predecessors, (26076), 0 states have call successors, (0), 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-31 22:16:17,878 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 636.0) internal successors, (26076), 41 states have internal predecessors, (26076), 0 states have call successors, (0), 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-31 22:16:17,878 INFO L175 Difference]: Start difference. First operand has 153 places, 152 transitions, 1282 flow. Second operand 40 states and 6910 transitions. [2023-08-31 22:16:17,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 354 transitions, 4316 flow [2023-08-31 22:16:17,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 354 transitions, 4235 flow, removed 29 selfloop flow, removed 5 redundant places. [2023-08-31 22:16:17,905 INFO L231 Difference]: Finished difference. Result has 205 places, 224 transitions, 2472 flow [2023-08-31 22:16:17,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=2472, PETRI_PLACES=205, PETRI_TRANSITIONS=224} [2023-08-31 22:16:17,906 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 99 predicate places. [2023-08-31 22:16:17,906 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 224 transitions, 2472 flow [2023-08-31 22:16:17,906 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-31 22:16:17,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:16:17,907 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-31 22:16:17,911 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-31 22:16:18,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:16:18,109 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-31 22:16:18,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:16:18,109 INFO L85 PathProgramCache]: Analyzing trace with hash 202360031, now seen corresponding path program 4 times [2023-08-31 22:16:18,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:16:18,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234376840] [2023-08-31 22:16:18,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:16:18,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:16:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:16:23,458 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-31 22:16:23,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:16:23,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234376840] [2023-08-31 22:16:23,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234376840] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:16:23,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727023410] [2023-08-31 22:16:23,459 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 22:16:23,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:16:23,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:16:23,461 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-31 22:16:23,462 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-31 22:16:23,584 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 22:16:23,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:16:23,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 80 conjunts are in the unsatisfiable core [2023-08-31 22:16:23,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:16:23,611 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 28 [2023-08-31 22:16:23,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:16:23,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:16:23,702 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 22:16:23,703 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 12 treesize of output 20 [2023-08-31 22:16:23,763 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-31 22:16:23,764 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-31 22:16:24,513 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-31 22:16:24,513 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 23 [2023-08-31 22:16:24,815 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-31 22:16:25,225 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 28 treesize of output 16 [2023-08-31 22:16:25,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:16:25,448 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-31 22:16:25,848 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-31 22:16:25,848 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 1 case distinctions, treesize of input 28 treesize of output 23 [2023-08-31 22:16:26,256 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 26 treesize of output 21 [2023-08-31 22:16:26,712 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 16 [2023-08-31 22:16:26,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:16:26,969 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 21 [2023-08-31 22:16:27,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:16:27,224 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 21 [2023-08-31 22:16:27,428 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-31 22:16:27,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:16:27,601 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1196 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1196 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-31 22:16:27,632 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-31 22:16:27,677 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-31 22:16:44,294 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (+ (select .cse8 .cse9) 1)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1187 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1191 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 v_ArrVal_1187)) |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse1 (select .cse5 |c_~#queue~0.base|)) (.cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|))) (let ((.cse6 (store .cse1 .cse0 v_ArrVal_1189))) (let ((.cse3 (select .cse6 .cse2))) (or (< .cse0 0) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (= 20 .cse3) (< .cse4 v_ArrVal_1187) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_1191) .cse2 (+ .cse3 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse2) 4)) (select |c_#length| |c_~#queue~0.base|)))))))) (forall ((v_ArrVal_1187 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1191 Int)) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 v_ArrVal_1187)) |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse11 (select .cse13 |c_~#queue~0.base|)) (.cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|))) (let ((.cse14 (store .cse11 .cse10 v_ArrVal_1189))) (let ((.cse12 (select .cse14 .cse2))) (or (< .cse10 0) (< (select .cse11 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (= 20 .cse12) (< .cse4 v_ArrVal_1187) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse7 v_ArrVal_1191) .cse2 (+ .cse12 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse2) 4)))))))))))) is different from false [2023-08-31 22:16:53,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-31 22:16:53,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727023410] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:16:53,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:16:53,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 16] total 39 [2023-08-31 22:16:53,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347239117] [2023-08-31 22:16:53,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:16:53,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-08-31 22:16:53,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:16:53,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-08-31 22:16:53,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1080, Unknown=51, NotChecked=292, Total=1640 [2023-08-31 22:16:59,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-31 22:16:59,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 224 transitions, 2472 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-31 22:16:59,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:16:59,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-31 22:16:59,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:17:20,522 WARN L222 SmtUtils]: Spent 12.58s on a formula simplification. DAG size of input: 106 DAG size of output: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:17:37,975 WARN L222 SmtUtils]: Spent 15.14s on a formula simplification. DAG size of input: 160 DAG size of output: 79 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:17:40,087 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-31 22:17:42,094 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-31 22:17:44,539 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-31 22:17:46,546 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-31 22:17:48,572 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-31 22:17:48,615 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse28 (select .cse10 .cse11))) (let ((.cse0 (= .cse28 20)) (.cse9 (select |c_#length| |c_~#queue~0.base|)) (.cse5 (+ .cse28 1)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse17 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (or .cse0 (and (forall ((v_ArrVal_1187 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1191 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse10 .cse11 v_ArrVal_1187)) |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|))) (let ((.cse7 (store .cse2 .cse1 v_ArrVal_1189))) (let ((.cse4 (select .cse7 .cse3))) (or (< .cse1 0) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (= 20 .cse4) (< .cse5 v_ArrVal_1187) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_1191) .cse3 (+ .cse4 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse3) 4)) .cse9))))))) (forall ((v_ArrVal_1187 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1191 Int)) (let ((.cse15 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse10 .cse11 v_ArrVal_1187)) |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse13 (select .cse15 |c_~#queue~0.base|)) (.cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|))) (let ((.cse16 (store .cse13 .cse12 v_ArrVal_1189))) (let ((.cse14 (select .cse16 .cse3))) (or (< .cse12 0) (< (select .cse13 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (= 20 .cse14) (< .cse5 v_ArrVal_1187) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse8 v_ArrVal_1191) .cse3 (+ .cse14 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse3) 4))))))))))) (or .cse0 (and (forall ((v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1191 Int)) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse17 v_ArrVal_1191) .cse11 .cse5)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse3))))) (forall ((v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1191 Int)) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse17 v_ArrVal_1191) .cse11 .cse5)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse3)) 4) .cse9)))) (or .cse0 (and (forall ((v_ArrVal_1184 Int) (v_ArrVal_1187 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1191 Int)) (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse17 v_ArrVal_1184) .cse11 v_ArrVal_1187)) |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse22 (select .cse18 |c_~#queue~0.base|)) (.cse21 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|))) (let ((.cse19 (store .cse22 .cse21 v_ArrVal_1189))) (let ((.cse20 (select .cse19 .cse3))) (or (<= (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse8 v_ArrVal_1191) .cse3 (+ .cse20 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse3) 4) 4) .cse9) (< .cse21 0) (< (select .cse22 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (< .cse5 v_ArrVal_1187) (= .cse20 20))))))) (forall ((v_ArrVal_1184 Int) (v_ArrVal_1187 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1191 Int)) (let ((.cse26 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse17 v_ArrVal_1184) .cse11 v_ArrVal_1187)) |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse24 (select .cse26 |c_~#queue~0.base|)) (.cse23 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|))) (let ((.cse27 (store .cse24 .cse23 v_ArrVal_1189))) (let ((.cse25 (select .cse27 .cse3))) (or (< .cse23 0) (< (select .cse24 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (< .cse5 v_ArrVal_1187) (= .cse25 20) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse26 |c_~#queue~0.base| (store (store .cse27 .cse8 v_ArrVal_1191) .cse3 (+ .cse25 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse3) 4))))))))))))))) is different from false [2023-08-31 22:17:57,777 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (select .cse13 .cse14))) (let ((.cse9 (+ .cse1 1)) (.cse12 (+ 88 |c_~#queue~0.offset|)) (.cse5 (select |c_#length| |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (forall ((v_ArrVal_1187 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1191 Int)) (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse13 .cse14 v_ArrVal_1187)) |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse16 (select .cse18 |c_~#queue~0.base|)) (.cse15 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|))) (let ((.cse19 (store .cse16 .cse15 v_ArrVal_1189))) (let ((.cse17 (select .cse19 .cse4))) (or (< .cse15 0) (< (select .cse16 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (= 20 .cse17) (< .cse9 v_ArrVal_1187) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse12 v_ArrVal_1191) .cse4 (+ .cse17 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse4) 4)) .cse5)))))))) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse13 .cse14 .cse9))) (.cse2 (forall ((v_ArrVal_1187 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1191 Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse13 .cse14 v_ArrVal_1187)) |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|)) (.cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|))) (let ((.cse11 (store .cse7 .cse6 v_ArrVal_1189))) (let ((.cse8 (select .cse11 .cse4))) (or (< .cse6 0) (< (select .cse7 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (= 20 .cse8) (< .cse9 v_ArrVal_1187) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse12 v_ArrVal_1191) .cse4 (+ .cse8 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse4) 4))))))))))) (and .cse0 (or (= .cse1 20) (and .cse0 .cse2)) (forall ((v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse4)) 4) .cse5)) (forall ((v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse4))))) .cse2))))) is different from false [2023-08-31 22:18:00,533 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-31 22:18:00,663 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 .cse10))) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse15 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_1187 Int)) (or (forall ((v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 v_ArrVal_1187)) |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|)) (.cse7 (select .cse3 |c_~#queue~0.base|))) (or (< .cse2 0) (forall ((v_ArrVal_1189 Int)) (let ((.cse4 (store .cse7 .cse2 v_ArrVal_1189))) (let ((.cse6 (select .cse4 .cse1))) (or (forall ((v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1191 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1191) .cse1 (+ .cse6 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse1) 4)))) (= 20 .cse6))))) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|))))) (< .cse10 v_ArrVal_1187))) (forall ((v_ArrVal_1187 Int)) (or (< .cse10 v_ArrVal_1187) (forall ((v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int)) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 v_ArrVal_1187)) |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|)) (.cse16 (select .cse13 |c_~#queue~0.base|))) (or (< .cse11 0) (forall ((v_ArrVal_1189 Int)) (let ((.cse14 (store .cse16 .cse11 v_ArrVal_1189))) (let ((.cse12 (select .cse14 .cse1))) (or (= 20 .cse12) (forall ((v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1191 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse5 v_ArrVal_1191) .cse1 (+ .cse12 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse1) 4)) .cse15)))))) (< (select .cse16 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|))))))) (forall ((v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse1) 4) 4) .cse15))))) is different from false [2023-08-31 22:18:01,040 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select |c_#length| |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse1 (select .cse3 |c_~#queue~0.base|)) (.cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|))) (or (< .cse0 0) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (forall ((v_ArrVal_1189 Int)) (let ((.cse4 (store .cse1 .cse0 v_ArrVal_1189))) (let ((.cse6 (select .cse4 .cse2))) (or (forall ((v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1191 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1191) .cse2 (+ .cse6 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse2) 4)))) (= 20 .cse6))))))))) (forall ((v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) .cse7)) (forall ((v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int)) (let ((.cse10 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|)) (.cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|))) (or (< .cse8 0) (< (select .cse9 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (forall ((v_ArrVal_1189 Int)) (let ((.cse11 (store .cse9 .cse8 v_ArrVal_1189))) (let ((.cse12 (select .cse11 .cse2))) (or (forall ((v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1191 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse5 v_ArrVal_1191) .cse2 (+ .cse12 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse2) 4)) .cse7)) (= 20 .cse12))))))))))) is different from false [2023-08-31 22:18:09,902 WARN L222 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 86 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:18:12,537 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-31 22:18:14,541 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-31 22:18:16,642 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-31 22:18:18,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:18:20,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:18:23,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:18:26,384 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)))) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse1)) 4) .cse3)) (forall ((v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse1))))) (forall ((v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1195) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|) .cse1) 4) 4) .cse3))))) is different from false [2023-08-31 22:18:28,910 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-31 22:18:31,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:18:36,048 INFO L130 PetriNetUnfolder]: 1851/3618 cut-off events. [2023-08-31 22:18:36,049 INFO L131 PetriNetUnfolder]: For 89633/90541 co-relation queries the response was YES. [2023-08-31 22:18:36,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30277 conditions, 3618 events. 1851/3618 cut-off events. For 89633/90541 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 21251 event pairs, 428 based on Foata normal form. 36/3532 useless extension candidates. Maximal degree in co-relation 30211. Up to 1602 conditions per place. [2023-08-31 22:18:36,077 INFO L137 encePairwiseOnDemand]: 617/636 looper letters, 256 selfloop transitions, 139 changer transitions 0/400 dead transitions. [2023-08-31 22:18:36,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 400 transitions, 6468 flow [2023-08-31 22:18:36,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-31 22:18:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-31 22:18:36,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4880 transitions. [2023-08-31 22:18:36,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27403414195867026 [2023-08-31 22:18:36,082 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 4880 transitions. [2023-08-31 22:18:36,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 4880 transitions. [2023-08-31 22:18:36,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:18:36,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 4880 transitions. [2023-08-31 22:18:36,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 174.28571428571428) internal successors, (4880), 28 states have internal predecessors, (4880), 0 states have call successors, (0), 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-31 22:18:36,097 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-31 22:18:36,098 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-31 22:18:36,098 INFO L175 Difference]: Start difference. First operand has 205 places, 224 transitions, 2472 flow. Second operand 28 states and 4880 transitions. [2023-08-31 22:18:36,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 400 transitions, 6468 flow [2023-08-31 22:18:36,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 400 transitions, 5753 flow, removed 335 selfloop flow, removed 8 redundant places. [2023-08-31 22:18:36,178 INFO L231 Difference]: Finished difference. Result has 238 places, 297 transitions, 3476 flow [2023-08-31 22:18:36,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1931, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=3476, PETRI_PLACES=238, PETRI_TRANSITIONS=297} [2023-08-31 22:18:36,180 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 132 predicate places. [2023-08-31 22:18:36,180 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 297 transitions, 3476 flow [2023-08-31 22:18:36,180 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-31 22:18:36,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:18:36,181 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:18:36,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-31 22:18:36,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:18:36,388 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-31 22:18:36,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:18:36,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1251314096, now seen corresponding path program 2 times [2023-08-31 22:18:36,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:18:36,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463159221] [2023-08-31 22:18:36,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:18:36,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:18:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:18:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:18:38,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:18:38,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463159221] [2023-08-31 22:18:38,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463159221] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:18:38,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544561556] [2023-08-31 22:18:38,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 22:18:38,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:18:38,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:18:38,971 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-31 22:18:38,972 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-31 22:18:39,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 22:18:39,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:18:39,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 82 conjunts are in the unsatisfiable core [2023-08-31 22:18:39,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:18:39,154 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 28 [2023-08-31 22:18:39,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:18:39,233 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 22:18:39,233 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 12 treesize of output 20 [2023-08-31 22:18:39,277 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 98 treesize of output 94 [2023-08-31 22:18:39,298 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-31 22:18:39,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:18:39,728 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-31 22:18:39,922 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-31 22:18:40,178 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-31 22:18:40,328 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-31 22:18:40,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:18:40,549 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-31 22:18:40,716 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-31 22:18:41,010 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-31 22:18:41,138 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-31 22:18:41,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:18:41,428 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-31 22:18:41,588 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-31 22:18:41,611 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:18:41,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:18:44,400 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| Int) (v_ArrVal_1329 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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1328) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| 4)) v_ArrVal_1329) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112|)))) is different from false [2023-08-31 22:18:44,456 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| Int) (v_ArrVal_1324 Int) (v_ArrVal_1329 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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1324) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1328) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112|) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| 4)) v_ArrVal_1329) .cse1) 20))))) is different from false [2023-08-31 22:18:44,530 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| Int) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1329 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_1322)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1324) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1328) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| 4)) v_ArrVal_1329) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112|)))) is different from false [2023-08-31 22:18:46,231 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1329 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1321))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_~#queue~0.offset|) v_ArrVal_1322))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1324) .cse1 (+ 1 (select .cse4 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_1328) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| 4)) v_ArrVal_1329) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114|)))))) is different from false [2023-08-31 22:18:46,315 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1318 Int) (v_ArrVal_1329 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1318) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1321))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_~#queue~0.offset|) v_ArrVal_1322))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1324) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1328) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114|) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| 4)) v_ArrVal_1329) .cse1) 20))))))) is different from false [2023-08-31 22:18:46,416 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1315 Int) (v_ArrVal_1318 Int) (v_ArrVal_1329 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (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_1315)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1318) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1321))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_~#queue~0.offset|) v_ArrVal_1322))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1324) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1328) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112|) (not (= (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| 4)) v_ArrVal_1329) .cse1) 20))))))) is different from false [2023-08-31 22:18:47,083 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 3 refuted. 2 times theorem prover too weak. 0 trivial. 13 not checked. [2023-08-31 22:18:47,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544561556] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:18:47,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:18:47,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 16] total 40 [2023-08-31 22:18:47,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371180209] [2023-08-31 22:18:47,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:18:47,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-08-31 22:18:47,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:18:47,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-08-31 22:18:47,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=888, Unknown=24, NotChecked=426, Total=1640 [2023-08-31 22:18:47,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 636 [2023-08-31 22:18:47,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 297 transitions, 3476 flow. Second operand has 41 states, 41 states have (on average 198.9268292682927) internal successors, (8156), 41 states have internal predecessors, (8156), 0 states have call successors, (0), 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-31 22:18:47,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:18:47,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 636 [2023-08-31 22:18:47,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:18:57,967 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1329 Int)) (not (= (select (store .cse0 .cse1 v_ArrVal_1329) .cse2) 20))) (forall ((v_ArrVal_1328 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| Int) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1329 Int)) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store .cse0 .cse1 v_ArrVal_1322))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1324) .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1328) |c_~#queue~0.base|))) (or (not (= 20 (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| 4)) v_ArrVal_1329) .cse4))) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112|)))) (forall ((v_ArrVal_1328 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| Int) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1329 Int)) (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse8 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_~#queue~0.offset|) v_ArrVal_1322))) (store (store .cse8 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1324) .cse4 (+ (select .cse8 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1328) |c_~#queue~0.base|))) (or (< (select .cse6 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114|) (< (select .cse7 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112|) (not (= (select (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| 4)) v_ArrVal_1329) .cse4) 20)))))))) is different from false [2023-08-31 22:18:58,483 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (and (forall ((v_ArrVal_1328 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| Int) (v_ArrVal_1324 Int) (v_ArrVal_1329 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1324) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1328) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112|) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| 4)) v_ArrVal_1329) .cse1) 20))))) (not (= .cse4 20))))) is different from false [2023-08-31 22:19:00,682 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-31 22:19:00,938 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (and (forall ((v_ArrVal_1328 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| Int) (v_ArrVal_1329 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1328) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| 4)) v_ArrVal_1329) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112|)))) (not (= .cse4 20))))) is different from false [2023-08-31 22:19:01,585 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_1328 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| Int) (v_ArrVal_1329 Int)) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1328) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112|) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| 4)) v_ArrVal_1329) .cse1) 20))))) (forall ((v_ArrVal_1328 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1322 Int) (v_ArrVal_1324 Int) (v_ArrVal_1329 Int)) (let ((.cse5 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1321))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_~#queue~0.offset|) v_ArrVal_1322))) (store (store .cse6 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1324) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1328) |c_~#queue~0.base|))) (or (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112|) (not (= (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_112| 4)) v_ArrVal_1329) .cse1) 20)) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114|)))))))) is different from false [2023-08-31 22:19:06,388 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-31 22:19:08,630 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-31 22:19:09,949 INFO L130 PetriNetUnfolder]: 2929/5861 cut-off events. [2023-08-31 22:19:09,949 INFO L131 PetriNetUnfolder]: For 309360/309518 co-relation queries the response was YES. [2023-08-31 22:19:09,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61822 conditions, 5861 events. 2929/5861 cut-off events. For 309360/309518 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 39289 event pairs, 1002 based on Foata normal form. 128/5834 useless extension candidates. Maximal degree in co-relation 61741. Up to 2951 conditions per place. [2023-08-31 22:19:10,008 INFO L137 encePairwiseOnDemand]: 617/636 looper letters, 429 selfloop transitions, 236 changer transitions 0/670 dead transitions. [2023-08-31 22:19:10,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 670 transitions, 11523 flow [2023-08-31 22:19:10,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-08-31 22:19:10,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-08-31 22:19:10,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 7741 transitions. [2023-08-31 22:19:10,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32029956967891426 [2023-08-31 22:19:10,015 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 7741 transitions. [2023-08-31 22:19:10,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 7741 transitions. [2023-08-31 22:19:10,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:19:10,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 7741 transitions. [2023-08-31 22:19:10,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 203.71052631578948) internal successors, (7741), 38 states have internal predecessors, (7741), 0 states have call successors, (0), 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-31 22:19:10,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 636.0) internal successors, (24804), 39 states have internal predecessors, (24804), 0 states have call successors, (0), 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-31 22:19:10,032 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 636.0) internal successors, (24804), 39 states have internal predecessors, (24804), 0 states have call successors, (0), 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-31 22:19:10,032 INFO L175 Difference]: Start difference. First operand has 238 places, 297 transitions, 3476 flow. Second operand 38 states and 7741 transitions. [2023-08-31 22:19:10,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 670 transitions, 11523 flow [2023-08-31 22:19:10,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 670 transitions, 9674 flow, removed 861 selfloop flow, removed 10 redundant places. [2023-08-31 22:19:10,205 INFO L231 Difference]: Finished difference. Result has 285 places, 473 transitions, 6190 flow [2023-08-31 22:19:10,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=2630, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=6190, PETRI_PLACES=285, PETRI_TRANSITIONS=473} [2023-08-31 22:19:10,205 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 179 predicate places. [2023-08-31 22:19:10,205 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 473 transitions, 6190 flow [2023-08-31 22:19:10,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 198.9268292682927) internal successors, (8156), 41 states have internal predecessors, (8156), 0 states have call successors, (0), 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-31 22:19:10,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:19:10,206 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2023-08-31 22:19:10,213 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-31 22:19:10,407 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,SelfDestructingSolverStorable24 [2023-08-31 22:19:10,407 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-31 22:19:10,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:19:10,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1654104520, now seen corresponding path program 5 times [2023-08-31 22:19:10,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:19:10,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118479425] [2023-08-31 22:19:10,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:19:10,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:19:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:19:14,893 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-31 22:19:14,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:19:14,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118479425] [2023-08-31 22:19:14,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118479425] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:19:14,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598513506] [2023-08-31 22:19:14,893 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 22:19:14,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:19:14,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:19:14,894 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-31 22:19:14,895 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-31 22:19:15,161 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-08-31 22:19:15,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:19:15,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 95 conjunts are in the unsatisfiable core [2023-08-31 22:19:15,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:19:15,319 INFO L321 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2023-08-31 22:19:15,319 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 2 case distinctions, treesize of input 15 treesize of output 26 [2023-08-31 22:19:16,926 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 16 [2023-08-31 22:19:17,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:19:17,139 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 17 treesize of output 19 [2023-08-31 22:19:17,553 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 22:19:17,593 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-08-31 22:19:17,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2023-08-31 22:19:18,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:19:18,003 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 30 treesize of output 30 [2023-08-31 22:19:18,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:19:18,383 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 37 treesize of output 30 [2023-08-31 22:19:19,172 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 55 treesize of output 27 [2023-08-31 22:19:19,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:19:19,567 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 40 treesize of output 38 [2023-08-31 22:19:20,040 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 22:19:20,081 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-08-31 22:19:20,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 49 [2023-08-31 22:19:20,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:19:20,661 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 63 treesize of output 44 [2023-08-31 22:19:21,734 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 81 treesize of output 41 [2023-08-31 22:19:22,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:19:22,135 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 65 treesize of output 59 [2023-08-31 22:19:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:19:22,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:19:23,196 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1458 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1458) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1458 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1458) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2023-08-31 22:19:30,758 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse5 (select |c_#length| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1451 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1451))) (let ((.cse6 (select .cse0 |c_~#queue~0.base|))) (let ((.cse7 (* (select .cse6 .cse3) 4))) (or (forall ((v_ArrVal_1452 Int)) (let ((.cse1 (store .cse6 (+ .cse7 |c_~#queue~0.offset|) v_ArrVal_1452))) (let ((.cse4 (select .cse1 .cse3))) (or (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1455 Int)) (<= (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_1455) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1458) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse5)) (= .cse4 20))))) (< .cse5 (+ .cse7 |c_~#queue~0.offset| 4))))))) (forall ((v_ArrVal_1451 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1451))) (let ((.cse11 (select .cse8 |c_~#queue~0.base|))) (let ((.cse12 (* (select .cse11 .cse3) 4))) (or (forall ((v_ArrVal_1452 Int)) (let ((.cse9 (store .cse11 (+ .cse12 |c_~#queue~0.offset|) v_ArrVal_1452))) (let ((.cse10 (select .cse9 .cse3))) (or (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1455 Int)) (<= 0 (+ (* (select (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse2 v_ArrVal_1455) .cse3 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_1458) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (= .cse10 20))))) (< .cse5 (+ .cse12 |c_~#queue~0.offset| 4))))))))) is different from false [2023-08-31 22:19:33,464 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (select |c_#length| |c_~#queue~0.base|)) (.cse7 (+ 84 |c_~#queue~0.offset|)) (.cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse12 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1446 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1446))) (let ((.cse10 (select .cse9 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse0 (select .cse10 .cse12))) (or (= .cse0 20) (forall ((v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1448 Int)) (let ((.cse4 (store (store .cse9 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1448) .cse12 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1451))) (let ((.cse8 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (* (select .cse8 .cse7) 4))) (or (< .cse1 (+ .cse2 |c_~#queue~0.offset| 4)) (forall ((v_ArrVal_1452 Int)) (let ((.cse5 (store .cse8 (+ .cse2 |c_~#queue~0.offset|) v_ArrVal_1452))) (let ((.cse3 (select .cse5 .cse7))) (or (= .cse3 20) (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1455 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_1455) .cse7 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1458) |c_~#queue~0.base|) .cse7) 4)))))))))))))))))) (forall ((v_ArrVal_1446 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1446))) (let ((.cse20 (select .cse19 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse13 (select .cse20 .cse12))) (or (= .cse13 20) (forall ((v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1448 Int)) (let ((.cse15 (store (store .cse19 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse20 .cse11 v_ArrVal_1448) .cse12 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_1451))) (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (let ((.cse18 (* (select .cse17 .cse7) 4))) (or (forall ((v_ArrVal_1452 Int)) (let ((.cse16 (store .cse17 (+ .cse18 |c_~#queue~0.offset|) v_ArrVal_1452))) (let ((.cse14 (select .cse16 .cse7))) (or (= .cse14 20) (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1455 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse6 v_ArrVal_1455) .cse7 (+ .cse14 1))) |c_~#stored_elements~0.base| v_ArrVal_1458) |c_~#queue~0.base|) .cse7) 4)) .cse1)))))) (< .cse1 (+ .cse18 |c_~#queue~0.offset| 4)))))))))))))) is different from false [2023-08-31 22:19:39,093 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_~#queue~0.base|)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1443 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1443))) (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (let ((.cse13 (+ |c_~#queue~0.offset| (* (select .cse12 .cse6) 4)))) (or (forall ((v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 Int)) (let ((.cse8 (store (store .cse11 |c_~#queue~0.base| (store .cse12 .cse13 v_ArrVal_1445)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1446))) (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (let ((.cse10 (select .cse9 .cse6))) (or (forall ((v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1448 Int)) (let ((.cse3 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_1448) .cse6 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_1451))) (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (let ((.cse1 (* (select .cse7 .cse6) 4))) (or (< .cse0 (+ .cse1 |c_~#queue~0.offset| 4)) (forall ((v_ArrVal_1452 Int)) (let ((.cse4 (store .cse7 (+ .cse1 |c_~#queue~0.offset|) v_ArrVal_1452))) (let ((.cse2 (select .cse4 .cse6))) (or (= .cse2 20) (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1455 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1455) .cse6 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1458) |c_~#queue~0.base|) .cse6) 4) 4) .cse0))))))))))) (= .cse10 20)))))) (< .cse13 0)))))) (forall ((v_ArrVal_1443 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1443))) (let ((.cse23 (select .cse22 |c_~#queue~0.base|))) (let ((.cse24 (+ |c_~#queue~0.offset| (* (select .cse23 .cse6) 4)))) (or (forall ((v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 Int)) (let ((.cse19 (store (store .cse22 |c_~#queue~0.base| (store .cse23 .cse24 v_ArrVal_1445)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1446))) (let ((.cse20 (select .cse19 |c_~#queue~0.base|))) (let ((.cse21 (select .cse20 .cse6))) (or (forall ((v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1448 Int)) (let ((.cse14 (store (store .cse19 |c_~#queue~0.base| (store (store .cse20 .cse5 v_ArrVal_1448) .cse6 (+ .cse21 1))) |c_~#stored_elements~0.base| v_ArrVal_1451))) (let ((.cse17 (select .cse14 |c_~#queue~0.base|))) (let ((.cse18 (* (select .cse17 .cse6) 4))) (or (forall ((v_ArrVal_1452 Int)) (let ((.cse15 (store .cse17 (+ .cse18 |c_~#queue~0.offset|) v_ArrVal_1452))) (let ((.cse16 (select .cse15 .cse6))) (or (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1455 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse5 v_ArrVal_1455) .cse6 (+ .cse16 1))) |c_~#stored_elements~0.base| v_ArrVal_1458) |c_~#queue~0.base|) .cse6) 4)))) (= .cse16 20))))) (< .cse0 (+ .cse18 |c_~#queue~0.offset| 4))))))) (= .cse21 20)))))) (< .cse24 0)))))))) is different from false [2023-08-31 22:19:39,266 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#length| |c_~#queue~0.base|)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse14 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_1443 (Array Int Int))) (let ((.cse11 (store .cse14 |c_~#stored_elements~0.base| v_ArrVal_1443))) (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (let ((.cse13 (+ (* (select .cse12 .cse4) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 Int)) (let ((.cse9 (store (store .cse11 |c_~#queue~0.base| (store .cse12 .cse13 v_ArrVal_1445)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1446))) (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (select .cse10 .cse4))) (or (= .cse0 20) (forall ((v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1448 Int)) (let ((.cse1 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse3 v_ArrVal_1448) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1451))) (let ((.cse7 (select .cse1 |c_~#queue~0.base|))) (let ((.cse8 (* (select .cse7 .cse4) 4))) (or (forall ((v_ArrVal_1452 Int)) (let ((.cse2 (store .cse7 (+ .cse8 |c_~#queue~0.offset|) v_ArrVal_1452))) (let ((.cse5 (select .cse2 .cse4))) (or (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1455 Int)) (<= (+ (* (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1455) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1458) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) .cse6)) (= .cse5 20))))) (< .cse6 (+ .cse8 |c_~#queue~0.offset| 4)))))))))))) (< .cse13 0)))))) (forall ((v_ArrVal_1443 (Array Int Int))) (let ((.cse24 (store .cse14 |c_~#stored_elements~0.base| v_ArrVal_1443))) (let ((.cse25 (select .cse24 |c_~#queue~0.base|))) (let ((.cse15 (+ (* (select .cse25 .cse4) 4) |c_~#queue~0.offset|))) (or (< .cse15 0) (forall ((v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 Int)) (let ((.cse21 (store (store .cse24 |c_~#queue~0.base| (store .cse25 .cse15 v_ArrVal_1445)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1446))) (let ((.cse22 (select .cse21 |c_~#queue~0.base|))) (let ((.cse23 (select .cse22 .cse4))) (or (forall ((v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1448 Int)) (let ((.cse16 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse3 v_ArrVal_1448) .cse4 (+ .cse23 1))) |c_~#stored_elements~0.base| v_ArrVal_1451))) (let ((.cse19 (select .cse16 |c_~#queue~0.base|))) (let ((.cse20 (* (select .cse19 .cse4) 4))) (or (forall ((v_ArrVal_1452 Int)) (let ((.cse17 (store .cse19 (+ .cse20 |c_~#queue~0.offset|) v_ArrVal_1452))) (let ((.cse18 (select .cse17 .cse4))) (or (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1455 Int)) (<= 0 (+ (* (select (select (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse3 v_ArrVal_1455) .cse4 (+ .cse18 1))) |c_~#stored_elements~0.base| v_ArrVal_1458) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (= .cse18 20))))) (< .cse6 (+ .cse20 |c_~#queue~0.offset| 4))))))) (= .cse23 20))))))))))))) is different from false [2023-08-31 22:19:39,434 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#length| |c_~#queue~0.base|)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse6 (+ 84 |c_~#queue~0.offset|)) (.cse14 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse26 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse27 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse26 .cse27 (+ (select .cse26 .cse27) 1)))))) (and (forall ((v_ArrVal_1443 (Array Int Int))) (let ((.cse11 (store .cse14 |c_~#stored_elements~0.base| v_ArrVal_1443))) (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (let ((.cse13 (+ |c_~#queue~0.offset| (* (select .cse12 .cse6) 4)))) (or (forall ((v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 Int)) (let ((.cse9 (store (store .cse11 |c_~#queue~0.base| (store .cse12 .cse13 v_ArrVal_1445)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1446))) (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (select .cse10 .cse6))) (or (= .cse0 20) (forall ((v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1448 Int)) (let ((.cse3 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse5 v_ArrVal_1448) .cse6 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1451))) (let ((.cse8 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (* (select .cse8 .cse6) 4))) (or (< .cse1 (+ .cse2 |c_~#queue~0.offset| 4)) (forall ((v_ArrVal_1452 Int)) (let ((.cse4 (store .cse8 (+ .cse2 |c_~#queue~0.offset|) v_ArrVal_1452))) (let ((.cse7 (select .cse4 .cse6))) (or (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1455 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1455) .cse6 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1458) |c_~#queue~0.base|) .cse6) 4) 4) .cse1)) (= .cse7 20))))))))))))))) (< .cse13 0)))))) (forall ((v_ArrVal_1443 (Array Int Int))) (let ((.cse23 (store .cse14 |c_~#stored_elements~0.base| v_ArrVal_1443))) (let ((.cse24 (select .cse23 |c_~#queue~0.base|))) (let ((.cse25 (+ |c_~#queue~0.offset| (* (select .cse24 .cse6) 4)))) (or (forall ((v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 Int)) (let ((.cse21 (store (store .cse23 |c_~#queue~0.base| (store .cse24 .cse25 v_ArrVal_1445)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1446))) (let ((.cse22 (select .cse21 |c_~#queue~0.base|))) (let ((.cse15 (select .cse22 .cse6))) (or (= .cse15 20) (forall ((v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1448 Int)) (let ((.cse16 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse5 v_ArrVal_1448) .cse6 (+ .cse15 1))) |c_~#stored_elements~0.base| v_ArrVal_1451))) (let ((.cse19 (select .cse16 |c_~#queue~0.base|))) (let ((.cse20 (* (select .cse19 .cse6) 4))) (or (forall ((v_ArrVal_1452 Int)) (let ((.cse17 (store .cse19 (+ .cse20 |c_~#queue~0.offset|) v_ArrVal_1452))) (let ((.cse18 (select .cse17 .cse6))) (or (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1455 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse5 v_ArrVal_1455) .cse6 (+ .cse18 1))) |c_~#stored_elements~0.base| v_ArrVal_1458) |c_~#queue~0.base|) .cse6) 4)))) (= .cse18 20))))) (< .cse1 (+ .cse20 |c_~#queue~0.offset| 4)))))))))))) (< .cse25 0)))))))) is different from false [2023-08-31 22:19:39,509 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 22:19:39,509 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 4924 treesize of output 2194 [2023-08-31 22:19:39,584 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 22:19:39,585 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 2551 treesize of output 2489 [2023-08-31 22:19:39,633 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 1080 treesize of output 1044 [2023-08-31 22:19:39,665 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 1032 treesize of output 996 [2023-08-31 22:19:39,697 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 1011 treesize of output 979 [2023-08-31 22:19:39,733 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 979 treesize of output 963 [2023-08-31 22:19:39,769 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 958 treesize of output 950 [2023-08-31 22:19:39,790 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 960 treesize of output 944 [2023-08-31 22:19:39,826 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 959 treesize of output 927 [2023-08-31 22:19:39,864 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 917 treesize of output 909 [2023-08-31 22:19:39,942 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 7 treesize of output 3 [2023-08-31 22:19:42,667 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 22:19:42,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2633 treesize of output 1805 [2023-08-31 22:19:45,555 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 16 refuted. 1 times theorem prover too weak. 0 trivial. 10 not checked. [2023-08-31 22:19:45,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598513506] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:19:45,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:19:45,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 22] total 55 [2023-08-31 22:19:45,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795106867] [2023-08-31 22:19:45,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:19:45,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-08-31 22:19:45,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:19:45,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-08-31 22:19:45,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=2173, Unknown=58, NotChecked=618, Total=3192 [2023-08-31 22:19:46,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-31 22:19:46,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 473 transitions, 6190 flow. Second operand has 57 states, 57 states have (on average 167.57894736842104) internal successors, (9552), 57 states have internal predecessors, (9552), 0 states have call successors, (0), 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-31 22:19:46,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:19:46,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-31 22:19:46,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:20:19,366 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-31 22:20:28,221 INFO L130 PetriNetUnfolder]: 3603/7173 cut-off events. [2023-08-31 22:20:28,221 INFO L131 PetriNetUnfolder]: For 639575/641688 co-relation queries the response was YES. [2023-08-31 22:20:28,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87655 conditions, 7173 events. 3603/7173 cut-off events. For 639575/641688 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 45667 event pairs, 571 based on Foata normal form. 173/7092 useless extension candidates. Maximal degree in co-relation 87556. Up to 2779 conditions per place. [2023-08-31 22:20:28,303 INFO L137 encePairwiseOnDemand]: 625/636 looper letters, 546 selfloop transitions, 157 changer transitions 0/708 dead transitions. [2023-08-31 22:20:28,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 708 transitions, 12855 flow [2023-08-31 22:20:28,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-31 22:20:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-31 22:20:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4587 transitions. [2023-08-31 22:20:28,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27739477503628446 [2023-08-31 22:20:28,306 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 4587 transitions. [2023-08-31 22:20:28,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 4587 transitions. [2023-08-31 22:20:28,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:20:28,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4587 transitions. [2023-08-31 22:20:28,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 176.42307692307693) internal successors, (4587), 26 states have internal predecessors, (4587), 0 states have call successors, (0), 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-31 22:20:28,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 636.0) internal successors, (17172), 27 states have internal predecessors, (17172), 0 states have call successors, (0), 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-31 22:20:28,318 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 636.0) internal successors, (17172), 27 states have internal predecessors, (17172), 0 states have call successors, (0), 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-31 22:20:28,318 INFO L175 Difference]: Start difference. First operand has 285 places, 473 transitions, 6190 flow. Second operand 26 states and 4587 transitions. [2023-08-31 22:20:28,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 708 transitions, 12855 flow [2023-08-31 22:20:28,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 708 transitions, 10998 flow, removed 857 selfloop flow, removed 21 redundant places. [2023-08-31 22:20:28,577 INFO L231 Difference]: Finished difference. Result has 291 places, 492 transitions, 5618 flow [2023-08-31 22:20:28,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=4852, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=5618, PETRI_PLACES=291, PETRI_TRANSITIONS=492} [2023-08-31 22:20:28,578 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 185 predicate places. [2023-08-31 22:20:28,578 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 492 transitions, 5618 flow [2023-08-31 22:20:28,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 167.57894736842104) internal successors, (9552), 57 states have internal predecessors, (9552), 0 states have call successors, (0), 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-31 22:20:28,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:20:28,580 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2023-08-31 22:20:28,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-31 22:20:28,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-31 22:20:28,780 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-31 22:20:28,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:20:28,781 INFO L85 PathProgramCache]: Analyzing trace with hash -507515038, now seen corresponding path program 1 times [2023-08-31 22:20:28,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:20:28,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207014158] [2023-08-31 22:20:28,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:20:28,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:20:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:20:29,874 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:20:29,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:20:29,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207014158] [2023-08-31 22:20:29,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207014158] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:20:29,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270266171] [2023-08-31 22:20:29,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:20:29,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:20:29,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:20:29,875 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 22:20:29,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-31 22:20:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:20:30,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-31 22:20:30,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:20:30,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:20:30,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:20:30,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:20:30,082 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-31 22:20:31,874 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:20:31,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:20:33,068 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:20:33,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270266171] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:20:33,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:20:33,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2023-08-31 22:20:33,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648529156] [2023-08-31 22:20:33,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:20:33,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-31 22:20:33,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:20:33,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-31 22:20:33,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2023-08-31 22:21:03,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 636 [2023-08-31 22:21:03,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 492 transitions, 5618 flow. Second operand has 20 states, 20 states have (on average 262.85) internal successors, (5257), 20 states have internal predecessors, (5257), 0 states have call successors, (0), 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-31 22:21:03,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:21:03,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 636 [2023-08-31 22:21:03,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:21:11,690 INFO L130 PetriNetUnfolder]: 4778/9617 cut-off events. [2023-08-31 22:21:11,690 INFO L131 PetriNetUnfolder]: For 890614/895258 co-relation queries the response was YES. [2023-08-31 22:21:11,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126659 conditions, 9617 events. 4778/9617 cut-off events. For 890614/895258 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 63514 event pairs, 1387 based on Foata normal form. 367/9703 useless extension candidates. Maximal degree in co-relation 126569. Up to 3983 conditions per place. [2023-08-31 22:21:11,798 INFO L137 encePairwiseOnDemand]: 631/636 looper letters, 606 selfloop transitions, 59 changer transitions 0/710 dead transitions. [2023-08-31 22:21:11,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 710 transitions, 11449 flow [2023-08-31 22:21:11,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-31 22:21:11,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-31 22:21:11,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 3527 transitions. [2023-08-31 22:21:11,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4265844218674407 [2023-08-31 22:21:11,801 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 3527 transitions. [2023-08-31 22:21:11,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 3527 transitions. [2023-08-31 22:21:11,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:21:11,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 3527 transitions. [2023-08-31 22:21:11,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 271.3076923076923) internal successors, (3527), 13 states have internal predecessors, (3527), 0 states have call successors, (0), 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-31 22:21:11,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 636.0) internal successors, (8904), 14 states have internal predecessors, (8904), 0 states have call successors, (0), 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-31 22:21:11,808 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 636.0) internal successors, (8904), 14 states have internal predecessors, (8904), 0 states have call successors, (0), 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-31 22:21:11,808 INFO L175 Difference]: Start difference. First operand has 291 places, 492 transitions, 5618 flow. Second operand 13 states and 3527 transitions. [2023-08-31 22:21:11,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 710 transitions, 11449 flow [2023-08-31 22:21:12,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 710 transitions, 10853 flow, removed 207 selfloop flow, removed 9 redundant places. [2023-08-31 22:21:12,073 INFO L231 Difference]: Finished difference. Result has 300 places, 499 transitions, 5624 flow [2023-08-31 22:21:12,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=5333, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5624, PETRI_PLACES=300, PETRI_TRANSITIONS=499} [2023-08-31 22:21:12,074 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 194 predicate places. [2023-08-31 22:21:12,074 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 499 transitions, 5624 flow [2023-08-31 22:21:12,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 262.85) internal successors, (5257), 20 states have internal predecessors, (5257), 0 states have call successors, (0), 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-31 22:21:12,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:21:12,074 INFO L208 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 10, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1] [2023-08-31 22:21:12,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-31 22:21:12,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-31 22:21:12,275 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-31 22:21:12,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:21:12,275 INFO L85 PathProgramCache]: Analyzing trace with hash -52635618, now seen corresponding path program 2 times [2023-08-31 22:21:12,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:21:12,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633626721] [2023-08-31 22:21:12,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:21:12,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:21:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:21:19,416 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 220 proven. 105 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-08-31 22:21:19,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:21:19,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633626721] [2023-08-31 22:21:19,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633626721] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:21:19,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538063508] [2023-08-31 22:21:19,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 22:21:19,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:21:19,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:21:19,417 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 22:21:19,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-31 22:21:19,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 22:21:19,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:21:19,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 1017 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-31 22:21:19,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:21:19,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:21:19,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:21:19,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:21:19,706 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-31 22:21:24,415 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 403 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:21:24,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:21:24,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538063508] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:21:24,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-31 22:21:24,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [25] total 38 [2023-08-31 22:21:24,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409541522] [2023-08-31 22:21:24,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:21:24,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-31 22:21:24,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:21:24,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-31 22:21:24,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1206, Unknown=0, NotChecked=0, Total=1482 [2023-08-31 22:21:30,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 636 [2023-08-31 22:21:30,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 499 transitions, 5624 flow. Second operand has 15 states, 15 states have (on average 263.26666666666665) internal successors, (3949), 15 states have internal predecessors, (3949), 0 states have call successors, (0), 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-31 22:21:30,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:21:30,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 636 [2023-08-31 22:21:30,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:21:34,873 INFO L130 PetriNetUnfolder]: 4724/9502 cut-off events. [2023-08-31 22:21:34,873 INFO L131 PetriNetUnfolder]: For 883115/886735 co-relation queries the response was YES. [2023-08-31 22:21:34,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123538 conditions, 9502 events. 4724/9502 cut-off events. For 883115/886735 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 62358 event pairs, 770 based on Foata normal form. 49/9308 useless extension candidates. Maximal degree in co-relation 123445. Up to 3935 conditions per place. [2023-08-31 22:21:34,982 INFO L137 encePairwiseOnDemand]: 631/636 looper letters, 608 selfloop transitions, 66 changer transitions 0/719 dead transitions. [2023-08-31 22:21:34,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 719 transitions, 11435 flow [2023-08-31 22:21:34,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-31 22:21:34,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-31 22:21:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 4054 transitions. [2023-08-31 22:21:34,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4249475890985325 [2023-08-31 22:21:34,985 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 4054 transitions. [2023-08-31 22:21:34,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 4054 transitions. [2023-08-31 22:21:34,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:21:34,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 4054 transitions. [2023-08-31 22:21:34,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 270.26666666666665) internal successors, (4054), 15 states have internal predecessors, (4054), 0 states have call successors, (0), 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-31 22:21:34,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 636.0) internal successors, (10176), 16 states have internal predecessors, (10176), 0 states have call successors, (0), 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-31 22:21:34,993 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 636.0) internal successors, (10176), 16 states have internal predecessors, (10176), 0 states have call successors, (0), 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-31 22:21:34,993 INFO L175 Difference]: Start difference. First operand has 300 places, 499 transitions, 5624 flow. Second operand 15 states and 4054 transitions. [2023-08-31 22:21:34,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 719 transitions, 11435 flow [2023-08-31 22:21:35,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 719 transitions, 11265 flow, removed 37 selfloop flow, removed 6 redundant places. [2023-08-31 22:21:35,254 INFO L231 Difference]: Finished difference. Result has 308 places, 503 transitions, 5630 flow [2023-08-31 22:21:35,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=5430, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5630, PETRI_PLACES=308, PETRI_TRANSITIONS=503} [2023-08-31 22:21:35,255 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 202 predicate places. [2023-08-31 22:21:35,255 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 503 transitions, 5630 flow [2023-08-31 22:21:35,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 263.26666666666665) internal successors, (3949), 15 states have internal predecessors, (3949), 0 states have call successors, (0), 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-31 22:21:35,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:21:35,256 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:21:35,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-31 22:21:35,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-31 22:21:35,464 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-31 22:21:35,464 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:21:35,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1101335093, now seen corresponding path program 1 times [2023-08-31 22:21:35,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:21:35,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214240988] [2023-08-31 22:21:35,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:21:35,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:21:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:21:35,590 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2023-08-31 22:21:35,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:21:35,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214240988] [2023-08-31 22:21:35,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214240988] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:21:35,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:21:35,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 22:21:35,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448946142] [2023-08-31 22:21:35,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:21:35,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:21:35,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:21:35,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:21:35,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:21:35,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 636 [2023-08-31 22:21:35,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 503 transitions, 5630 flow. Second operand has 3 states, 3 states have (on average 268.0) internal successors, (804), 3 states have internal predecessors, (804), 0 states have call successors, (0), 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-31 22:21:35,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:21:35,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 636 [2023-08-31 22:21:35,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:21:37,749 INFO L130 PetriNetUnfolder]: 2753/6264 cut-off events. [2023-08-31 22:21:37,750 INFO L131 PetriNetUnfolder]: For 675920/675920 co-relation queries the response was YES. [2023-08-31 22:21:37,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73091 conditions, 6264 events. 2753/6264 cut-off events. For 675920/675920 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 38033 event pairs, 382 based on Foata normal form. 970/7094 useless extension candidates. Maximal degree in co-relation 72997. Up to 5361 conditions per place. [2023-08-31 22:21:37,813 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 413 selfloop transitions, 4 changer transitions 0/460 dead transitions. [2023-08-31 22:21:37,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 460 transitions, 6222 flow [2023-08-31 22:21:37,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:21:37,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:21:37,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 837 transitions. [2023-08-31 22:21:37,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4386792452830189 [2023-08-31 22:21:37,815 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 837 transitions. [2023-08-31 22:21:37,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 837 transitions. [2023-08-31 22:21:37,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:21:37,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 837 transitions. [2023-08-31 22:21:37,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 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-31 22:21:37,817 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-31 22:21:37,817 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-31 22:21:37,817 INFO L175 Difference]: Start difference. First operand has 308 places, 503 transitions, 5630 flow. Second operand 3 states and 837 transitions. [2023-08-31 22:21:37,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 460 transitions, 6222 flow [2023-08-31 22:21:38,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 460 transitions, 6090 flow, removed 7 selfloop flow, removed 13 redundant places. [2023-08-31 22:21:38,006 INFO L231 Difference]: Finished difference. Result has 297 places, 451 transitions, 5079 flow [2023-08-31 22:21:38,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=5071, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=5079, PETRI_PLACES=297, PETRI_TRANSITIONS=451} [2023-08-31 22:21:38,007 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 191 predicate places. [2023-08-31 22:21:38,007 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 451 transitions, 5079 flow [2023-08-31 22:21:38,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 268.0) internal successors, (804), 3 states have internal predecessors, (804), 0 states have call successors, (0), 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-31 22:21:38,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:21:38,007 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:21:38,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-31 22:21:38,007 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-31 22:21:38,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:21:38,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1757161889, now seen corresponding path program 1 times [2023-08-31 22:21:38,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:21:38,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822265431] [2023-08-31 22:21:38,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:21:38,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:21:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:21:38,638 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:21:38,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:21:38,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822265431] [2023-08-31 22:21:38,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822265431] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:21:38,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849866102] [2023-08-31 22:21:38,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:21:38,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:21:38,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:21:38,640 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 22:21:38,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-31 22:21:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:21:38,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-31 22:21:38,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:21:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:21:39,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:21:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:21:40,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849866102] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:21:40,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:21:40,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2023-08-31 22:21:40,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663534418] [2023-08-31 22:21:40,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:21:40,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-31 22:21:40,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:21:40,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-31 22:21:40,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2023-08-31 22:21:41,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-31 22:21:41,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 451 transitions, 5079 flow. Second operand has 23 states, 23 states have (on average 268.6521739130435) internal successors, (6179), 23 states have internal predecessors, (6179), 0 states have call successors, (0), 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-31 22:21:41,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:21:41,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-31 22:21:41,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15