./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread/queue_ok_longer.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations 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_longer.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 22:08:07,237 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 22:08:07,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 22:08:07,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 22:08:07,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 22:08:07,283 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 22:08:07,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 22:08:07,288 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 22:08:07,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 22:08:07,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 22:08:07,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 22:08:07,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 22:08:07,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 22:08:07,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 22:08:07,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 22:08:07,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 22:08:07,308 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 22:08:07,309 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 22:08:07,310 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 22:08:07,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 22:08:07,316 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 22:08:07,322 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 22:08:07,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 22:08:07,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 22:08:07,332 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 22:08:07,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 22:08:07,332 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 22:08:07,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 22:08:07,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 22:08:07,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 22:08:07,340 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 22:08:07,341 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 22:08:07,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 22:08:07,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 22:08:07,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 22:08:07,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 22:08:07,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 22:08:07,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 22:08:07,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 22:08:07,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 22:08:07,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 22:08:07,347 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:08:07,374 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 22:08:07,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 22:08:07,376 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 22:08:07,376 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 22:08:07,377 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 22:08:07,377 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 22:08:07,377 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 22:08:07,378 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 22:08:07,378 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 22:08:07,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 22:08:07,379 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 22:08:07,379 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 22:08:07,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 22:08:07,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 22:08:07,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 22:08:07,380 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 22:08:07,380 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 22:08:07,380 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 22:08:07,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 22:08:07,381 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 22:08:07,381 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 22:08:07,381 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 22:08:07,381 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 22:08:07,381 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 22:08:07,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 22:08:07,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 22:08:07,382 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 22:08:07,382 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 22:08:07,382 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 22:08:07,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 22:08:07,383 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 22:08:07,383 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 22:08:07,383 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 22:08:07,383 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 22:08:07,384 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 22:08:07,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 22:08:07,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 22:08:07,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 22:08:07,704 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 22:08:07,705 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 22:08:07,706 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longer.i [2023-08-31 22:08:08,976 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 22:08:09,260 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 22:08:09,261 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i [2023-08-31 22:08:09,289 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47149b643/365a133fa318496688472f4d10b5758a/FLAG68e973449 [2023-08-31 22:08:09,302 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47149b643/365a133fa318496688472f4d10b5758a [2023-08-31 22:08:09,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 22:08:09,305 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 22:08:09,306 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 22:08:09,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 22:08:09,310 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 22:08:09,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 10:08:09" (1/1) ... [2023-08-31 22:08:09,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db16559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:08:09, skipping insertion in model container [2023-08-31 22:08:09,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 10:08:09" (1/1) ... [2023-08-31 22:08:09,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 22:08:09,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 22:08:09,889 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43272,43285] [2023-08-31 22:08:09,897 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43545,43558] [2023-08-31 22:08:09,905 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 22:08:09,921 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 22:08:09,984 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43272,43285] [2023-08-31 22:08:09,990 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43545,43558] [2023-08-31 22:08:09,998 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 22:08:10,062 INFO L208 MainTranslator]: Completed translation [2023-08-31 22:08:10,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:08:10 WrapperNode [2023-08-31 22:08:10,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 22:08:10,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 22:08:10,064 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 22:08:10,064 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 22:08:10,070 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:08:10" (1/1) ... [2023-08-31 22:08:10,103 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:08:10" (1/1) ... [2023-08-31 22:08:10,141 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2023-08-31 22:08:10,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 22:08:10,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 22:08:10,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 22:08:10,144 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 22:08:10,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:08:10" (1/1) ... [2023-08-31 22:08:10,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:08:10" (1/1) ... [2023-08-31 22:08:10,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:08:10" (1/1) ... [2023-08-31 22:08:10,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:08:10" (1/1) ... [2023-08-31 22:08:10,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:08:10" (1/1) ... [2023-08-31 22:08:10,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:08:10" (1/1) ... [2023-08-31 22:08:10,198 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:08:10" (1/1) ... [2023-08-31 22:08:10,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:08:10" (1/1) ... [2023-08-31 22:08:10,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 22:08:10,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 22:08:10,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 22:08:10,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 22:08:10,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:08:10" (1/1) ... [2023-08-31 22:08:10,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 22:08:10,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:08:10,245 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:08:10,275 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:08:10,289 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-31 22:08:10,290 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-31 22:08:10,291 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-31 22:08:10,291 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-31 22:08:10,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 22:08:10,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 22:08:10,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 22:08:10,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 22:08:10,292 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-31 22:08:10,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 22:08:10,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 22:08:10,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 22:08:10,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 22:08:10,294 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:08:10,460 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 22:08:10,462 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 22:08:10,992 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 22:08:11,001 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 22:08:11,001 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-31 22:08:11,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 10:08:11 BoogieIcfgContainer [2023-08-31 22:08:11,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 22:08:11,005 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 22:08:11,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 22:08:11,008 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 22:08:11,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 10:08:09" (1/3) ... [2023-08-31 22:08:11,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20bb6293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 10:08:11, skipping insertion in model container [2023-08-31 22:08:11,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:08:10" (2/3) ... [2023-08-31 22:08:11,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20bb6293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 10:08:11, skipping insertion in model container [2023-08-31 22:08:11,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 10:08:11" (3/3) ... [2023-08-31 22:08:11,011 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2023-08-31 22:08:11,026 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 22:08:11,027 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2023-08-31 22:08:11,027 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 22:08:11,136 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-31 22:08:11,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 278 transitions, 572 flow [2023-08-31 22:08:11,319 INFO L130 PetriNetUnfolder]: 13/276 cut-off events. [2023-08-31 22:08:11,321 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 22:08:11,330 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:08:11,331 INFO L82 GeneralOperation]: Start removeDead. Operand has 272 places, 278 transitions, 572 flow [2023-08-31 22:08:11,339 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 266 places, 272 transitions, 556 flow [2023-08-31 22:08:11,345 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 22:08:11,359 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 266 places, 272 transitions, 556 flow [2023-08-31 22:08:11,361 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 266 places, 272 transitions, 556 flow [2023-08-31 22:08:11,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 272 transitions, 556 flow [2023-08-31 22:08:11,434 INFO L130 PetriNetUnfolder]: 13/272 cut-off events. [2023-08-31 22:08:11,434 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 22:08:11,438 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:08:11,448 INFO L119 LiptonReduction]: Number of co-enabled transitions 17820 [2023-08-31 22:08:24,187 INFO L134 LiptonReduction]: Checked pairs total: 64286 [2023-08-31 22:08:24,187 INFO L136 LiptonReduction]: Total number of compositions: 358 [2023-08-31 22:08:24,200 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 22:08:24,205 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;@32e34173, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 22:08:24,206 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2023-08-31 22:08:24,207 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 22:08:24,207 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 22:08:24,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:08:24,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 22:08:24,208 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:08:24,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:08:24,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1161, now seen corresponding path program 1 times [2023-08-31 22:08:24,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:08:24,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717586474] [2023-08-31 22:08:24,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:24,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:08:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:24,331 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:08:24,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:08:24,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717586474] [2023-08-31 22:08:24,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717586474] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:08:24,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:08:24,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 22:08:24,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814470595] [2023-08-31 22:08:24,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:08:24,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 22:08:24,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:08:24,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 22:08:24,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 22:08:24,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 636 [2023-08-31 22:08:24,408 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:08:24,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:08:24,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 636 [2023-08-31 22:08:24,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:08:25,085 INFO L130 PetriNetUnfolder]: 3797/6059 cut-off events. [2023-08-31 22:08:25,086 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2023-08-31 22:08:25,091 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:08:25,151 INFO L137 encePairwiseOnDemand]: 600/636 looper letters, 61 selfloop transitions, 0 changer transitions 0/70 dead transitions. [2023-08-31 22:08:25,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 70 transitions, 274 flow [2023-08-31 22:08:25,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 22:08:25,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 22:08:25,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 631 transitions. [2023-08-31 22:08:25,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4960691823899371 [2023-08-31 22:08:25,166 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 631 transitions. [2023-08-31 22:08:25,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 631 transitions. [2023-08-31 22:08:25,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:08:25,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 631 transitions. [2023-08-31 22:08:25,175 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:08:25,181 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:08:25,182 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:08:25,184 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:08:25,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 70 transitions, 274 flow [2023-08-31 22:08:25,189 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:08:25,192 INFO L231 Difference]: Finished difference. Result has 67 places, 70 transitions, 144 flow [2023-08-31 22:08:25,193 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:08:25,197 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -39 predicate places. [2023-08-31 22:08:25,197 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 144 flow [2023-08-31 22:08:25,198 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:08:25,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:08:25,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 22:08:25,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 22:08:25,199 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:08:25,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:08:25,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1154497, now seen corresponding path program 1 times [2023-08-31 22:08:25,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:08:25,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024388746] [2023-08-31 22:08:25,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:25,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:08:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:25,433 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:08:25,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:08:25,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024388746] [2023-08-31 22:08:25,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024388746] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:08:25,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:08:25,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 22:08:25,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168745193] [2023-08-31 22:08:25,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:08:25,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:08:25,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:08:25,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:08:25,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:08:25,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 636 [2023-08-31 22:08:25,572 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:08:25,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:08:25,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 636 [2023-08-31 22:08:25,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:08:26,083 INFO L130 PetriNetUnfolder]: 3749/5963 cut-off events. [2023-08-31 22:08:26,084 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-31 22:08:26,089 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:08:26,124 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 57 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-08-31 22:08:26,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 258 flow [2023-08-31 22:08:26,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:08:26,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:08:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 835 transitions. [2023-08-31 22:08:26,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43763102725366876 [2023-08-31 22:08:26,127 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 835 transitions. [2023-08-31 22:08:26,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 835 transitions. [2023-08-31 22:08:26,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:08:26,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 835 transitions. [2023-08-31 22:08:26,147 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:08:26,153 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:08:26,154 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:08:26,154 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:08:26,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 258 flow [2023-08-31 22:08:26,156 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:08:26,158 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 144 flow [2023-08-31 22:08:26,158 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:08:26,159 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -39 predicate places. [2023-08-31 22:08:26,159 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 144 flow [2023-08-31 22:08:26,160 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:08:26,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:08:26,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 22:08:26,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 22:08:26,161 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:08:26,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:08:26,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1154498, now seen corresponding path program 1 times [2023-08-31 22:08:26,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:08:26,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238372460] [2023-08-31 22:08:26,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:26,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:08:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:26,329 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:08:26,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:08:26,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238372460] [2023-08-31 22:08:26,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238372460] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:08:26,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:08:26,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 22:08:26,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153471356] [2023-08-31 22:08:26,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:08:26,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:08:26,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:08:26,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:08:26,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:08:26,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-31 22:08:26,447 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:08:26,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:08:26,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-31 22:08:26,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:08:26,959 INFO L130 PetriNetUnfolder]: 3701/5867 cut-off events. [2023-08-31 22:08:26,960 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-31 22:08:26,964 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:08:26,989 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 55 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-31 22:08:26,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 66 transitions, 254 flow [2023-08-31 22:08:26,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:08:26,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:08:26,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 845 transitions. [2023-08-31 22:08:26,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44287211740041926 [2023-08-31 22:08:26,993 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 845 transitions. [2023-08-31 22:08:26,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 845 transitions. [2023-08-31 22:08:26,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:08:26,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 845 transitions. [2023-08-31 22:08:26,996 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:08:26,999 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:08:27,001 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:08:27,001 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:08:27,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 66 transitions, 254 flow [2023-08-31 22:08:27,002 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:08:27,003 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 140 flow [2023-08-31 22:08:27,003 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:08:27,004 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -41 predicate places. [2023-08-31 22:08:27,004 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 140 flow [2023-08-31 22:08:27,005 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:08:27,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:08:27,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 22:08:27,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 22:08:27,006 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:08:27,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:08:27,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1109496233, now seen corresponding path program 1 times [2023-08-31 22:08:27,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:08:27,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323144554] [2023-08-31 22:08:27,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:27,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:08:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:27,404 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:08:27,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:08:27,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323144554] [2023-08-31 22:08:27,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323144554] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:08:27,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:08:27,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 22:08:27,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581771156] [2023-08-31 22:08:27,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:08:27,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:08:27,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:08:27,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:08:27,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:08:27,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 636 [2023-08-31 22:08:27,534 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:08:27,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:08:27,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 636 [2023-08-31 22:08:27,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:08:28,067 INFO L130 PetriNetUnfolder]: 3800/6080 cut-off events. [2023-08-31 22:08:28,067 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-31 22:08:28,074 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:08:28,098 INFO L137 encePairwiseOnDemand]: 630/636 looper letters, 63 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2023-08-31 22:08:28,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 75 transitions, 292 flow [2023-08-31 22:08:28,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:08:28,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:08:28,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 831 transitions. [2023-08-31 22:08:28,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43553459119496857 [2023-08-31 22:08:28,102 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 831 transitions. [2023-08-31 22:08:28,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 831 transitions. [2023-08-31 22:08:28,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:08:28,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 831 transitions. [2023-08-31 22:08:28,104 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:08:28,108 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:08:28,109 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:08:28,109 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:08:28,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 75 transitions, 292 flow [2023-08-31 22:08:28,110 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:08:28,112 INFO L231 Difference]: Finished difference. Result has 66 places, 69 transitions, 164 flow [2023-08-31 22:08:28,112 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:08:28,113 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -40 predicate places. [2023-08-31 22:08:28,113 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 69 transitions, 164 flow [2023-08-31 22:08:28,113 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:08:28,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:08:28,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 22:08:28,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 22:08:28,114 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:08:28,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:08:28,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1109496236, now seen corresponding path program 1 times [2023-08-31 22:08:28,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:08:28,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202976483] [2023-08-31 22:08:28,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:28,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:08:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:28,170 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:08:28,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:08:28,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202976483] [2023-08-31 22:08:28,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202976483] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:08:28,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:08:28,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 22:08:28,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746403658] [2023-08-31 22:08:28,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:08:28,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:08:28,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:08:28,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:08:28,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:08:28,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 636 [2023-08-31 22:08:28,283 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:08:28,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:08:28,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 636 [2023-08-31 22:08:28,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:08:28,684 INFO L130 PetriNetUnfolder]: 3253/5163 cut-off events. [2023-08-31 22:08:28,684 INFO L131 PetriNetUnfolder]: For 213/296 co-relation queries the response was YES. [2023-08-31 22:08:28,690 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:08:28,711 INFO L137 encePairwiseOnDemand]: 631/636 looper letters, 54 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-31 22:08:28,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 66 transitions, 270 flow [2023-08-31 22:08:28,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:08:28,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:08:28,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 849 transitions. [2023-08-31 22:08:28,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4449685534591195 [2023-08-31 22:08:28,714 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 849 transitions. [2023-08-31 22:08:28,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 849 transitions. [2023-08-31 22:08:28,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:08:28,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 849 transitions. [2023-08-31 22:08:28,716 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:08:28,720 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:08:28,721 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:08:28,721 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:08:28,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 66 transitions, 270 flow [2023-08-31 22:08:28,722 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:08:28,724 INFO L231 Difference]: Finished difference. Result has 64 places, 66 transitions, 158 flow [2023-08-31 22:08:28,724 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:08:28,726 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -42 predicate places. [2023-08-31 22:08:28,726 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 158 flow [2023-08-31 22:08:28,727 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:08:28,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:08:28,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 22:08:28,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 22:08:28,728 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:08:28,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:08:28,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1109495978, now seen corresponding path program 1 times [2023-08-31 22:08:28,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:08:28,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029878708] [2023-08-31 22:08:28,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:28,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:08:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:28,824 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:08:28,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:08:28,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029878708] [2023-08-31 22:08:28,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029878708] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:08:28,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:08:28,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 22:08:28,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113783964] [2023-08-31 22:08:28,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:08:28,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:08:28,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:08:28,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:08:28,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:08:28,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-31 22:08:28,934 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:08:28,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:08:28,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-31 22:08:28,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:08:29,247 INFO L130 PetriNetUnfolder]: 2363/3821 cut-off events. [2023-08-31 22:08:29,247 INFO L131 PetriNetUnfolder]: For 169/231 co-relation queries the response was YES. [2023-08-31 22:08:29,251 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:08:29,264 INFO L137 encePairwiseOnDemand]: 633/636 looper letters, 53 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-08-31 22:08:29,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 266 flow [2023-08-31 22:08:29,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:08:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:08:29,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 840 transitions. [2023-08-31 22:08:29,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44025157232704404 [2023-08-31 22:08:29,268 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 840 transitions. [2023-08-31 22:08:29,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 840 transitions. [2023-08-31 22:08:29,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:08:29,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 840 transitions. [2023-08-31 22:08:29,270 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:08:29,274 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:08:29,275 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:08:29,275 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:08:29,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 266 flow [2023-08-31 22:08:29,276 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:08:29,278 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 156 flow [2023-08-31 22:08:29,278 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:08:29,280 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-08-31 22:08:29,281 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 156 flow [2023-08-31 22:08:29,281 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:08:29,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:08:29,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 22:08:29,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 22:08:29,282 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:08:29,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:08:29,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1109495977, now seen corresponding path program 1 times [2023-08-31 22:08:29,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:08:29,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006379582] [2023-08-31 22:08:29,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:29,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:08:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:29,364 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:08:29,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:08:29,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006379582] [2023-08-31 22:08:29,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006379582] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:08:29,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:08:29,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 22:08:29,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671209694] [2023-08-31 22:08:29,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:08:29,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 22:08:29,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:08:29,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 22:08:29,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 22:08:29,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 636 [2023-08-31 22:08:29,551 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:08:29,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:08:29,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 636 [2023-08-31 22:08:29,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:08:29,808 INFO L130 PetriNetUnfolder]: 1473/2479 cut-off events. [2023-08-31 22:08:29,809 INFO L131 PetriNetUnfolder]: For 125/166 co-relation queries the response was YES. [2023-08-31 22:08:29,811 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:08:29,819 INFO L137 encePairwiseOnDemand]: 633/636 looper letters, 52 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-08-31 22:08:29,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 64 transitions, 262 flow [2023-08-31 22:08:29,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:08:29,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:08:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 815 transitions. [2023-08-31 22:08:29,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4271488469601677 [2023-08-31 22:08:29,823 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 815 transitions. [2023-08-31 22:08:29,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 815 transitions. [2023-08-31 22:08:29,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:08:29,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 815 transitions. [2023-08-31 22:08:29,826 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:08:29,830 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:08:29,832 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:08:29,833 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:08:29,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 64 transitions, 262 flow [2023-08-31 22:08:29,834 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:08:29,835 INFO L231 Difference]: Finished difference. Result has 62 places, 64 transitions, 154 flow [2023-08-31 22:08:29,835 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:08:29,836 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -44 predicate places. [2023-08-31 22:08:29,836 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 64 transitions, 154 flow [2023-08-31 22:08:29,837 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:08:29,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:08:29,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-31 22:08:29,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 22:08:29,837 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:08:29,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:08:29,838 INFO L85 PathProgramCache]: Analyzing trace with hash 34798183, now seen corresponding path program 1 times [2023-08-31 22:08:29,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:08:29,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106203257] [2023-08-31 22:08:29,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:29,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:08:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:30,722 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:08:30,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:08:30,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106203257] [2023-08-31 22:08:30,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106203257] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:08:30,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:08:30,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 22:08:30,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383775891] [2023-08-31 22:08:30,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:08:30,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 22:08:30,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:08:30,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 22:08:30,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 22:08:31,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 636 [2023-08-31 22:08:31,915 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:08:31,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:08:31,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 636 [2023-08-31 22:08:31,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:08:32,803 INFO L130 PetriNetUnfolder]: 1853/3134 cut-off events. [2023-08-31 22:08:32,803 INFO L131 PetriNetUnfolder]: For 123/123 co-relation queries the response was YES. [2023-08-31 22:08:32,807 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:08:32,818 INFO L137 encePairwiseOnDemand]: 625/636 looper letters, 75 selfloop transitions, 8 changer transitions 0/91 dead transitions. [2023-08-31 22:08:32,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 91 transitions, 383 flow [2023-08-31 22:08:32,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 22:08:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 22:08:32,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1094 transitions. [2023-08-31 22:08:32,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4300314465408805 [2023-08-31 22:08:32,823 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1094 transitions. [2023-08-31 22:08:32,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1094 transitions. [2023-08-31 22:08:32,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:08:32,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1094 transitions. [2023-08-31 22:08:32,826 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:08:32,830 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:08:32,831 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:08:32,831 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:08:32,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 91 transitions, 383 flow [2023-08-31 22:08:32,834 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:08:32,837 INFO L231 Difference]: Finished difference. Result has 64 places, 69 transitions, 208 flow [2023-08-31 22:08:32,838 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:08:32,839 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -42 predicate places. [2023-08-31 22:08:32,840 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 69 transitions, 208 flow [2023-08-31 22:08:32,840 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:08:32,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:08:32,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-31 22:08:32,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 22:08:32,841 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:08:32,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:08:32,845 INFO L85 PathProgramCache]: Analyzing trace with hash 34645865, now seen corresponding path program 1 times [2023-08-31 22:08:32,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:08:32,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875020374] [2023-08-31 22:08:32,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:32,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:08:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:32,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:08:32,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:08:32,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875020374] [2023-08-31 22:08:32,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875020374] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:08:32,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:08:32,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 22:08:32,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627600730] [2023-08-31 22:08:32,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:08:32,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 22:08:32,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:08:32,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 22:08:32,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 22:08:33,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 636 [2023-08-31 22:08:33,165 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:08:33,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:08:33,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 636 [2023-08-31 22:08:33,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:08:33,462 INFO L130 PetriNetUnfolder]: 1643/2806 cut-off events. [2023-08-31 22:08:33,463 INFO L131 PetriNetUnfolder]: For 423/423 co-relation queries the response was YES. [2023-08-31 22:08:33,466 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:08:33,474 INFO L137 encePairwiseOnDemand]: 627/636 looper letters, 81 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2023-08-31 22:08:33,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 95 transitions, 425 flow [2023-08-31 22:08:33,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 22:08:33,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 22:08:33,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1108 transitions. [2023-08-31 22:08:33,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43553459119496857 [2023-08-31 22:08:33,479 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1108 transitions. [2023-08-31 22:08:33,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1108 transitions. [2023-08-31 22:08:33,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:08:33,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1108 transitions. [2023-08-31 22:08:33,481 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:08:33,484 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:08:33,485 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:08:33,486 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:08:33,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 95 transitions, 425 flow [2023-08-31 22:08:33,487 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:08:33,489 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 184 flow [2023-08-31 22:08:33,489 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:08:33,490 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -45 predicate places. [2023-08-31 22:08:33,490 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 184 flow [2023-08-31 22:08:33,491 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:08:33,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:08:33,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:08:33,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 22:08:33,493 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:08:33,493 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:08:33,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1100843232, now seen corresponding path program 1 times [2023-08-31 22:08:33,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:08:33,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421000664] [2023-08-31 22:08:33,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:33,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:08:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:33,591 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:08:33,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:08:33,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421000664] [2023-08-31 22:08:33,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421000664] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:08:33,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:08:33,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 22:08:33,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384081267] [2023-08-31 22:08:33,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:08:33,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:08:33,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:08:33,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:08:33,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:08:33,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-31 22:08:33,601 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:08:33,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:08:33,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-31 22:08:33,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:08:33,730 INFO L130 PetriNetUnfolder]: 533/1074 cut-off events. [2023-08-31 22:08:33,730 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2023-08-31 22:08:33,732 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:08:33,735 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 61 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2023-08-31 22:08:33,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 339 flow [2023-08-31 22:08:33,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:08:33,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:08:33,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 844 transitions. [2023-08-31 22:08:33,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44234800838574423 [2023-08-31 22:08:33,738 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 844 transitions. [2023-08-31 22:08:33,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 844 transitions. [2023-08-31 22:08:33,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:08:33,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 844 transitions. [2023-08-31 22:08:33,740 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:08:33,743 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:08:33,744 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:08:33,744 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:08:33,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 339 flow [2023-08-31 22:08:33,746 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:08:33,747 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 185 flow [2023-08-31 22:08:33,748 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:08:33,750 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-08-31 22:08:33,750 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 185 flow [2023-08-31 22:08:33,750 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:08:33,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:08:33,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:08:33,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 22:08:33,751 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:08:33,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:08:33,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1760781159, now seen corresponding path program 1 times [2023-08-31 22:08:33,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:08:33,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423455184] [2023-08-31 22:08:33,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:33,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:08:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:33,874 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:08:33,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:08:33,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423455184] [2023-08-31 22:08:33,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423455184] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:08:33,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:08:33,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 22:08:33,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584103272] [2023-08-31 22:08:33,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:08:33,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:08:33,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:08:33,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:08:33,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:08:33,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 636 [2023-08-31 22:08:33,981 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:08:33,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:08:33,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 636 [2023-08-31 22:08:33,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:08:34,099 INFO L130 PetriNetUnfolder]: 506/1041 cut-off events. [2023-08-31 22:08:34,100 INFO L131 PetriNetUnfolder]: For 131/133 co-relation queries the response was YES. [2023-08-31 22:08:34,101 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:08:34,104 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 47 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2023-08-31 22:08:34,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 281 flow [2023-08-31 22:08:34,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:08:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:08:34,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 827 transitions. [2023-08-31 22:08:34,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4334381551362683 [2023-08-31 22:08:34,107 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 827 transitions. [2023-08-31 22:08:34,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 827 transitions. [2023-08-31 22:08:34,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:08:34,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 827 transitions. [2023-08-31 22:08:34,109 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:08:34,111 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:08:34,111 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:08:34,112 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:08:34,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 281 flow [2023-08-31 22:08:34,113 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:08:34,114 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 181 flow [2023-08-31 22:08:34,114 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:08:34,114 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -45 predicate places. [2023-08-31 22:08:34,114 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 181 flow [2023-08-31 22:08:34,127 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:08:34,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:08:34,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:08:34,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 22:08:34,127 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:08:34,128 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:08:34,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1760781158, now seen corresponding path program 1 times [2023-08-31 22:08:34,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:08:34,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94533559] [2023-08-31 22:08:34,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:34,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:08:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:34,274 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:08:34,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:08:34,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94533559] [2023-08-31 22:08:34,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94533559] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:08:34,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:08:34,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 22:08:34,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170182386] [2023-08-31 22:08:34,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:08:34,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 22:08:34,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:08:34,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 22:08:34,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 22:08:34,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 636 [2023-08-31 22:08:34,458 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:08:34,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:08:34,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 636 [2023-08-31 22:08:34,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:08:34,594 INFO L130 PetriNetUnfolder]: 354/719 cut-off events. [2023-08-31 22:08:34,594 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2023-08-31 22:08:34,595 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:08:34,597 INFO L137 encePairwiseOnDemand]: 631/636 looper letters, 59 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2023-08-31 22:08:34,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 72 transitions, 330 flow [2023-08-31 22:08:34,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 22:08:34,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 22:08:34,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1105 transitions. [2023-08-31 22:08:34,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4343553459119497 [2023-08-31 22:08:34,600 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1105 transitions. [2023-08-31 22:08:34,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1105 transitions. [2023-08-31 22:08:34,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:08:34,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1105 transitions. [2023-08-31 22:08:34,602 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:08:34,605 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:08:34,606 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:08:34,606 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:08:34,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 72 transitions, 330 flow [2023-08-31 22:08:34,607 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:08:34,608 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 179 flow [2023-08-31 22:08:34,609 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:08:34,609 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-08-31 22:08:34,609 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 179 flow [2023-08-31 22:08:34,610 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:08:34,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:08:34,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:08:34,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 22:08:34,610 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:08:34,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:08:34,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1250363540, now seen corresponding path program 1 times [2023-08-31 22:08:34,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:08:34,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506536983] [2023-08-31 22:08:34,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:34,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:08:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:35,081 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:08:35,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:08:35,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506536983] [2023-08-31 22:08:35,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506536983] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:08:35,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:08:35,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 22:08:35,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552573918] [2023-08-31 22:08:35,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:08:35,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 22:08:35,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:08:35,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 22:08:35,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 22:08:35,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 636 [2023-08-31 22:08:35,251 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:08:35,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:08:35,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 636 [2023-08-31 22:08:35,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:08:35,428 INFO L130 PetriNetUnfolder]: 368/732 cut-off events. [2023-08-31 22:08:35,428 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2023-08-31 22:08:35,429 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:08:35,431 INFO L137 encePairwiseOnDemand]: 629/636 looper letters, 55 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2023-08-31 22:08:35,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 71 transitions, 343 flow [2023-08-31 22:08:35,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 22:08:35,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 22:08:35,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1567 transitions. [2023-08-31 22:08:35,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4106394129979036 [2023-08-31 22:08:35,436 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1567 transitions. [2023-08-31 22:08:35,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1567 transitions. [2023-08-31 22:08:35,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:08:35,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1567 transitions. [2023-08-31 22:08:35,439 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:08:35,444 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:08:35,445 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:08:35,445 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:08:35,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 71 transitions, 343 flow [2023-08-31 22:08:35,447 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:08:35,448 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 233 flow [2023-08-31 22:08:35,448 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:08:35,449 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -37 predicate places. [2023-08-31 22:08:35,449 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 233 flow [2023-08-31 22:08:35,450 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:08:35,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:08:35,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:08:35,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 22:08:35,450 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:08:35,450 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:08:35,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1718251328, now seen corresponding path program 1 times [2023-08-31 22:08:35,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:08:35,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184528618] [2023-08-31 22:08:35,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:35,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:08:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:35,964 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:08:35,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:08:35,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184528618] [2023-08-31 22:08:35,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184528618] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:08:35,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:08:35,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 22:08:35,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181932505] [2023-08-31 22:08:35,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:08:35,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 22:08:35,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:08:35,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 22:08:35,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-31 22:08:36,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 636 [2023-08-31 22:08:36,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 233 flow. Second operand has 6 states, 6 states have (on average 252.16666666666666) internal successors, (1513), 6 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:36,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:08:36,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 636 [2023-08-31 22:08:36,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:08:36,385 INFO L130 PetriNetUnfolder]: 458/907 cut-off events. [2023-08-31 22:08:36,386 INFO L131 PetriNetUnfolder]: For 189/189 co-relation queries the response was YES. [2023-08-31 22:08:36,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2133 conditions, 907 events. 458/907 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4423 event pairs, 111 based on Foata normal form. 7/847 useless extension candidates. Maximal degree in co-relation 2121. Up to 593 conditions per place. [2023-08-31 22:08:36,390 INFO L137 encePairwiseOnDemand]: 625/636 looper letters, 69 selfloop transitions, 19 changer transitions 0/95 dead transitions. [2023-08-31 22:08:36,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 95 transitions, 493 flow [2023-08-31 22:08:36,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 22:08:36,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 22:08:36,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1832 transitions. [2023-08-31 22:08:36,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4115004492362983 [2023-08-31 22:08:36,395 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1832 transitions. [2023-08-31 22:08:36,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1832 transitions. [2023-08-31 22:08:36,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:08:36,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1832 transitions. [2023-08-31 22:08:36,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 261.7142857142857) internal successors, (1832), 7 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:36,403 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:08:36,404 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:08:36,404 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 233 flow. Second operand 7 states and 1832 transitions. [2023-08-31 22:08:36,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 95 transitions, 493 flow [2023-08-31 22:08:36,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 95 transitions, 485 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-31 22:08:36,407 INFO L231 Difference]: Finished difference. Result has 77 places, 72 transitions, 333 flow [2023-08-31 22:08:36,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=333, PETRI_PLACES=77, PETRI_TRANSITIONS=72} [2023-08-31 22:08:36,408 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -29 predicate places. [2023-08-31 22:08:36,408 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 72 transitions, 333 flow [2023-08-31 22:08:36,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 252.16666666666666) internal successors, (1513), 6 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:36,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:08:36,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:08:36,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 22:08:36,409 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:08:36,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:08:36,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1250219982, now seen corresponding path program 2 times [2023-08-31 22:08:36,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:08:36,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130906901] [2023-08-31 22:08:36,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:36,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:08:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:36,718 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,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:08:36,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130906901] [2023-08-31 22:08:36,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130906901] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:08:36,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648276910] [2023-08-31 22:08:36,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 22:08:36,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:08:36,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:08:36,725 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:36,748 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:36,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 22:08:36,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:08:36,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-31 22:08:36,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:08:37,045 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:08:37,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:37,080 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:08:37,094 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:37,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:08:37,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2023-08-31 22:08:37,149 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_460 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_460) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_460 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_460) |c_~#queue~0.base|) .cse0) 402)))) is different from false [2023-08-31 22:08:37,165 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 22:08:37,165 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:08:37,173 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 22:08:37,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-08-31 22:08:37,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-31 22:08:37,194 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-08-31 22:08:37,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-08-31 22:08:37,261 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:37,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648276910] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:08:37,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:08:37,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2023-08-31 22:08:37,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888405202] [2023-08-31 22:08:37,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:08:37,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-31 22:08:37,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:08:37,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-31 22:08:37,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=115, Unknown=1, NotChecked=22, Total=182 [2023-08-31 22:08:37,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 636 [2023-08-31 22:08:37,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 333 flow. Second operand has 14 states, 14 states have (on average 176.78571428571428) internal successors, (2475), 14 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:37,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:08:37,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 636 [2023-08-31 22:08:37,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:08:37,978 INFO L130 PetriNetUnfolder]: 590/1180 cut-off events. [2023-08-31 22:08:37,978 INFO L131 PetriNetUnfolder]: For 521/521 co-relation queries the response was YES. [2023-08-31 22:08:37,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2998 conditions, 1180 events. 590/1180 cut-off events. For 521/521 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6356 event pairs, 226 based on Foata normal form. 8/1104 useless extension candidates. Maximal degree in co-relation 2983. Up to 727 conditions per place. [2023-08-31 22:08:37,983 INFO L137 encePairwiseOnDemand]: 628/636 looper letters, 96 selfloop transitions, 14 changer transitions 0/116 dead transitions. [2023-08-31 22:08:37,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 116 transitions, 689 flow [2023-08-31 22:08:37,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 22:08:37,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 22:08:37,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1315 transitions. [2023-08-31 22:08:37,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2953728661275831 [2023-08-31 22:08:37,988 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1315 transitions. [2023-08-31 22:08:37,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1315 transitions. [2023-08-31 22:08:37,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:08:37,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1315 transitions. [2023-08-31 22:08:37,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 187.85714285714286) internal successors, (1315), 7 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:37,996 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:08:37,996 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:08:37,997 INFO L175 Difference]: Start difference. First operand has 77 places, 72 transitions, 333 flow. Second operand 7 states and 1315 transitions. [2023-08-31 22:08:37,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 116 transitions, 689 flow [2023-08-31 22:08:38,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 116 transitions, 674 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-31 22:08:38,001 INFO L231 Difference]: Finished difference. Result has 83 places, 78 transitions, 402 flow [2023-08-31 22:08:38,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=402, PETRI_PLACES=83, PETRI_TRANSITIONS=78} [2023-08-31 22:08:38,003 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -23 predicate places. [2023-08-31 22:08:38,003 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 402 flow [2023-08-31 22:08:38,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 176.78571428571428) internal successors, (2475), 14 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:38,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:08:38,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:08:38,016 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:38,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-31 22:08:38,217 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:08:38,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:08:38,217 INFO L85 PathProgramCache]: Analyzing trace with hash 99588272, now seen corresponding path program 1 times [2023-08-31 22:08:38,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:08:38,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311526454] [2023-08-31 22:08:38,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:38,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:08:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:39,026 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:39,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:08:39,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311526454] [2023-08-31 22:08:39,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311526454] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:08:39,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438040831] [2023-08-31 22:08:39,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:39,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:08:39,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:08:39,029 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:39,031 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:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:39,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 64 conjunts are in the unsatisfiable core [2023-08-31 22:08:39,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:08:39,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:39,303 INFO L321 Elim1Store]: treesize reduction 98, result has 46.4 percent of original size [2023-08-31 22:08:39,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 314 treesize of output 312 [2023-08-31 22:08:39,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-31 22:08:39,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-08-31 22:08:39,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:39,423 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 22:08:39,443 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-08-31 22:08:39,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 123 treesize of output 122 [2023-08-31 22:08:39,552 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 22:08:39,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 23 [2023-08-31 22:08:39,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-08-31 22:08:40,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:40,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:40,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2023-08-31 22:08:40,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2023-08-31 22:08:40,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2023-08-31 22:08:40,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2023-08-31 22:08:40,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2023-08-31 22:08:40,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:40,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 60 [2023-08-31 22:08:40,655 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:40,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:08:40,736 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_555 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_555) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_555 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_555) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-31 22:08:45,033 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (select .cse3 .cse2))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int)) (or (forall ((v_ArrVal_552 Int) (v_ArrVal_550 Int) (v_ArrVal_555 (Array Int Int))) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|)) v_ArrVal_550))) (store (store .cse0 .cse1 v_ArrVal_552) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_555) |c_~#queue~0.base|) .cse2)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int)) (or (forall ((v_ArrVal_552 Int) (v_ArrVal_550 Int) (v_ArrVal_555 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|)) v_ArrVal_550))) (store (store .cse5 .cse1 v_ArrVal_552) .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_555) |c_~#queue~0.base|) .cse2)) |c_~#queue~0.offset|))) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|)))))) is different from false [2023-08-31 22:08:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-31 22:08:45,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438040831] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:08:45,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:08:45,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 20 [2023-08-31 22:08:45,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811386452] [2023-08-31 22:08:45,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:08:45,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-31 22:08:45,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:08:45,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-31 22:08:45,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=259, Unknown=27, NotChecked=74, Total=462 [2023-08-31 22:08:45,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 636 [2023-08-31 22:08:45,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 78 transitions, 402 flow. Second operand has 22 states, 22 states have (on average 172.77272727272728) internal successors, (3801), 22 states have internal predecessors, (3801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:45,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:08:45,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 636 [2023-08-31 22:08:45,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:08:49,280 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:57,657 WARN L222 SmtUtils]: Spent 5.54s on a formula simplification. DAG size of input: 64 DAG size of output: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:08:59,948 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:00,458 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)))) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_555 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_555) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_555 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_555) |c_~#queue~0.base|) .cse1) 4)) .cse2)) (forall ((v_ArrVal_555 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_555) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_555 (Array Int Int))) (<= (+ (* (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_555) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse2))))) is different from false [2023-08-31 22:09:01,182 INFO L130 PetriNetUnfolder]: 737/1493 cut-off events. [2023-08-31 22:09:01,182 INFO L131 PetriNetUnfolder]: For 838/838 co-relation queries the response was YES. [2023-08-31 22:09:01,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3846 conditions, 1493 events. 737/1493 cut-off events. For 838/838 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 8723 event pairs, 518 based on Foata normal form. 9/1409 useless extension candidates. Maximal degree in co-relation 3829. Up to 1128 conditions per place. [2023-08-31 22:09:01,189 INFO L137 encePairwiseOnDemand]: 624/636 looper letters, 105 selfloop transitions, 37 changer transitions 0/148 dead transitions. [2023-08-31 22:09:01,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 148 transitions, 1005 flow [2023-08-31 22:09:01,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-31 22:09:01,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-31 22:09:01,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3204 transitions. [2023-08-31 22:09:01,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.279874213836478 [2023-08-31 22:09:01,208 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3204 transitions. [2023-08-31 22:09:01,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3204 transitions. [2023-08-31 22:09:01,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:09:01,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3204 transitions. [2023-08-31 22:09:01,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 178.0) internal successors, (3204), 18 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states 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:01,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 636.0) internal successors, (12084), 19 states have internal predecessors, (12084), 0 states have call successors, (0), 0 states 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:01,230 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 636.0) internal successors, (12084), 19 states have internal predecessors, (12084), 0 states have call successors, (0), 0 states 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:01,230 INFO L175 Difference]: Start difference. First operand has 83 places, 78 transitions, 402 flow. Second operand 18 states and 3204 transitions. [2023-08-31 22:09:01,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 148 transitions, 1005 flow [2023-08-31 22:09:01,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 148 transitions, 981 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-31 22:09:01,237 INFO L231 Difference]: Finished difference. Result has 105 places, 106 transitions, 720 flow [2023-08-31 22:09:01,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=720, PETRI_PLACES=105, PETRI_TRANSITIONS=106} [2023-08-31 22:09:01,237 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -1 predicate places. [2023-08-31 22:09:01,238 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 106 transitions, 720 flow [2023-08-31 22:09:01,238 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:09:01,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:09:01,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:09:01,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-31 22:09:01,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-31 22:09:01,445 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:09:01,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:09:01,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1733159420, now seen corresponding path program 1 times [2023-08-31 22:09:01,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:09:01,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909460584] [2023-08-31 22:09:01,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:09:01,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:09:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:09:02,502 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:09:02,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:09:02,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909460584] [2023-08-31 22:09:02,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909460584] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:09:02,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222587501] [2023-08-31 22:09:02,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:09:02,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:09:02,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:09:02,505 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:09:02,511 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:09:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:09:02,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 65 conjunts are in the unsatisfiable core [2023-08-31 22:09:02,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:09:02,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:09:02,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:09:02,697 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 22:09:02,697 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:09:02,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:09:02,708 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:09:02,717 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:09:02,735 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:09:02,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:09:02,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:09:03,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:09:03,109 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:09:03,253 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:09:03,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-31 22:09:03,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:09:03,496 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:09:03,541 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:09:03,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:09:03,591 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_650 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_650 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2023-08-31 22:09:03,687 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_650 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_650 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))))) is different from false [2023-08-31 22:09:03,717 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_650 (Array Int Int)) (v_ArrVal_647 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_647) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_650 (Array Int Int)) (v_ArrVal_647 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_647) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2023-08-31 22:09:05,967 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (select .cse3 .cse2))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int)) (or (forall ((v_ArrVal_650 (Array Int Int)) (v_ArrVal_647 Int) (v_ArrVal_645 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_645))) (store (store .cse0 .cse1 v_ArrVal_647) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int)) (or (forall ((v_ArrVal_650 (Array Int Int)) (v_ArrVal_647 Int) (v_ArrVal_645 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_645))) (store (store .cse5 .cse1 v_ArrVal_647) .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|))) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|)))))) is different from false [2023-08-31 22:09:06,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-31 22:09:06,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222587501] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:09:06,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:09:06,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 23 [2023-08-31 22:09:06,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665380727] [2023-08-31 22:09:06,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:09:06,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-31 22:09:06,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:09:06,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-31 22:09:06,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=340, Unknown=11, NotChecked=164, Total=600 [2023-08-31 22:09:06,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-31 22:09:06,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 106 transitions, 720 flow. Second operand has 25 states, 25 states have (on average 167.68) internal successors, (4192), 25 states have internal predecessors, (4192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:09:06,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:09:06,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-31 22:09:06,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:09:17,019 INFO L130 PetriNetUnfolder]: 1242/2525 cut-off events. [2023-08-31 22:09:17,019 INFO L131 PetriNetUnfolder]: For 2369/2369 co-relation queries the response was YES. [2023-08-31 22:09:17,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6757 conditions, 2525 events. 1242/2525 cut-off events. For 2369/2369 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 15989 event pairs, 404 based on Foata normal form. 22/2388 useless extension candidates. Maximal degree in co-relation 6732. Up to 883 conditions per place. [2023-08-31 22:09:17,034 INFO L137 encePairwiseOnDemand]: 614/636 looper letters, 164 selfloop transitions, 105 changer transitions 0/275 dead transitions. [2023-08-31 22:09:17,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 275 transitions, 1940 flow [2023-08-31 22:09:17,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-31 22:09:17,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-31 22:09:17,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3541 transitions. [2023-08-31 22:09:17,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27838050314465407 [2023-08-31 22:09:17,045 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3541 transitions. [2023-08-31 22:09:17,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3541 transitions. [2023-08-31 22:09:17,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:09:17,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3541 transitions. [2023-08-31 22:09:17,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 177.05) internal successors, (3541), 20 states have internal predecessors, (3541), 0 states have call successors, (0), 0 states 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:17,066 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:17,069 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:17,070 INFO L175 Difference]: Start difference. First operand has 105 places, 106 transitions, 720 flow. Second operand 20 states and 3541 transitions. [2023-08-31 22:09:17,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 275 transitions, 1940 flow [2023-08-31 22:09:17,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 275 transitions, 1814 flow, removed 56 selfloop flow, removed 4 redundant places. [2023-08-31 22:09:17,084 INFO L231 Difference]: Finished difference. Result has 133 places, 175 transitions, 1435 flow [2023-08-31 22:09:17,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1435, PETRI_PLACES=133, PETRI_TRANSITIONS=175} [2023-08-31 22:09:17,085 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 27 predicate places. [2023-08-31 22:09:17,085 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 175 transitions, 1435 flow [2023-08-31 22:09:17,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 167.68) internal successors, (4192), 25 states have internal predecessors, (4192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:09:17,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:09:17,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:09:17,093 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:17,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:09:17,292 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:09:17,293 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:09:17,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1207708666, now seen corresponding path program 2 times [2023-08-31 22:09:17,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:09:17,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574081359] [2023-08-31 22:09:17,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:09:17,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:09:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:09:18,317 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:09:18,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:09:18,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574081359] [2023-08-31 22:09:18,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574081359] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:09:18,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166363473] [2023-08-31 22:09:18,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 22:09:18,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:09:18,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:09:18,319 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:18,321 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:18,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 22:09:18,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:09:18,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 78 conjunts are in the unsatisfiable core [2023-08-31 22:09:18,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:09:18,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:09:18,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:09:18,521 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 22:09:18,522 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:09:18,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:09:18,534 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:09:18,544 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:09:18,803 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:09:18,984 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:09:19,310 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:09:19,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:09:19,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2023-08-31 22:09:19,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:09:19,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2023-08-31 22:09:19,663 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:09:19,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:09:36,766 WARN L222 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:09:36,878 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:09:36,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166363473] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:09:36,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:09:36,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-08-31 22:09:36,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694551488] [2023-08-31 22:09:36,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:09:36,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-31 22:09:36,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:09:36,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-31 22:09:36,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=496, Unknown=19, NotChecked=0, Total=650 [2023-08-31 22:09:38,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:41,132 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:43,493 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:45,594 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:47,646 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:49,737 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:51,864 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:54,102 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:57,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:59,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:01,540 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:10:03,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:10:05,670 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:10:07,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:09,820 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:10:11,973 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:10:14,040 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:10:16,181 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:10:18,391 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:10:20,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:22,692 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:10:24,748 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:10:26,822 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:10:28,912 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:10:31,016 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:10:33,141 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:10:36,068 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:10:38,606 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:10:40,706 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:10:42,748 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:10:44,788 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:10:46,916 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:10:49,040 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:10:51,143 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:10:54,188 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:10:56,220 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:10:58,337 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:11:00,389 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:11:02,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:04,577 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:11:06,757 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:11:08,854 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:11:08,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-31 22:11:08,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 175 transitions, 1435 flow. Second operand has 26 states, 26 states have (on average 167.6153846153846) internal successors, (4358), 26 states have internal predecessors, (4358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:08,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:11:08,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-31 22:11:08,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:11:15,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:11:17,823 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:29,277 WARN L222 SmtUtils]: Spent 11.20s on a formula simplification. DAG size of input: 96 DAG size of output: 70 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:11:31,537 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:33,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:11:36,692 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,319 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:52,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:11:58,446 WARN L222 SmtUtils]: Spent 5.64s on a formula simplification. DAG size of input: 82 DAG size of output: 65 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:12:00,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:12:02,314 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:12:03,888 INFO L130 PetriNetUnfolder]: 1688/3392 cut-off events. [2023-08-31 22:12:03,888 INFO L131 PetriNetUnfolder]: For 19435/19718 co-relation queries the response was YES. [2023-08-31 22:12:03,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16042 conditions, 3392 events. 1688/3392 cut-off events. For 19435/19718 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 22793 event pairs, 521 based on Foata normal form. 19/3231 useless extension candidates. Maximal degree in co-relation 16003. Up to 1570 conditions per place. [2023-08-31 22:12:03,907 INFO L137 encePairwiseOnDemand]: 617/636 looper letters, 245 selfloop transitions, 74 changer transitions 0/325 dead transitions. [2023-08-31 22:12:03,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 325 transitions, 3438 flow [2023-08-31 22:12:03,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-31 22:12:03,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-31 22:12:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3682 transitions. [2023-08-31 22:12:03,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27568134171907754 [2023-08-31 22:12:03,915 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3682 transitions. [2023-08-31 22:12:03,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3682 transitions. [2023-08-31 22:12:03,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:12:03,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3682 transitions. [2023-08-31 22:12:03,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 175.33333333333334) internal successors, (3682), 21 states have internal predecessors, (3682), 0 states have call successors, (0), 0 states 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:12:03,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 636.0) internal successors, (13992), 22 states have internal predecessors, (13992), 0 states have call successors, (0), 0 states 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:12:03,934 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 636.0) internal successors, (13992), 22 states have internal predecessors, (13992), 0 states have call successors, (0), 0 states 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:12:03,934 INFO L175 Difference]: Start difference. First operand has 133 places, 175 transitions, 1435 flow. Second operand 21 states and 3682 transitions. [2023-08-31 22:12:03,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 325 transitions, 3438 flow [2023-08-31 22:12:03,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 325 transitions, 3293 flow, removed 71 selfloop flow, removed 1 redundant places. [2023-08-31 22:12:03,977 INFO L231 Difference]: Finished difference. Result has 158 places, 204 transitions, 1849 flow [2023-08-31 22:12:03,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1324, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1849, PETRI_PLACES=158, PETRI_TRANSITIONS=204} [2023-08-31 22:12:03,977 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 52 predicate places. [2023-08-31 22:12:03,977 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 204 transitions, 1849 flow [2023-08-31 22:12:03,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 167.6153846153846) internal successors, (4358), 26 states have internal predecessors, (4358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:12:03,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:12:03,979 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:12:03,985 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:12:04,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-31 22:12:04,185 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-31 22:12:04,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:12:04,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1155826660, now seen corresponding path program 1 times [2023-08-31 22:12:04,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:12:04,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103678333] [2023-08-31 22:12:04,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:12:04,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:12:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:12:04,278 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:12:04,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:12:04,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103678333] [2023-08-31 22:12:04,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103678333] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:12:04,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:12:04,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 22:12:04,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842800903] [2023-08-31 22:12:04,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:12:04,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:12:04,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:12:04,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:12:04,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:12:04,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-31 22:12:04,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 204 transitions, 1849 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:12:04,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:12:04,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-31 22:12:04,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:12:05,039 INFO L130 PetriNetUnfolder]: 1684/3413 cut-off events. [2023-08-31 22:12:05,039 INFO L131 PetriNetUnfolder]: For 24322/24750 co-relation queries the response was YES. [2023-08-31 22:12:05,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17244 conditions, 3413 events. 1684/3413 cut-off events. For 24322/24750 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 23207 event pairs, 719 based on Foata normal form. 9/3267 useless extension candidates. Maximal degree in co-relation 17199. Up to 1645 conditions per place. [2023-08-31 22:12:05,068 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 196 selfloop transitions, 3 changer transitions 0/217 dead transitions. [2023-08-31 22:12:05,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 217 transitions, 2375 flow [2023-08-31 22:12:05,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:12:05,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:12:05,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 843 transitions. [2023-08-31 22:12:05,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418238993710692 [2023-08-31 22:12:05,071 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 843 transitions. [2023-08-31 22:12:05,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 843 transitions. [2023-08-31 22:12:05,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:12:05,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 843 transitions. [2023-08-31 22:12:05,075 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:12:05,077 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:12:05,077 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:12:05,077 INFO L175 Difference]: Start difference. First operand has 158 places, 204 transitions, 1849 flow. Second operand 3 states and 843 transitions. [2023-08-31 22:12:05,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 217 transitions, 2375 flow [2023-08-31 22:12:05,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 217 transitions, 2248 flow, removed 58 selfloop flow, removed 2 redundant places. [2023-08-31 22:12:05,124 INFO L231 Difference]: Finished difference. Result has 154 places, 201 transitions, 1717 flow [2023-08-31 22:12:05,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1711, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1717, PETRI_PLACES=154, PETRI_TRANSITIONS=201} [2023-08-31 22:12:05,125 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 48 predicate places. [2023-08-31 22:12:05,125 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 201 transitions, 1717 flow [2023-08-31 22:12:05,125 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:12:05,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:12:05,125 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:12:05,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-31 22:12:05,126 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-31 22:12:05,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:12:05,126 INFO L85 PathProgramCache]: Analyzing trace with hash -2042297759, now seen corresponding path program 1 times [2023-08-31 22:12:05,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:12:05,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140462114] [2023-08-31 22:12:05,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:12:05,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:12:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:12:05,456 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:12:05,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:12:05,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140462114] [2023-08-31 22:12:05,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140462114] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:12:05,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776056197] [2023-08-31 22:12:05,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:12:05,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:12:05,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:12:05,458 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:12:05,461 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:12:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:12:05,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-31 22:12:05,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:12:05,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:12:05,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:12:05,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:12:05,636 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:12:06,166 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:12:06,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:12:06,428 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:12:06,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776056197] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:12:06,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:12:06,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-08-31 22:12:06,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312132280] [2023-08-31 22:12:06,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:12:06,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-31 22:12:06,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:12:06,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-31 22:12:06,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-08-31 22:12:09,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 636 [2023-08-31 22:12:09,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 201 transitions, 1717 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:12:09,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:12:09,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 636 [2023-08-31 22:12:09,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:12:10,358 INFO L130 PetriNetUnfolder]: 1882/3731 cut-off events. [2023-08-31 22:12:10,358 INFO L131 PetriNetUnfolder]: For 31668/32253 co-relation queries the response was YES. [2023-08-31 22:12:10,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21452 conditions, 3731 events. 1882/3731 cut-off events. For 31668/32253 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 22672 event pairs, 590 based on Foata normal form. 217/3821 useless extension candidates. Maximal degree in co-relation 21406. Up to 1477 conditions per place. [2023-08-31 22:12:10,388 INFO L137 encePairwiseOnDemand]: 631/636 looper letters, 300 selfloop transitions, 22 changer transitions 0/341 dead transitions. [2023-08-31 22:12:10,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 341 transitions, 3684 flow [2023-08-31 22:12:10,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 22:12:10,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 22:12:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1906 transitions. [2023-08-31 22:12:10,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4281221922731357 [2023-08-31 22:12:10,392 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1906 transitions. [2023-08-31 22:12:10,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1906 transitions. [2023-08-31 22:12:10,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:12:10,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1906 transitions. [2023-08-31 22:12:10,395 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:12:10,398 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:12:10,398 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:12:10,398 INFO L175 Difference]: Start difference. First operand has 154 places, 201 transitions, 1717 flow. Second operand 7 states and 1906 transitions. [2023-08-31 22:12:10,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 341 transitions, 3684 flow [2023-08-31 22:12:10,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 341 transitions, 3646 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-31 22:12:10,452 INFO L231 Difference]: Finished difference. Result has 159 places, 203 transitions, 1808 flow [2023-08-31 22:12:10,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1620, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1808, PETRI_PLACES=159, PETRI_TRANSITIONS=203} [2023-08-31 22:12:10,453 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 53 predicate places. [2023-08-31 22:12:10,453 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 203 transitions, 1808 flow [2023-08-31 22:12:10,454 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:12:10,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:12:10,454 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:12:10,463 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:12:10,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:12:10,661 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-31 22:12:10,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:12:10,661 INFO L85 PathProgramCache]: Analyzing trace with hash 152072361, now seen corresponding path program 1 times [2023-08-31 22:12:10,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:12:10,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180598271] [2023-08-31 22:12:10,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:12:10,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:12:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:12:11,803 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:12:11,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:12:11,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180598271] [2023-08-31 22:12:11,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180598271] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:12:11,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146291977] [2023-08-31 22:12:11,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:12:11,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:12:11,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:12:11,804 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:12:11,805 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:12:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:12:11,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 82 conjunts are in the unsatisfiable core [2023-08-31 22:12:11,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:12:11,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:12:11,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:12:12,007 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 22:12:12,007 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:12:12,021 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:12:12,043 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:12:12,292 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:12:12,449 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:12:12,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2023-08-31 22:12:12,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:12:12,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 51 [2023-08-31 22:12:13,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2023-08-31 22:12:13,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2023-08-31 22:12:13,429 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:12:13,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:12:13,536 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_985 (Array Int Int))) (not (= 400 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_985) |c_~#queue~0.base|) .cse0)))) (forall ((v_ArrVal_985 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_985) |c_~#queue~0.base|) .cse0) 401)))) is different from false [2023-08-31 22:12:13,555 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_985 (Array Int Int))) (not (= 400 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_985) |c_~#queue~0.base|) .cse1)))) (forall ((v_ArrVal_985 (Array Int Int))) (< (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_985) |c_~#queue~0.base|) .cse1) 401)))) is different from false [2023-08-31 22:12:13,580 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_985 (Array Int Int))) (not (= 400 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_985) |c_~#queue~0.base|) .cse1)))) (forall ((v_ArrVal_985 (Array Int Int))) (< (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_985) |c_~#queue~0.base|) .cse1) 401)))) is different from false [2023-08-31 22:12:14,774 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:12:14,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146291977] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:12:14,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:12:14,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 25 [2023-08-31 22:12:14,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236509049] [2023-08-31 22:12:14,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:12:14,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-31 22:12:14,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:12:14,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-31 22:12:14,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=381, Unknown=4, NotChecked=132, Total=650 [2023-08-31 22:12:15,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 636 [2023-08-31 22:12:15,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 203 transitions, 1808 flow. Second operand has 26 states, 26 states have (on average 198.96153846153845) internal successors, (5173), 26 states have internal predecessors, (5173), 0 states have call successors, (0), 0 states 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:12:15,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:12:15,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 636 [2023-08-31 22:12:15,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:12:20,577 INFO L130 PetriNetUnfolder]: 1938/3744 cut-off events. [2023-08-31 22:12:20,578 INFO L131 PetriNetUnfolder]: For 34415/34866 co-relation queries the response was YES. [2023-08-31 22:12:20,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22260 conditions, 3744 events. 1938/3744 cut-off events. For 34415/34866 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 22388 event pairs, 689 based on Foata normal form. 21/3617 useless extension candidates. Maximal degree in co-relation 22211. Up to 2660 conditions per place. [2023-08-31 22:12:20,596 INFO L137 encePairwiseOnDemand]: 625/636 looper letters, 175 selfloop transitions, 64 changer transitions 0/244 dead transitions. [2023-08-31 22:12:20,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 244 transitions, 2795 flow [2023-08-31 22:12:20,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-31 22:12:20,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-31 22:12:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4657 transitions. [2023-08-31 22:12:20,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31836204539239815 [2023-08-31 22:12:20,603 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4657 transitions. [2023-08-31 22:12:20,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4657 transitions. [2023-08-31 22:12:20,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:12:20,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4657 transitions. [2023-08-31 22:12:20,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 202.47826086956522) internal successors, (4657), 23 states have internal predecessors, (4657), 0 states have call successors, (0), 0 states 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:12:20,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 636.0) internal successors, (15264), 24 states have internal predecessors, (15264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:12:20,621 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 636.0) internal successors, (15264), 24 states have internal predecessors, (15264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:12:20,622 INFO L175 Difference]: Start difference. First operand has 159 places, 203 transitions, 1808 flow. Second operand 23 states and 4657 transitions. [2023-08-31 22:12:20,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 244 transitions, 2795 flow [2023-08-31 22:12:20,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 244 transitions, 2730 flow, removed 21 selfloop flow, removed 4 redundant places. [2023-08-31 22:12:20,674 INFO L231 Difference]: Finished difference. Result has 180 places, 199 transitions, 1881 flow [2023-08-31 22:12:20,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1619, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1881, PETRI_PLACES=180, PETRI_TRANSITIONS=199} [2023-08-31 22:12:20,675 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 74 predicate places. [2023-08-31 22:12:20,675 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 199 transitions, 1881 flow [2023-08-31 22:12:20,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 198.96153846153845) internal successors, (5173), 26 states have internal predecessors, (5173), 0 states have call successors, (0), 0 states 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:12:20,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:12:20,676 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-31 22:12:20,687 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:12:20,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:12:20,887 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:12:20,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:12:20,887 INFO L85 PathProgramCache]: Analyzing trace with hash -323090723, now seen corresponding path program 3 times [2023-08-31 22:12:20,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:12:20,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218088659] [2023-08-31 22:12:20,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:12:20,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:12:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:12:23,035 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:12:23,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:12:23,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218088659] [2023-08-31 22:12:23,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218088659] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:12:23,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131107118] [2023-08-31 22:12:23,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 22:12:23,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:12:23,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:12:23,038 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:12:23,038 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:12:23,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-31 22:12:23,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:12:23,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 84 conjunts are in the unsatisfiable core [2023-08-31 22:12:23,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:12:23,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:12:23,312 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 22:12:23,312 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:12:23,362 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-31 22:12:23,362 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:12:23,379 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:12:23,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:12:23,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:12:23,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-08-31 22:12:23,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-08-31 22:12:24,347 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:12:24,495 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:12:24,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:12:24,570 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:12:24,911 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:12:25,077 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:12:25,299 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:12:25,412 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:12:25,515 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:12:25,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:12:25,596 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1105 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1105) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1105 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1105) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-31 22:12:25,616 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1105 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1105) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1105 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1105) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-31 22:12:25,637 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1105 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1105) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1105 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1105) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-31 22:12:53,246 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-08-31 22:12:53,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131107118] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:12:53,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:12:53,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 15] total 38 [2023-08-31 22:12:53,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157068405] [2023-08-31 22:12:53,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:12:53,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-08-31 22:12:53,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:12:53,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-08-31 22:12:53,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1075, Unknown=39, NotChecked=216, Total=1560 [2023-08-31 22:12:55,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-31 22:12:55,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 199 transitions, 1881 flow. Second operand has 40 states, 40 states have (on average 167.65) internal successors, (6706), 40 states have internal predecessors, (6706), 0 states have call successors, (0), 0 states 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:12:55,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:12:55,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-31 22:12:55,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:13:16,522 WARN L222 SmtUtils]: Spent 18.43s on a formula simplification. DAG size of input: 246 DAG size of output: 222 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:13:20,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:13:51,618 WARN L222 SmtUtils]: Spent 20.59s on a formula simplification. DAG size of input: 236 DAG size of output: 222 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:13:53,737 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:03,448 WARN L222 SmtUtils]: Spent 8.52s on a formula simplification. DAG size of input: 110 DAG size of output: 85 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:14:06,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s 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:09,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s 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:21,838 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:23,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:14:26,514 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:33,218 INFO L130 PetriNetUnfolder]: 1366/2679 cut-off events. [2023-08-31 22:14:33,218 INFO L131 PetriNetUnfolder]: For 27993/28376 co-relation queries the response was YES. [2023-08-31 22:14:33,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16966 conditions, 2679 events. 1366/2679 cut-off events. For 27993/28376 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 14548 event pairs, 236 based on Foata normal form. 43/2634 useless extension candidates. Maximal degree in co-relation 16917. Up to 1271 conditions per place. [2023-08-31 22:14:33,232 INFO L137 encePairwiseOnDemand]: 620/636 looper letters, 192 selfloop transitions, 97 changer transitions 0/294 dead transitions. [2023-08-31 22:14:33,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 294 transitions, 3936 flow [2023-08-31 22:14:33,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-31 22:14:33,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-31 22:14:33,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4004 transitions. [2023-08-31 22:14:33,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27372162975116215 [2023-08-31 22:14:33,238 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4004 transitions. [2023-08-31 22:14:33,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4004 transitions. [2023-08-31 22:14:33,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:14:33,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4004 transitions. [2023-08-31 22:14:33,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 174.08695652173913) internal successors, (4004), 23 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states 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:14:33,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 636.0) internal successors, (15264), 24 states have internal predecessors, (15264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:14:33,254 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 636.0) internal successors, (15264), 24 states have internal predecessors, (15264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:14:33,254 INFO L175 Difference]: Start difference. First operand has 180 places, 199 transitions, 1881 flow. Second operand 23 states and 4004 transitions. [2023-08-31 22:14:33,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 294 transitions, 3936 flow [2023-08-31 22:14:33,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 294 transitions, 3792 flow, removed 36 selfloop flow, removed 17 redundant places. [2023-08-31 22:14:33,296 INFO L231 Difference]: Finished difference. Result has 197 places, 220 transitions, 2460 flow [2023-08-31 22:14:33,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1564, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2460, PETRI_PLACES=197, PETRI_TRANSITIONS=220} [2023-08-31 22:14:33,296 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 91 predicate places. [2023-08-31 22:14:33,297 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 220 transitions, 2460 flow [2023-08-31 22:14:33,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 167.65) internal successors, (6706), 40 states have internal predecessors, (6706), 0 states have call successors, (0), 0 states 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:14:33,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:14:33,298 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-31 22:14:33,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-31 22:14:33,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:14:33,501 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:14:33,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:14:33,501 INFO L85 PathProgramCache]: Analyzing trace with hash 202337711, now seen corresponding path program 4 times [2023-08-31 22:14:33,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:14:33,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520522623] [2023-08-31 22:14:33,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:14:33,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:14:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:14:35,476 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:14:35,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:14:35,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520522623] [2023-08-31 22:14:35,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520522623] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:14:35,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106521695] [2023-08-31 22:14:35,477 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 22:14:35,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:14:35,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:14:35,481 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:14:35,482 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:14:35,620 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 22:14:35,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:14:35,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 85 conjunts are in the unsatisfiable core [2023-08-31 22:14:35,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:14:35,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:14:35,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:14:35,730 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 22:14:35,730 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:14:35,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:14:35,754 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:14:35,775 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:14:35,806 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:14:36,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:14:36,309 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:14:36,519 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:14:36,857 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:14:37,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:14:37,061 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:14:37,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:14:37,391 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:14:37,642 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:14:37,970 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:14:38,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:14:38,105 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:14:38,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:14:38,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:14:38,376 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:14:38,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:14:38,464 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1223 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_1223 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-31 22:14:38,485 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-31 22:14:38,508 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-31 22:14:38,734 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1218 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1218) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse4) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1218 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1218) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse4) 4))))))) is different from false [2023-08-31 22:14:58,249 WARN L222 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:14:58,295 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse3 .cse4 v_ArrVal_1218) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (or (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse7 .cse4 v_ArrVal_1218) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4)))))))))) is different from false [2023-08-31 22:14:58,339 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int))) (let ((.cse2 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= (+ (* 4 (select (select (store (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse3 .cse4 v_ArrVal_1218) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int))) (let ((.cse6 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= 0 (+ (* 4 (select (select (store (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse7 .cse4 v_ArrVal_1218) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|))))))) is different from false [2023-08-31 22:14:58,386 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int))) (let ((.cse0 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= (+ (* (select (select (store (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse1 .cse2 v_ArrVal_1218) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int))) (let ((.cse6 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= 0 (+ (* (select (select (store (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse7 .cse2 v_ArrVal_1218) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|))))))) is different from false [2023-08-31 22:14:58,475 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (+ (select .cse5 .cse7) 1))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1212 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1212) .cse7 .cse8)) |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= 0 (+ (* (select (select (store (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse3 .cse4 v_ArrVal_1218) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1212 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1212) .cse7 .cse8)) |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= (+ (* (select (select (store (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse10 .cse4 v_ArrVal_1218) .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|)))))))) is different from false [2023-08-31 22:15:31,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-08-31 22:15:31,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106521695] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:15:31,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:15:31,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 14] total 36 [2023-08-31 22:15:31,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038866707] [2023-08-31 22:15:31,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:15:31,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-08-31 22:15:31,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:15:31,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-08-31 22:15:31,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=678, Unknown=40, NotChecked=504, Total=1406 [2023-08-31 22:15:31,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-31 22:15:31,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 220 transitions, 2460 flow. Second operand has 38 states, 38 states have (on average 167.73684210526315) internal successors, (6374), 38 states have internal predecessors, (6374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:15:31,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:15:31,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-31 22:15:31,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:15:43,614 WARN L222 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 101 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:15:45,748 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:15:47,761 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:49,778 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:15:51,784 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:15:53,792 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:15:55,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:15:57,824 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:15:59,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:16:01,903 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:16:03,914 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:16:05,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:16:07,989 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:16:08,006 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (select |c_#length| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1))) (and (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1218 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1218) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse4) 4)) .cse5)) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1218 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1218) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse4) 4)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1212 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1212) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (or (< (select .cse6 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= 0 (+ (* (select (select (store (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse8 .cse9 v_ArrVal_1218) .cse4 (+ (select .cse8 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1212 Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1212) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= (+ (* (select (select (store (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse11 .cse9 v_ArrVal_1218) .cse4 (+ (select .cse11 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) .cse5)) (< (select .cse12 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|)))))))) is different from false [2023-08-31 22:16:10,040 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:16:12,180 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:16:12,524 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#length| |c_~#queue~0.base|)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1)))))) (and (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4) 4) .cse2)) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int))) (let ((.cse3 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= (+ (* (select (select (store (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse4 .cse5 v_ArrVal_1218) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse2)) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int))) (let ((.cse7 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= 0 (+ (* (select (select (store (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse8 .cse5 v_ArrVal_1218) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|))))))) is different from false [2023-08-31 22:16:12,662 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#length| |c_~#queue~0.base|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int))) (let ((.cse2 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= (+ (* 4 (select (select (store (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse3 .cse4 v_ArrVal_1218) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) .cse5)))))) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (<= (+ (* (select (select (store (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse5)) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int))) (let ((.cse7 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= 0 (+ (* 4 (select (select (store (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse8 .cse4 v_ArrVal_1218) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|))))))) is different from false [2023-08-31 22:16:12,825 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#length| |c_~#queue~0.base|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse3 .cse4 v_ArrVal_1218) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4)) .cse5)))))) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse5)) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1215 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1215))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (or (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse8 .cse4 v_ArrVal_1218) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4)))))))))) is different from false [2023-08-31 22:16:12,916 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse4 .cse3)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse1 .cse2 v_ArrVal_1218) .cse3 (+ 1 (select .cse1 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))) (forall ((v_ArrVal_1223 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse3) 4)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1216 Int) (v_ArrVal_1218 Int)) (<= (+ (* (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1216))) (store (store .cse5 .cse2 v_ArrVal_1218) .cse3 (+ 1 (select .cse5 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse6)))) (forall ((v_ArrVal_1223 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse3) 4)) .cse6))))) is different from false [2023-08-31 22:16:15,128 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:17,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:16:19,514 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:16:22,373 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:22,466 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select |c_#length| |c_~#queue~0.base|)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4) 4) .cse2)) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (<= (+ (* (select (select (store (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse2)) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1223) |c_~#queue~0.base|) .cse1) 4))))))) is different from false [2023-08-31 22:16:24,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:16:27,284 INFO L130 PetriNetUnfolder]: 1935/3779 cut-off events. [2023-08-31 22:16:27,284 INFO L131 PetriNetUnfolder]: For 80545/81392 co-relation queries the response was YES. [2023-08-31 22:16:27,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30629 conditions, 3779 events. 1935/3779 cut-off events. For 80545/81392 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 21861 event pairs, 323 based on Foata normal form. 38/3699 useless extension candidates. Maximal degree in co-relation 30571. Up to 1587 conditions per place. [2023-08-31 22:16:27,316 INFO L137 encePairwiseOnDemand]: 617/636 looper letters, 209 selfloop transitions, 223 changer transitions 0/437 dead transitions. [2023-08-31 22:16:27,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 437 transitions, 7083 flow [2023-08-31 22:16:27,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-31 22:16:27,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-31 22:16:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5237 transitions. [2023-08-31 22:16:27,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27447589098532493 [2023-08-31 22:16:27,323 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5237 transitions. [2023-08-31 22:16:27,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5237 transitions. [2023-08-31 22:16:27,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:16:27,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5237 transitions. [2023-08-31 22:16:27,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 174.56666666666666) internal successors, (5237), 30 states have internal predecessors, (5237), 0 states have call successors, (0), 0 states 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:27,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 636.0) internal successors, (19716), 31 states have internal predecessors, (19716), 0 states have call successors, (0), 0 states 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:27,345 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 636.0) internal successors, (19716), 31 states have internal predecessors, (19716), 0 states have call successors, (0), 0 states 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:27,345 INFO L175 Difference]: Start difference. First operand has 197 places, 220 transitions, 2460 flow. Second operand 30 states and 5237 transitions. [2023-08-31 22:16:27,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 437 transitions, 7083 flow [2023-08-31 22:16:27,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 437 transitions, 6449 flow, removed 285 selfloop flow, removed 7 redundant places. [2023-08-31 22:16:27,446 INFO L231 Difference]: Finished difference. Result has 233 places, 399 transitions, 6135 flow [2023-08-31 22:16:27,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=2036, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=6135, PETRI_PLACES=233, PETRI_TRANSITIONS=399} [2023-08-31 22:16:27,446 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 127 predicate places. [2023-08-31 22:16:27,446 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 399 transitions, 6135 flow [2023-08-31 22:16:27,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 167.73684210526315) internal successors, (6374), 38 states have internal predecessors, (6374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:16:27,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:16:27,448 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2023-08-31 22:16:27,453 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:16:27,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-08-31 22:16:27,648 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:27,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:16:27,649 INFO L85 PathProgramCache]: Analyzing trace with hash -362138138, now seen corresponding path program 5 times [2023-08-31 22:16:27,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:16:27,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010628076] [2023-08-31 22:16:27,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:16:27,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:16:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:16:32,187 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:16:32,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:16:32,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010628076] [2023-08-31 22:16:32,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010628076] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:16:32,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85095408] [2023-08-31 22:16:32,188 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 22:16:32,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:16:32,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:16:32,189 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:16:32,190 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:16:32,747 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-08-31 22:16:32,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:16:32,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 118 conjunts are in the unsatisfiable core [2023-08-31 22:16:32,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:16:32,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:16:32,901 INFO L321 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2023-08-31 22:16:32,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2023-08-31 22:16:32,942 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-31 22:16:32,943 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:33,561 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 46 treesize of output 37 [2023-08-31 22:16:33,632 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-31 22:16:33,632 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 27 [2023-08-31 22:16:34,100 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:16:34,669 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:16:34,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:16:34,878 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 28 treesize of output 30 [2023-08-31 22:16:35,174 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:16:35,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2023-08-31 22:16:36,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2023-08-31 22:16:36,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:16:36,548 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 61 treesize of output 63 [2023-08-31 22:16:36,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:16:36,780 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 61 treesize of output 63 [2023-08-31 22:16:37,147 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 75 treesize of output 68 [2023-08-31 22:16:37,553 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 71 treesize of output 66 [2023-08-31 22:16:38,859 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 77 treesize of output 70 [2023-08-31 22:16:39,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:16:39,208 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 127 treesize of output 129 [2023-08-31 22:16:39,522 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:16:39,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:16:40,015 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1365 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1365 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2023-08-31 22:16:40,414 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1362 Int) (v_ArrVal_1365 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1362) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1362 Int) (v_ArrVal_1365 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1362) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2023-08-31 22:16:40,458 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1360 Int) (v_ArrVal_1362 Int) (v_ArrVal_1365 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_1360))) (store (store .cse0 .cse1 v_ArrVal_1362) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse5) 4)))) (forall ((v_ArrVal_1360 Int) (v_ArrVal_1362 Int) (v_ArrVal_1365 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_1360))) (store (store .cse6 .cse1 v_ArrVal_1362) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse5) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-31 22:16:48,356 WARN L222 SmtUtils]: Spent 6.81s 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:16:48,396 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1358 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1358))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1360 Int) (v_ArrVal_1362 Int) (v_ArrVal_1365 (Array Int Int))) (<= (+ (* 4 (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1360))) (store (store .cse3 .cse4 v_ArrVal_1362) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))) (forall ((v_ArrVal_1358 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1358))) (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1360 Int) (v_ArrVal_1362 Int) (v_ArrVal_1365 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1360))) (store (store .cse6 .cse4 v_ArrVal_1362) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|))))))) is different from false [2023-08-31 22:16:49,550 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse11 (select .cse9 .cse10))) (or (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse9 .cse10 (+ .cse11 1))))) (and (forall ((v_ArrVal_1358 (Array Int Int)) (v_ArrVal_1357 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse2 (store (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1357) |c_~#stored_elements~0.base| v_ArrVal_1358))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (forall ((v_ArrVal_1360 Int) (v_ArrVal_1362 Int) (v_ArrVal_1365 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1360))) (store (store .cse3 .cse4 v_ArrVal_1362) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))))) (forall ((v_ArrVal_1358 (Array Int Int)) (v_ArrVal_1357 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int)) (let ((.cse6 (store (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1357) |c_~#stored_elements~0.base| v_ArrVal_1358))) (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1360 Int) (v_ArrVal_1362 Int) (v_ArrVal_1365 (Array Int Int))) (<= (+ (* (select (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1360))) (store (store .cse7 .cse4 v_ArrVal_1362) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|))))))) (= 400 .cse11) (< |c_ULTIMATE.start_main_~#id2~0#1.offset| 0)))) is different from false [2023-08-31 22:17:01,311 WARN L222 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:17:29,406 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 6 times theorem prover too weak. 0 trivial. 12 not checked. [2023-08-31 22:17:29,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85095408] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:17:29,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:17:29,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 23] total 57 [2023-08-31 22:17:29,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203405322] [2023-08-31 22:17:29,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:17:29,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-08-31 22:17:29,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:17:29,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-08-31 22:17:29,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=2482, Unknown=87, NotChecked=540, Total=3422 [2023-08-31 22:17:30,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-31 22:17:30,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 399 transitions, 6135 flow. Second operand has 59 states, 59 states have (on average 167.52542372881356) internal successors, (9884), 59 states have internal predecessors, (9884), 0 states have call successors, (0), 0 states 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:17:30,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:17:30,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-31 22:17:30,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:17:56,878 WARN L222 SmtUtils]: Spent 8.47s on a formula simplification. DAG size of input: 312 DAG size of output: 56 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:18:03,724 WARN L222 SmtUtils]: Spent 5.26s on a formula simplification. DAG size of input: 495 DAG size of output: 63 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:18:16,754 WARN L222 SmtUtils]: Spent 5.61s on a formula simplification. DAG size of input: 506 DAG size of output: 63 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:18:56,510 WARN L222 SmtUtils]: Spent 26.13s on a formula simplification. DAG size of input: 418 DAG size of output: 414 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:19:38,123 WARN L222 SmtUtils]: Spent 8.28s on a formula simplification. DAG size of input: 114 DAG size of output: 113 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:19:45,123 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:19:50,308 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:19:52,319 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:19:54,327 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:19:56,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:19:58,481 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:20:00,494 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:20:02,524 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:20:04,534 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:20:06,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:20:08,545 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:20:10,548 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:20:12,568 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:21:03,872 WARN L222 SmtUtils]: Spent 37.30s on a formula simplification. DAG size of input: 174 DAG size of output: 162 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:21:05,881 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:21:07,885 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:21:09,888 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:21:11,890 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:21:13,894 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:21:15,898 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:21:17,900 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:21:19,903 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:21:21,912 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:21:23,919 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:21:25,920 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:21:27,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:21:29,937 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:21:32,308 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:21:34,311 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:21:36,314 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:21:38,315 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:21:40,318 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:21:42,320 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:21:44,323 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:21:46,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:21:48,333 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:21:51,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:21:53,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:21:55,931 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:21:57,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:21:59,936 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:22:01,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 [0, 1] [2023-08-31 22:22:03,944 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:22:05,946 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:22:07,950 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:22:09,952 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] Killed by 15