./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --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/goblint-regression/28-race_reach_75-tricky_address2_racefree.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 3c0354ee6107efc04d15102ecf9eef73430e38e14b70f16419cd07cd733fd0df --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 21:53:41,442 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 21:53:41,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 21:53:41,488 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 21:53:41,488 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 21:53:41,491 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 21:53:41,493 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 21:53:41,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 21:53:41,498 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 21:53:41,502 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 21:53:41,503 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 21:53:41,506 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 21:53:41,506 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 21:53:41,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 21:53:41,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 21:53:41,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 21:53:41,515 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 21:53:41,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 21:53:41,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 21:53:41,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 21:53:41,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 21:53:41,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 21:53:41,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 21:53:41,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 21:53:41,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 21:53:41,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 21:53:41,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 21:53:41,535 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 21:53:41,535 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 21:53:41,536 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 21:53:41,536 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 21:53:41,537 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 21:53:41,539 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 21:53:41,540 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 21:53:41,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 21:53:41,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 21:53:41,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 21:53:41,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 21:53:41,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 21:53:41,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 21:53:41,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 21:53:41,544 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 21:53:41,575 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 21:53:41,576 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 21:53:41,577 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 21:53:41,577 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 21:53:41,578 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 21:53:41,578 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 21:53:41,578 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 21:53:41,578 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 21:53:41,579 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 21:53:41,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 21:53:41,580 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 21:53:41,580 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 21:53:41,580 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 21:53:41,580 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 21:53:41,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 21:53:41,580 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 21:53:41,581 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 21:53:41,581 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 21:53:41,581 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 21:53:41,581 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 21:53:41,581 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 21:53:41,581 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 21:53:41,582 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 21:53:41,582 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 21:53:41,582 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 21:53:41,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 21:53:41,582 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 21:53:41,583 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 21:53:41,583 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 21:53:41,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 21:53:41,583 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 21:53:41,583 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 21:53:41,584 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 21:53:41,584 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 21:53:41,584 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 -> 3c0354ee6107efc04d15102ecf9eef73430e38e14b70f16419cd07cd733fd0df 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 -> AFTER [2023-08-29 21:53:41,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 21:53:41,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 21:53:41,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 21:53:41,891 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 21:53:41,891 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 21:53:41,892 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2023-08-29 21:53:43,123 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 21:53:43,351 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 21:53:43,353 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2023-08-29 21:53:43,366 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2130c8a08/c5107dd07079401ea7737bb4a0a0d33c/FLAGf799829d7 [2023-08-29 21:53:43,380 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2130c8a08/c5107dd07079401ea7737bb4a0a0d33c [2023-08-29 21:53:43,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 21:53:43,384 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 21:53:43,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 21:53:43,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 21:53:43,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 21:53:43,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 09:53:43" (1/1) ... [2023-08-29 21:53:43,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@218eca7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:53:43, skipping insertion in model container [2023-08-29 21:53:43,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 09:53:43" (1/1) ... [2023-08-29 21:53:43,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 21:53:43,452 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 21:53:43,808 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i[41323,41336] [2023-08-29 21:53:43,843 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 21:53:43,866 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 21:53:43,913 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i[41323,41336] [2023-08-29 21:53:43,922 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 21:53:43,976 INFO L208 MainTranslator]: Completed translation [2023-08-29 21:53:43,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:53:43 WrapperNode [2023-08-29 21:53:43,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 21:53:43,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 21:53:43,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 21:53:43,979 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 21:53:43,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:53:43" (1/1) ... [2023-08-29 21:53:44,016 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:53:43" (1/1) ... [2023-08-29 21:53:44,053 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 190 [2023-08-29 21:53:44,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 21:53:44,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 21:53:44,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 21:53:44,055 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 21:53:44,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:53:43" (1/1) ... [2023-08-29 21:53:44,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:53:43" (1/1) ... [2023-08-29 21:53:44,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:53:43" (1/1) ... [2023-08-29 21:53:44,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:53:43" (1/1) ... [2023-08-29 21:53:44,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:53:43" (1/1) ... [2023-08-29 21:53:44,101 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:53:43" (1/1) ... [2023-08-29 21:53:44,103 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:53:43" (1/1) ... [2023-08-29 21:53:44,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:53:43" (1/1) ... [2023-08-29 21:53:44,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 21:53:44,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 21:53:44,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 21:53:44,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 21:53:44,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:53:43" (1/1) ... [2023-08-29 21:53:44,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 21:53:44,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:53:44,146 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-29 21:53:44,148 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-29 21:53:44,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 21:53:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 21:53:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 21:53:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 21:53:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-29 21:53:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 21:53:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-29 21:53:44,175 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-29 21:53:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 21:53:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 21:53:44,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 21:53:44,176 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 21:53:44,289 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 21:53:44,291 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 21:53:44,621 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 21:53:44,629 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 21:53:44,629 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-29 21:53:44,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 09:53:44 BoogieIcfgContainer [2023-08-29 21:53:44,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 21:53:44,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 21:53:44,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 21:53:44,635 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 21:53:44,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 09:53:43" (1/3) ... [2023-08-29 21:53:44,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dbfb507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 09:53:44, skipping insertion in model container [2023-08-29 21:53:44,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:53:43" (2/3) ... [2023-08-29 21:53:44,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dbfb507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 09:53:44, skipping insertion in model container [2023-08-29 21:53:44,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 09:53:44" (3/3) ... [2023-08-29 21:53:44,638 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_75-tricky_address2_racefree.i [2023-08-29 21:53:44,652 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 21:53:44,652 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2023-08-29 21:53:44,652 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 21:53:44,751 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-29 21:53:44,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 218 transitions, 444 flow [2023-08-29 21:53:44,886 INFO L130 PetriNetUnfolder]: 45/305 cut-off events. [2023-08-29 21:53:44,888 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-08-29 21:53:44,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 305 events. 45/305 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1160 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 170. Up to 8 conditions per place. [2023-08-29 21:53:44,897 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 218 transitions, 444 flow [2023-08-29 21:53:44,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 190 places, 218 transitions, 444 flow [2023-08-29 21:53:44,913 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 21:53:44,927 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 190 places, 218 transitions, 444 flow [2023-08-29 21:53:44,933 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 218 transitions, 444 flow [2023-08-29 21:53:44,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 218 transitions, 444 flow [2023-08-29 21:53:45,014 INFO L130 PetriNetUnfolder]: 45/305 cut-off events. [2023-08-29 21:53:45,015 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-08-29 21:53:45,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 305 events. 45/305 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1160 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 170. Up to 8 conditions per place. [2023-08-29 21:53:45,034 INFO L119 LiptonReduction]: Number of co-enabled transitions 14508 [2023-08-29 21:53:48,689 INFO L134 LiptonReduction]: Checked pairs total: 29354 [2023-08-29 21:53:48,689 INFO L136 LiptonReduction]: Total number of compositions: 201 [2023-08-29 21:53:48,702 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 21:53:48,707 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;@3c1e3368, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 21:53:48,707 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2023-08-29 21:53:48,709 INFO L130 PetriNetUnfolder]: 1/5 cut-off events. [2023-08-29 21:53:48,710 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 21:53:48,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:53:48,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 21:53:48,711 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 21:53:48,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:53:48,715 INFO L85 PathProgramCache]: Analyzing trace with hash 862756, now seen corresponding path program 1 times [2023-08-29 21:53:48,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:53:48,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975150722] [2023-08-29 21:53:48,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:48,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:53:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:48,974 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-29 21:53:48,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:53:48,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975150722] [2023-08-29 21:53:48,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975150722] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:53:48,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:53:48,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 21:53:48,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426163131] [2023-08-29 21:53:48,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:53:48,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:53:48,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:53:49,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:53:49,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 21:53:49,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 419 [2023-08-29 21:53:49,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 93 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:49,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:53:49,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 419 [2023-08-29 21:53:49,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:53:49,327 INFO L130 PetriNetUnfolder]: 621/1407 cut-off events. [2023-08-29 21:53:49,328 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 21:53:49,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2640 conditions, 1407 events. 621/1407 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9184 event pairs, 570 based on Foata normal form. 104/1008 useless extension candidates. Maximal degree in co-relation 2555. Up to 1225 conditions per place. [2023-08-29 21:53:49,336 INFO L137 encePairwiseOnDemand]: 389/419 looper letters, 54 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-08-29 21:53:49,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 67 transitions, 254 flow [2023-08-29 21:53:49,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:53:49,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:53:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2023-08-29 21:53:49,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035799522673031 [2023-08-29 21:53:49,355 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 633 transitions. [2023-08-29 21:53:49,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 633 transitions. [2023-08-29 21:53:49,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:53:49,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 633 transitions. [2023-08-29 21:53:49,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:49,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:49,375 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:49,377 INFO L175 Difference]: Start difference. First operand has 71 places, 93 transitions, 194 flow. Second operand 3 states and 633 transitions. [2023-08-29 21:53:49,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 67 transitions, 254 flow [2023-08-29 21:53:49,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 67 transitions, 254 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 21:53:49,383 INFO L231 Difference]: Finished difference. Result has 68 places, 67 transitions, 152 flow [2023-08-29 21:53:49,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=68, PETRI_TRANSITIONS=67} [2023-08-29 21:53:49,388 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -3 predicate places. [2023-08-29 21:53:49,388 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 67 transitions, 152 flow [2023-08-29 21:53:49,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:49,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:53:49,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 21:53:49,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 21:53:49,389 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 21:53:49,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:53:49,392 INFO L85 PathProgramCache]: Analyzing trace with hash 26729995, now seen corresponding path program 1 times [2023-08-29 21:53:49,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:53:49,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795522138] [2023-08-29 21:53:49,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:49,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:53:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:49,520 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-29 21:53:49,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:53:49,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795522138] [2023-08-29 21:53:49,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795522138] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:53:49,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775075739] [2023-08-29 21:53:49,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:49,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:53:49,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:53:49,529 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-29 21:53:49,571 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-29 21:53:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:49,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 21:53:49,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:53:49,707 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-29 21:53:49,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:53:49,727 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-29 21:53:49,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775075739] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:53:49,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:53:49,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 21:53:49,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990223430] [2023-08-29 21:53:49,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:53:49,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 21:53:49,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:53:49,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 21:53:49,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 21:53:49,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 419 [2023-08-29 21:53:49,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 152 flow. Second operand has 7 states, 7 states have (on average 183.28571428571428) internal successors, (1283), 7 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:49,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:53:49,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 419 [2023-08-29 21:53:49,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:53:50,012 INFO L130 PetriNetUnfolder]: 621/1410 cut-off events. [2023-08-29 21:53:50,013 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 21:53:50,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2656 conditions, 1410 events. 621/1410 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9196 event pairs, 570 based on Foata normal form. 0/907 useless extension candidates. Maximal degree in co-relation 2644. Up to 1225 conditions per place. [2023-08-29 21:53:50,020 INFO L137 encePairwiseOnDemand]: 416/419 looper letters, 54 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2023-08-29 21:53:50,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 70 transitions, 282 flow [2023-08-29 21:53:50,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 21:53:50,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 21:53:50,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1154 transitions. [2023-08-29 21:53:50,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4590294351630867 [2023-08-29 21:53:50,023 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1154 transitions. [2023-08-29 21:53:50,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1154 transitions. [2023-08-29 21:53:50,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:53:50,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1154 transitions. [2023-08-29 21:53:50,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:50,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 419.0) internal successors, (2933), 7 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:50,032 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 419.0) internal successors, (2933), 7 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:50,032 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 152 flow. Second operand 6 states and 1154 transitions. [2023-08-29 21:53:50,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 70 transitions, 282 flow [2023-08-29 21:53:50,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 70 transitions, 278 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 21:53:50,035 INFO L231 Difference]: Finished difference. Result has 75 places, 70 transitions, 184 flow [2023-08-29 21:53:50,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=75, PETRI_TRANSITIONS=70} [2023-08-29 21:53:50,036 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 4 predicate places. [2023-08-29 21:53:50,036 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 70 transitions, 184 flow [2023-08-29 21:53:50,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 183.28571428571428) internal successors, (1283), 7 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:50,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:53:50,038 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-29 21:53:50,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-29 21:53:50,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:53:50,244 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 21:53:50,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:53:50,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1728936806, now seen corresponding path program 2 times [2023-08-29 21:53:50,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:53:50,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353305542] [2023-08-29 21:53:50,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:50,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:53:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:53:50,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:53:50,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353305542] [2023-08-29 21:53:50,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353305542] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:53:50,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:53:50,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 21:53:50,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696288092] [2023-08-29 21:53:50,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:53:50,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:53:50,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:53:50,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:53:50,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 21:53:50,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 419 [2023-08-29 21:53:50,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 70 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:50,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:53:50,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 419 [2023-08-29 21:53:50,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:53:50,606 INFO L130 PetriNetUnfolder]: 579/1314 cut-off events. [2023-08-29 21:53:50,607 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 21:53:50,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2493 conditions, 1314 events. 579/1314 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8505 event pairs, 494 based on Foata normal form. 0/867 useless extension candidates. Maximal degree in co-relation 2459. Up to 1062 conditions per place. [2023-08-29 21:53:50,614 INFO L137 encePairwiseOnDemand]: 414/419 looper letters, 73 selfloop transitions, 3 changer transitions 0/87 dead transitions. [2023-08-29 21:53:50,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 87 transitions, 370 flow [2023-08-29 21:53:50,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:53:50,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:53:50,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 611 transitions. [2023-08-29 21:53:50,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48607796340493237 [2023-08-29 21:53:50,617 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 611 transitions. [2023-08-29 21:53:50,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 611 transitions. [2023-08-29 21:53:50,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:53:50,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 611 transitions. [2023-08-29 21:53:50,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:50,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:50,622 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:50,622 INFO L175 Difference]: Start difference. First operand has 75 places, 70 transitions, 184 flow. Second operand 3 states and 611 transitions. [2023-08-29 21:53:50,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 87 transitions, 370 flow [2023-08-29 21:53:50,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 87 transitions, 356 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-29 21:53:50,625 INFO L231 Difference]: Finished difference. Result has 74 places, 68 transitions, 172 flow [2023-08-29 21:53:50,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=74, PETRI_TRANSITIONS=68} [2023-08-29 21:53:50,626 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 3 predicate places. [2023-08-29 21:53:50,626 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 68 transitions, 172 flow [2023-08-29 21:53:50,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:50,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:53:50,627 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-29 21:53:50,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 21:53:50,627 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 21:53:50,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:53:50,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1728936804, now seen corresponding path program 1 times [2023-08-29 21:53:50,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:53:50,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426647709] [2023-08-29 21:53:50,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:50,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:53:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:50,703 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-29 21:53:50,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:53:50,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426647709] [2023-08-29 21:53:50,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426647709] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:53:50,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997892702] [2023-08-29 21:53:50,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:50,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:53:50,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:53:50,706 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-29 21:53:50,737 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-29 21:53:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:50,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 21:53:50,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:53:50,803 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-29 21:53:50,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:53:50,852 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-29 21:53:50,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997892702] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:53:50,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:53:50,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-29 21:53:50,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541550564] [2023-08-29 21:53:50,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:53:50,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 21:53:50,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:53:50,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 21:53:50,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-29 21:53:50,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 419 [2023-08-29 21:53:50,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 68 transitions, 172 flow. Second operand has 13 states, 13 states have (on average 183.15384615384616) internal successors, (2381), 13 states have internal predecessors, (2381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:50,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:53:50,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 419 [2023-08-29 21:53:50,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:53:51,114 INFO L130 PetriNetUnfolder]: 581/1326 cut-off events. [2023-08-29 21:53:51,114 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2023-08-29 21:53:51,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2560 conditions, 1326 events. 581/1326 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8510 event pairs, 532 based on Foata normal form. 6/906 useless extension candidates. Maximal degree in co-relation 2508. Up to 1145 conditions per place. [2023-08-29 21:53:51,121 INFO L137 encePairwiseOnDemand]: 416/419 looper letters, 52 selfloop transitions, 11 changer transitions 0/74 dead transitions. [2023-08-29 21:53:51,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 74 transitions, 334 flow [2023-08-29 21:53:51,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 21:53:51,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 21:53:51,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2253 transitions. [2023-08-29 21:53:51,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.448090692124105 [2023-08-29 21:53:51,127 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2253 transitions. [2023-08-29 21:53:51,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2253 transitions. [2023-08-29 21:53:51,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:53:51,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2253 transitions. [2023-08-29 21:53:51,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 187.75) internal successors, (2253), 12 states have internal predecessors, (2253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:51,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 419.0) internal successors, (5447), 13 states have internal predecessors, (5447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:51,141 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 419.0) internal successors, (5447), 13 states have internal predecessors, (5447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:51,141 INFO L175 Difference]: Start difference. First operand has 74 places, 68 transitions, 172 flow. Second operand 12 states and 2253 transitions. [2023-08-29 21:53:51,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 74 transitions, 334 flow [2023-08-29 21:53:51,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 74 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 21:53:51,145 INFO L231 Difference]: Finished difference. Result has 89 places, 74 transitions, 250 flow [2023-08-29 21:53:51,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=250, PETRI_PLACES=89, PETRI_TRANSITIONS=74} [2023-08-29 21:53:51,146 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 18 predicate places. [2023-08-29 21:53:51,146 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 74 transitions, 250 flow [2023-08-29 21:53:51,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 183.15384615384616) internal successors, (2381), 13 states have internal predecessors, (2381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:51,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:53:51,147 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2023-08-29 21:53:51,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-29 21:53:51,353 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,SelfDestructingSolverStorable3 [2023-08-29 21:53:51,353 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 21:53:51,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:53:51,354 INFO L85 PathProgramCache]: Analyzing trace with hash 316868932, now seen corresponding path program 2 times [2023-08-29 21:53:51,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:53:51,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362989620] [2023-08-29 21:53:51,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:51,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:53:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:51,488 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:53:51,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:53:51,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362989620] [2023-08-29 21:53:51,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362989620] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:53:51,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:53:51,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 21:53:51,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702160526] [2023-08-29 21:53:51,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:53:51,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:53:51,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:53:51,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:53:51,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 21:53:51,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 419 [2023-08-29 21:53:51,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 74 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:51,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:53:51,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 419 [2023-08-29 21:53:51,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:53:51,751 INFO L130 PetriNetUnfolder]: 554/1219 cut-off events. [2023-08-29 21:53:51,752 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2023-08-29 21:53:51,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2436 conditions, 1219 events. 554/1219 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8104 event pairs, 0 based on Foata normal form. 0/801 useless extension candidates. Maximal degree in co-relation 2360. Up to 1111 conditions per place. [2023-08-29 21:53:51,758 INFO L137 encePairwiseOnDemand]: 415/419 looper letters, 81 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2023-08-29 21:53:51,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 94 transitions, 456 flow [2023-08-29 21:53:51,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:53:51,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:53:51,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 621 transitions. [2023-08-29 21:53:51,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49403341288782815 [2023-08-29 21:53:51,761 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 621 transitions. [2023-08-29 21:53:51,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 621 transitions. [2023-08-29 21:53:51,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:53:51,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 621 transitions. [2023-08-29 21:53:51,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:51,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:51,765 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:51,766 INFO L175 Difference]: Start difference. First operand has 89 places, 74 transitions, 250 flow. Second operand 3 states and 621 transitions. [2023-08-29 21:53:51,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 94 transitions, 456 flow [2023-08-29 21:53:51,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 94 transitions, 408 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-29 21:53:51,770 INFO L231 Difference]: Finished difference. Result has 87 places, 74 transitions, 212 flow [2023-08-29 21:53:51,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=87, PETRI_TRANSITIONS=74} [2023-08-29 21:53:51,770 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 16 predicate places. [2023-08-29 21:53:51,771 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 74 transitions, 212 flow [2023-08-29 21:53:51,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:51,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:53:51,771 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-08-29 21:53:51,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 21:53:51,772 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 21:53:51,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:53:51,772 INFO L85 PathProgramCache]: Analyzing trace with hash -495094452, now seen corresponding path program 1 times [2023-08-29 21:53:51,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:53:51,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224086847] [2023-08-29 21:53:51,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:51,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:53:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:53:51,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:53:51,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224086847] [2023-08-29 21:53:51,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224086847] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:53:51,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616997263] [2023-08-29 21:53:51,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:51,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:53:51,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:53:51,887 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-29 21:53:51,897 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-29 21:53:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:51,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-29 21:53:51,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:53:52,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-29 21:53:52,070 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:53:52,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:53:52,125 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:53:52,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616997263] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:53:52,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:53:52,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2023-08-29 21:53:52,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078138717] [2023-08-29 21:53:52,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:53:52,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 21:53:52,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:53:52,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 21:53:52,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-29 21:53:52,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 419 [2023-08-29 21:53:52,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 74 transitions, 212 flow. Second operand has 8 states, 8 states have (on average 180.125) internal successors, (1441), 8 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:52,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:53:52,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 419 [2023-08-29 21:53:52,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:53:52,459 INFO L130 PetriNetUnfolder]: 42/134 cut-off events. [2023-08-29 21:53:52,460 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2023-08-29 21:53:52,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 134 events. 42/134 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 444 event pairs, 15 based on Foata normal form. 20/133 useless extension candidates. Maximal degree in co-relation 280. Up to 78 conditions per place. [2023-08-29 21:53:52,461 INFO L137 encePairwiseOnDemand]: 415/419 looper letters, 43 selfloop transitions, 2 changer transitions 11/63 dead transitions. [2023-08-29 21:53:52,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 63 transitions, 293 flow [2023-08-29 21:53:52,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 21:53:52,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 21:53:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 759 transitions. [2023-08-29 21:53:52,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4528639618138425 [2023-08-29 21:53:52,463 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 759 transitions. [2023-08-29 21:53:52,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 759 transitions. [2023-08-29 21:53:52,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:53:52,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 759 transitions. [2023-08-29 21:53:52,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 189.75) internal successors, (759), 4 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:52,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 419.0) internal successors, (2095), 5 states have internal predecessors, (2095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:52,469 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 419.0) internal successors, (2095), 5 states have internal predecessors, (2095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:52,469 INFO L175 Difference]: Start difference. First operand has 87 places, 74 transitions, 212 flow. Second operand 4 states and 759 transitions. [2023-08-29 21:53:52,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 63 transitions, 293 flow [2023-08-29 21:53:52,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 63 transitions, 287 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 21:53:52,471 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 129 flow [2023-08-29 21:53:52,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2023-08-29 21:53:52,472 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -13 predicate places. [2023-08-29 21:53:52,472 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 129 flow [2023-08-29 21:53:52,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 180.125) internal successors, (1441), 8 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:52,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:53:52,473 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:53:52,481 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-29 21:53:52,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:53:52,679 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 21:53:52,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:53:52,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1831967456, now seen corresponding path program 1 times [2023-08-29 21:53:52,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:53:52,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228842446] [2023-08-29 21:53:52,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:52,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:53:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:52,905 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:53:52,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:53:52,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228842446] [2023-08-29 21:53:52,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228842446] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:53:52,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:53:52,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 21:53:52,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363282719] [2023-08-29 21:53:52,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:53:52,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 21:53:52,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:53:52,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 21:53:52,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 21:53:53,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 419 [2023-08-29 21:53:53,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 37 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:53,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:53:53,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 419 [2023-08-29 21:53:53,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:53:53,095 INFO L130 PetriNetUnfolder]: 21/74 cut-off events. [2023-08-29 21:53:53,095 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2023-08-29 21:53:53,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 74 events. 21/74 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 145 event pairs, 0 based on Foata normal form. 6/77 useless extension candidates. Maximal degree in co-relation 142. Up to 50 conditions per place. [2023-08-29 21:53:53,096 INFO L137 encePairwiseOnDemand]: 409/419 looper letters, 19 selfloop transitions, 2 changer transitions 8/31 dead transitions. [2023-08-29 21:53:53,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 31 transitions, 175 flow [2023-08-29 21:53:53,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 21:53:53,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 21:53:53,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 678 transitions. [2023-08-29 21:53:53,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4045346062052506 [2023-08-29 21:53:53,098 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 678 transitions. [2023-08-29 21:53:53,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 678 transitions. [2023-08-29 21:53:53,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:53:53,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 678 transitions. [2023-08-29 21:53:53,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 169.5) internal successors, (678), 4 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:53,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 419.0) internal successors, (2095), 5 states have internal predecessors, (2095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:53,103 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 419.0) internal successors, (2095), 5 states have internal predecessors, (2095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:53,103 INFO L175 Difference]: Start difference. First operand has 58 places, 37 transitions, 129 flow. Second operand 4 states and 678 transitions. [2023-08-29 21:53:53,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 31 transitions, 175 flow [2023-08-29 21:53:53,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 31 transitions, 171 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 21:53:53,105 INFO L231 Difference]: Finished difference. Result has 46 places, 21 transitions, 98 flow [2023-08-29 21:53:53,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=46, PETRI_TRANSITIONS=21} [2023-08-29 21:53:53,106 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -25 predicate places. [2023-08-29 21:53:53,106 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 21 transitions, 98 flow [2023-08-29 21:53:53,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:53,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:53:53,107 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:53:53,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 21:53:53,107 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 21:53:53,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:53:53,108 INFO L85 PathProgramCache]: Analyzing trace with hash 956412340, now seen corresponding path program 1 times [2023-08-29 21:53:53,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:53:53,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885056723] [2023-08-29 21:53:53,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:53,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:53:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:53,276 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:53:53,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:53:53,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885056723] [2023-08-29 21:53:53,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885056723] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:53:53,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:53:53,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 21:53:53,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761976310] [2023-08-29 21:53:53,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:53:53,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 21:53:53,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:53:53,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 21:53:53,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-08-29 21:53:53,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 419 [2023-08-29 21:53:53,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 21 transitions, 98 flow. Second operand has 6 states, 6 states have (on average 164.33333333333334) internal successors, (986), 6 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:53,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:53:53,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 419 [2023-08-29 21:53:53,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:53:53,490 INFO L130 PetriNetUnfolder]: 5/32 cut-off events. [2023-08-29 21:53:53,491 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-29 21:53:53,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 32 events. 5/32 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 4 based on Foata normal form. 3/35 useless extension candidates. Maximal degree in co-relation 59. Up to 15 conditions per place. [2023-08-29 21:53:53,491 INFO L137 encePairwiseOnDemand]: 416/419 looper letters, 0 selfloop transitions, 0 changer transitions 20/20 dead transitions. [2023-08-29 21:53:53,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 20 transitions, 132 flow [2023-08-29 21:53:53,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 21:53:53,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 21:53:53,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 661 transitions. [2023-08-29 21:53:53,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3943914081145585 [2023-08-29 21:53:53,493 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 661 transitions. [2023-08-29 21:53:53,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 661 transitions. [2023-08-29 21:53:53,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:53:53,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 661 transitions. [2023-08-29 21:53:53,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 165.25) internal successors, (661), 4 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:53,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 419.0) internal successors, (2095), 5 states have internal predecessors, (2095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:53,498 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 419.0) internal successors, (2095), 5 states have internal predecessors, (2095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:53,498 INFO L175 Difference]: Start difference. First operand has 46 places, 21 transitions, 98 flow. Second operand 4 states and 661 transitions. [2023-08-29 21:53:53,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 20 transitions, 132 flow [2023-08-29 21:53:53,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 20 transitions, 129 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 21:53:53,499 INFO L231 Difference]: Finished difference. Result has 38 places, 0 transitions, 0 flow [2023-08-29 21:53:53,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=38, PETRI_TRANSITIONS=0} [2023-08-29 21:53:53,500 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -33 predicate places. [2023-08-29 21:53:53,500 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 0 transitions, 0 flow [2023-08-29 21:53:53,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 164.33333333333334) internal successors, (986), 6 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:53,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 38 remaining) [2023-08-29 21:53:53,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 38 remaining) [2023-08-29 21:53:53,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 38 remaining) [2023-08-29 21:53:53,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 38 remaining) [2023-08-29 21:53:53,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 38 remaining) [2023-08-29 21:53:53,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 38 remaining) [2023-08-29 21:53:53,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 38 remaining) [2023-08-29 21:53:53,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr10ASSERT_VIOLATIONMEMORY_LEAK (30 of 38 remaining) [2023-08-29 21:53:53,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (29 of 38 remaining) [2023-08-29 21:53:53,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 38 remaining) [2023-08-29 21:53:53,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 38 remaining) [2023-08-29 21:53:53,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 38 remaining) [2023-08-29 21:53:53,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 38 remaining) [2023-08-29 21:53:53,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 38 remaining) [2023-08-29 21:53:53,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 38 remaining) [2023-08-29 21:53:53,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 38 remaining) [2023-08-29 21:53:53,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 38 remaining) [2023-08-29 21:53:53,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 38 remaining) [2023-08-29 21:53:53,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 38 remaining) [2023-08-29 21:53:53,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 38 remaining) [2023-08-29 21:53:53,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 38 remaining) [2023-08-29 21:53:53,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 38 remaining) [2023-08-29 21:53:53,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 38 remaining) [2023-08-29 21:53:53,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 38 remaining) [2023-08-29 21:53:53,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 38 remaining) [2023-08-29 21:53:53,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 38 remaining) [2023-08-29 21:53:53,508 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 38 remaining) [2023-08-29 21:53:53,508 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 38 remaining) [2023-08-29 21:53:53,508 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 38 remaining) [2023-08-29 21:53:53,508 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 38 remaining) [2023-08-29 21:53:53,508 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr10ASSERT_VIOLATIONMEMORY_LEAK (7 of 38 remaining) [2023-08-29 21:53:53,508 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 38 remaining) [2023-08-29 21:53:53,509 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 38 remaining) [2023-08-29 21:53:53,509 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 38 remaining) [2023-08-29 21:53:53,509 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (3 of 38 remaining) [2023-08-29 21:53:53,509 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 38 remaining) [2023-08-29 21:53:53,509 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 38 remaining) [2023-08-29 21:53:53,509 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 38 remaining) [2023-08-29 21:53:53,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 21:53:53,510 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2023-08-29 21:53:53,511 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-29 21:53:53,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 218 transitions, 444 flow [2023-08-29 21:53:53,543 INFO L130 PetriNetUnfolder]: 45/305 cut-off events. [2023-08-29 21:53:53,543 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-08-29 21:53:53,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 305 events. 45/305 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1160 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 170. Up to 8 conditions per place. [2023-08-29 21:53:53,544 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 218 transitions, 444 flow [2023-08-29 21:53:53,546 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 213 transitions, 431 flow [2023-08-29 21:53:53,546 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 21:53:53,546 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 213 transitions, 431 flow [2023-08-29 21:53:53,546 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 213 transitions, 431 flow [2023-08-29 21:53:53,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 213 transitions, 431 flow [2023-08-29 21:53:53,566 INFO L130 PetriNetUnfolder]: 44/300 cut-off events. [2023-08-29 21:53:53,566 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 21:53:53,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 300 events. 44/300 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1124 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 170. Up to 8 conditions per place. [2023-08-29 21:53:53,572 INFO L119 LiptonReduction]: Number of co-enabled transitions 14508 [2023-08-29 21:53:56,660 INFO L134 LiptonReduction]: Checked pairs total: 25872 [2023-08-29 21:53:56,661 INFO L136 LiptonReduction]: Total number of compositions: 193 [2023-08-29 21:53:56,662 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 21:53:56,663 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;@3c1e3368, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 21:53:56,663 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 21:53:56,668 INFO L130 PetriNetUnfolder]: 11/58 cut-off events. [2023-08-29 21:53:56,668 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 21:53:56,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:53:56,668 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-29 21:53:56,668 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 21:53:56,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:53:56,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1477774259, now seen corresponding path program 1 times [2023-08-29 21:53:56,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:53:56,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973603970] [2023-08-29 21:53:56,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:56,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:53:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:56,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 21:53:56,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:53:56,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973603970] [2023-08-29 21:53:56,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973603970] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:53:56,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:53:56,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 21:53:56,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777875771] [2023-08-29 21:53:56,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:53:56,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:53:56,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:53:56,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:53:56,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 21:53:56,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 411 [2023-08-29 21:53:56,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 91 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:56,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:53:56,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 411 [2023-08-29 21:53:56,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:53:56,850 INFO L130 PetriNetUnfolder]: 621/1396 cut-off events. [2023-08-29 21:53:56,851 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 21:53:56,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2626 conditions, 1396 events. 621/1396 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9134 event pairs, 570 based on Foata normal form. 104/996 useless extension candidates. Maximal degree in co-relation 2546. Up to 1223 conditions per place. [2023-08-29 21:53:56,854 INFO L137 encePairwiseOnDemand]: 381/411 looper letters, 27 selfloop transitions, 2 changer transitions 28/65 dead transitions. [2023-08-29 21:53:56,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 65 transitions, 243 flow [2023-08-29 21:53:56,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:53:56,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:53:56,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 631 transitions. [2023-08-29 21:53:56,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5117599351175993 [2023-08-29 21:53:56,857 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 631 transitions. [2023-08-29 21:53:56,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 631 transitions. [2023-08-29 21:53:56,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:53:56,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 631 transitions. [2023-08-29 21:53:56,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 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-29 21:53:56,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 411.0) internal successors, (1644), 4 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:56,862 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 411.0) internal successors, (1644), 4 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:56,862 INFO L175 Difference]: Start difference. First operand has 70 places, 91 transitions, 187 flow. Second operand 3 states and 631 transitions. [2023-08-29 21:53:56,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 65 transitions, 243 flow [2023-08-29 21:53:56,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 243 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 21:53:56,864 INFO L231 Difference]: Finished difference. Result has 67 places, 37 transitions, 89 flow [2023-08-29 21:53:56,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=67, PETRI_TRANSITIONS=37} [2023-08-29 21:53:56,864 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -3 predicate places. [2023-08-29 21:53:56,864 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 37 transitions, 89 flow [2023-08-29 21:53:56,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:56,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:53:56,865 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-29 21:53:56,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 21:53:56,865 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 21:53:56,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:53:56,866 INFO L85 PathProgramCache]: Analyzing trace with hash 420532853, now seen corresponding path program 1 times [2023-08-29 21:53:56,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:53:56,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523470540] [2023-08-29 21:53:56,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:56,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:53:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:56,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 21:53:56,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:53:56,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523470540] [2023-08-29 21:53:56,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523470540] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:53:56,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298211869] [2023-08-29 21:53:56,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:56,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:53:56,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:53:56,909 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-29 21:53:56,912 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-29 21:53:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:56,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 21:53:56,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:53:56,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 21:53:56,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:53:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 21:53:56,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298211869] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:53:56,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:53:56,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-29 21:53:56,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698853013] [2023-08-29 21:53:56,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:53:56,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 21:53:57,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:53:57,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 21:53:57,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 21:53:57,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 411 [2023-08-29 21:53:57,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 37 transitions, 89 flow. Second operand has 6 states, 6 states have (on average 183.5) internal successors, (1101), 6 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:57,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:53:57,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 411 [2023-08-29 21:53:57,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:53:57,077 INFO L130 PetriNetUnfolder]: 102/270 cut-off events. [2023-08-29 21:53:57,077 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 21:53:57,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 270 events. 102/270 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1159 event pairs, 95 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 501. Up to 223 conditions per place. [2023-08-29 21:53:57,078 INFO L137 encePairwiseOnDemand]: 408/411 looper letters, 27 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2023-08-29 21:53:57,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 165 flow [2023-08-29 21:53:57,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 21:53:57,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 21:53:57,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1127 transitions. [2023-08-29 21:53:57,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4570154095701541 [2023-08-29 21:53:57,082 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1127 transitions. [2023-08-29 21:53:57,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1127 transitions. [2023-08-29 21:53:57,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:53:57,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1127 transitions. [2023-08-29 21:53:57,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.83333333333334) internal successors, (1127), 6 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:57,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 411.0) internal successors, (2877), 7 states have internal predecessors, (2877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:57,099 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 411.0) internal successors, (2877), 7 states have internal predecessors, (2877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:57,099 INFO L175 Difference]: Start difference. First operand has 67 places, 37 transitions, 89 flow. Second operand 6 states and 1127 transitions. [2023-08-29 21:53:57,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 165 flow [2023-08-29 21:53:57,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 161 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 21:53:57,101 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 121 flow [2023-08-29 21:53:57,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=121, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-08-29 21:53:57,102 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -23 predicate places. [2023-08-29 21:53:57,102 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 121 flow [2023-08-29 21:53:57,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 183.5) internal successors, (1101), 6 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:57,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:53:57,103 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-29 21:53:57,115 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-29 21:53:57,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:53:57,309 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 21:53:57,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:53:57,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1674466253, now seen corresponding path program 2 times [2023-08-29 21:53:57,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:53:57,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180374407] [2023-08-29 21:53:57,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:57,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:53:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:57,369 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 21:53:57,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:53:57,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180374407] [2023-08-29 21:53:57,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180374407] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:53:57,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637308343] [2023-08-29 21:53:57,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 21:53:57,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:53:57,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:53:57,372 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-29 21:53:57,374 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-29 21:53:57,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 21:53:57,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:53:57,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 21:53:57,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:53:57,462 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 21:53:57,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:53:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 21:53:57,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637308343] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:53:57,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:53:57,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-08-29 21:53:57,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447335363] [2023-08-29 21:53:57,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:53:57,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-29 21:53:57,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:53:57,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-29 21:53:57,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-08-29 21:53:57,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 411 [2023-08-29 21:53:57,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 121 flow. Second operand has 12 states, 12 states have (on average 183.25) internal successors, (2199), 12 states have internal predecessors, (2199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:57,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:53:57,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 411 [2023-08-29 21:53:57,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:53:57,628 INFO L130 PetriNetUnfolder]: 102/276 cut-off events. [2023-08-29 21:53:57,629 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-29 21:53:57,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550 conditions, 276 events. 102/276 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1159 event pairs, 95 based on Foata normal form. 6/177 useless extension candidates. Maximal degree in co-relation 492. Up to 223 conditions per place. [2023-08-29 21:53:57,630 INFO L137 encePairwiseOnDemand]: 408/411 looper letters, 27 selfloop transitions, 11 changer transitions 0/46 dead transitions. [2023-08-29 21:53:57,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 46 transitions, 233 flow [2023-08-29 21:53:57,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 21:53:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 21:53:57,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2228 transitions. [2023-08-29 21:53:57,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45174371451743717 [2023-08-29 21:53:57,636 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2228 transitions. [2023-08-29 21:53:57,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2228 transitions. [2023-08-29 21:53:57,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:53:57,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2228 transitions. [2023-08-29 21:53:57,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 185.66666666666666) internal successors, (2228), 12 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:57,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 411.0) internal successors, (5343), 13 states have internal predecessors, (5343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:57,661 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 411.0) internal successors, (5343), 13 states have internal predecessors, (5343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:57,661 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 121 flow. Second operand 12 states and 2228 transitions. [2023-08-29 21:53:57,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 46 transitions, 233 flow [2023-08-29 21:53:57,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 46 transitions, 219 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-29 21:53:57,663 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 191 flow [2023-08-29 21:53:57,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=191, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2023-08-29 21:53:57,664 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -7 predicate places. [2023-08-29 21:53:57,664 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 191 flow [2023-08-29 21:53:57,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 183.25) internal successors, (2199), 12 states have internal predecessors, (2199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:57,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:53:57,665 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-29 21:53:57,673 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-29 21:53:57,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-29 21:53:57,871 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 21:53:57,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:53:57,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1044817139, now seen corresponding path program 3 times [2023-08-29 21:53:57,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:53:57,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858735540] [2023-08-29 21:53:57,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:57,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:53:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 21:53:57,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 21:53:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 21:53:57,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 21:53:57,950 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 21:53:57,951 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 21:53:57,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 21:53:57,951 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-29 21:53:57,952 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 21:53:57,953 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 21:53:57,953 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-29 21:53:58,000 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-29 21:53:58,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 258 places, 298 transitions, 614 flow [2023-08-29 21:53:58,061 INFO L130 PetriNetUnfolder]: 75/501 cut-off events. [2023-08-29 21:53:58,061 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-08-29 21:53:58,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 501 events. 75/501 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2292 event pairs, 0 based on Foata normal form. 0/349 useless extension candidates. Maximal degree in co-relation 307. Up to 12 conditions per place. [2023-08-29 21:53:58,065 INFO L82 GeneralOperation]: Start removeDead. Operand has 258 places, 298 transitions, 614 flow [2023-08-29 21:53:58,071 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 258 places, 298 transitions, 614 flow [2023-08-29 21:53:58,071 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 21:53:58,072 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 258 places, 298 transitions, 614 flow [2023-08-29 21:53:58,072 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 258 places, 298 transitions, 614 flow [2023-08-29 21:53:58,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 258 places, 298 transitions, 614 flow [2023-08-29 21:53:58,117 INFO L130 PetriNetUnfolder]: 75/501 cut-off events. [2023-08-29 21:53:58,117 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-08-29 21:53:58,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 501 events. 75/501 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2292 event pairs, 0 based on Foata normal form. 0/349 useless extension candidates. Maximal degree in co-relation 307. Up to 12 conditions per place. [2023-08-29 21:53:58,137 INFO L119 LiptonReduction]: Number of co-enabled transitions 42900 [2023-08-29 21:54:02,005 INFO L134 LiptonReduction]: Checked pairs total: 91246 [2023-08-29 21:54:02,006 INFO L136 LiptonReduction]: Total number of compositions: 274 [2023-08-29 21:54:02,008 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 21:54:02,008 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;@3c1e3368, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 21:54:02,008 INFO L358 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2023-08-29 21:54:02,009 INFO L130 PetriNetUnfolder]: 1/3 cut-off events. [2023-08-29 21:54:02,010 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 21:54:02,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:54:02,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 21:54:02,010 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:54:02,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:54:02,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1698028, now seen corresponding path program 1 times [2023-08-29 21:54:02,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:54:02,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409758560] [2023-08-29 21:54:02,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:54:02,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:54:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:54:02,030 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-29 21:54:02,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:54:02,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409758560] [2023-08-29 21:54:02,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409758560] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:54:02,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:54:02,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 21:54:02,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154812994] [2023-08-29 21:54:02,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:54:02,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:54:02,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:54:02,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:54:02,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 21:54:02,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 572 [2023-08-29 21:54:02,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 135 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:02,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:54:02,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 572 [2023-08-29 21:54:02,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:54:05,365 INFO L130 PetriNetUnfolder]: 28221/45403 cut-off events. [2023-08-29 21:54:05,366 INFO L131 PetriNetUnfolder]: For 147/147 co-relation queries the response was YES. [2023-08-29 21:54:05,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86992 conditions, 45403 events. 28221/45403 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 1898. Compared 374120 event pairs, 26736 based on Foata normal form. 3624/32165 useless extension candidates. Maximal degree in co-relation 35357. Up to 41457 conditions per place. [2023-08-29 21:54:05,623 INFO L137 encePairwiseOnDemand]: 530/572 looper letters, 77 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2023-08-29 21:54:05,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 97 transitions, 370 flow [2023-08-29 21:54:05,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:54:05,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:54:05,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 863 transitions. [2023-08-29 21:54:05,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502913752913753 [2023-08-29 21:54:05,628 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 863 transitions. [2023-08-29 21:54:05,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 863 transitions. [2023-08-29 21:54:05,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:54:05,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 863 transitions. [2023-08-29 21:54:05,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 287.6666666666667) internal successors, (863), 3 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:05,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 572.0) internal successors, (2288), 4 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:05,635 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 572.0) internal successors, (2288), 4 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:05,635 INFO L175 Difference]: Start difference. First operand has 103 places, 135 transitions, 288 flow. Second operand 3 states and 863 transitions. [2023-08-29 21:54:05,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 97 transitions, 370 flow [2023-08-29 21:54:05,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 97 transitions, 370 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 21:54:05,639 INFO L231 Difference]: Finished difference. Result has 98 places, 97 transitions, 222 flow [2023-08-29 21:54:05,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=98, PETRI_TRANSITIONS=97} [2023-08-29 21:54:05,641 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -5 predicate places. [2023-08-29 21:54:05,641 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 97 transitions, 222 flow [2023-08-29 21:54:05,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:05,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:54:05,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 21:54:05,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 21:54:05,642 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:54:05,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:54:05,642 INFO L85 PathProgramCache]: Analyzing trace with hash 52616612, now seen corresponding path program 1 times [2023-08-29 21:54:05,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:54:05,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336493734] [2023-08-29 21:54:05,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:54:05,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:54:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:54:05,685 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-29 21:54:05,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:54:05,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336493734] [2023-08-29 21:54:05,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336493734] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:54:05,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403931796] [2023-08-29 21:54:05,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:54:05,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:54:05,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:54:05,687 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-29 21:54:05,689 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-29 21:54:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:54:05,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 21:54:05,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:54:05,774 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-29 21:54:05,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:54:05,785 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-29 21:54:05,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403931796] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:54:05,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:54:05,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 21:54:05,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022452929] [2023-08-29 21:54:05,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:54:05,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 21:54:05,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:54:05,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 21:54:05,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 21:54:05,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 572 [2023-08-29 21:54:05,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 97 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 248.28571428571428) internal successors, (1738), 7 states have internal predecessors, (1738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:05,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:54:05,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 572 [2023-08-29 21:54:05,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:54:08,449 INFO L130 PetriNetUnfolder]: 28221/45406 cut-off events. [2023-08-29 21:54:08,449 INFO L131 PetriNetUnfolder]: For 147/147 co-relation queries the response was YES. [2023-08-29 21:54:08,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87008 conditions, 45406 events. 28221/45406 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 1897. Compared 373934 event pairs, 26736 based on Foata normal form. 0/28544 useless extension candidates. Maximal degree in co-relation 86995. Up to 41457 conditions per place. [2023-08-29 21:54:08,708 INFO L137 encePairwiseOnDemand]: 569/572 looper letters, 77 selfloop transitions, 5 changer transitions 0/100 dead transitions. [2023-08-29 21:54:08,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 100 transitions, 398 flow [2023-08-29 21:54:08,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 21:54:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 21:54:08,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1567 transitions. [2023-08-29 21:54:08,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4565850815850816 [2023-08-29 21:54:08,713 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1567 transitions. [2023-08-29 21:54:08,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1567 transitions. [2023-08-29 21:54:08,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:54:08,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1567 transitions. [2023-08-29 21:54:08,718 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-29 21:54:08,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 572.0) internal successors, (4004), 7 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-29 21:54:08,722 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 572.0) internal successors, (4004), 7 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-29 21:54:08,722 INFO L175 Difference]: Start difference. First operand has 98 places, 97 transitions, 222 flow. Second operand 6 states and 1567 transitions. [2023-08-29 21:54:08,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 100 transitions, 398 flow [2023-08-29 21:54:08,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 100 transitions, 394 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 21:54:08,726 INFO L231 Difference]: Finished difference. Result has 105 places, 100 transitions, 254 flow [2023-08-29 21:54:08,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=254, PETRI_PLACES=105, PETRI_TRANSITIONS=100} [2023-08-29 21:54:08,728 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 2 predicate places. [2023-08-29 21:54:08,728 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 100 transitions, 254 flow [2023-08-29 21:54:08,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 248.28571428571428) internal successors, (1738), 7 states have internal predecessors, (1738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:08,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:54:08,729 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-29 21:54:08,738 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-29 21:54:08,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:54:08,935 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:54:08,935 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:54:08,935 INFO L85 PathProgramCache]: Analyzing trace with hash -183644373, now seen corresponding path program 2 times [2023-08-29 21:54:08,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:54:08,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614644953] [2023-08-29 21:54:08,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:54:08,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:54:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:54:09,024 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-29 21:54:09,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:54:09,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614644953] [2023-08-29 21:54:09,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614644953] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:54:09,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826181295] [2023-08-29 21:54:09,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 21:54:09,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:54:09,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:54:09,029 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-29 21:54:09,032 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-29 21:54:09,101 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 21:54:09,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:54:09,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 21:54:09,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:54:09,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-29 21:54:09,125 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:54:09,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 21:54:09,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826181295] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:54:09,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 21:54:09,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2023-08-29 21:54:09,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482269924] [2023-08-29 21:54:09,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:54:09,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:54:09,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:54:09,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:54:09,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-29 21:54:09,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 572 [2023-08-29 21:54:09,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 100 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:09,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:54:09,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 572 [2023-08-29 21:54:09,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:54:12,004 INFO L130 PetriNetUnfolder]: 27810/44514 cut-off events. [2023-08-29 21:54:12,004 INFO L131 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2023-08-29 21:54:12,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86132 conditions, 44514 events. 27810/44514 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 1867. Compared 366662 event pairs, 12936 based on Foata normal form. 0/28130 useless extension candidates. Maximal degree in co-relation 86097. Up to 41416 conditions per place. [2023-08-29 21:54:12,268 INFO L137 encePairwiseOnDemand]: 568/572 looper letters, 103 selfloop transitions, 2 changer transitions 0/123 dead transitions. [2023-08-29 21:54:12,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 123 transitions, 510 flow [2023-08-29 21:54:12,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:54:12,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:54:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 844 transitions. [2023-08-29 21:54:12,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49184149184149184 [2023-08-29 21:54:12,272 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 844 transitions. [2023-08-29 21:54:12,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 844 transitions. [2023-08-29 21:54:12,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:54:12,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 844 transitions. [2023-08-29 21:54:12,274 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-29 21:54:12,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 572.0) internal successors, (2288), 4 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:12,277 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 572.0) internal successors, (2288), 4 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:12,277 INFO L175 Difference]: Start difference. First operand has 105 places, 100 transitions, 254 flow. Second operand 3 states and 844 transitions. [2023-08-29 21:54:12,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 123 transitions, 510 flow [2023-08-29 21:54:12,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 123 transitions, 496 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-29 21:54:12,280 INFO L231 Difference]: Finished difference. Result has 107 places, 101 transitions, 254 flow [2023-08-29 21:54:12,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=107, PETRI_TRANSITIONS=101} [2023-08-29 21:54:12,281 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 4 predicate places. [2023-08-29 21:54:12,281 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 101 transitions, 254 flow [2023-08-29 21:54:12,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:12,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:54:12,282 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-29 21:54:12,292 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-29 21:54:12,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:54:12,487 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:54:12,487 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:54:12,488 INFO L85 PathProgramCache]: Analyzing trace with hash -183644372, now seen corresponding path program 1 times [2023-08-29 21:54:12,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:54:12,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739691024] [2023-08-29 21:54:12,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:54:12,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:54:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:54:12,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:54:12,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:54:12,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739691024] [2023-08-29 21:54:12,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739691024] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:54:12,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:54:12,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 21:54:12,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6592149] [2023-08-29 21:54:12,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:54:12,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:54:12,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:54:12,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:54:12,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 21:54:12,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 572 [2023-08-29 21:54:12,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 101 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:12,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:54:12,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 572 [2023-08-29 21:54:12,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:54:15,145 INFO L130 PetriNetUnfolder]: 26358/41888 cut-off events. [2023-08-29 21:54:15,145 INFO L131 PetriNetUnfolder]: For 1109/1109 co-relation queries the response was YES. [2023-08-29 21:54:15,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82135 conditions, 41888 events. 26358/41888 cut-off events. For 1109/1109 co-relation queries the response was YES. Maximal size of possible extension queue 1770. Compared 339297 event pairs, 23069 based on Foata normal form. 0/27283 useless extension candidates. Maximal degree in co-relation 82105. Up to 35764 conditions per place. [2023-08-29 21:54:15,337 INFO L137 encePairwiseOnDemand]: 567/572 looper letters, 119 selfloop transitions, 3 changer transitions 0/140 dead transitions. [2023-08-29 21:54:15,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 140 transitions, 576 flow [2023-08-29 21:54:15,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:54:15,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:54:15,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 851 transitions. [2023-08-29 21:54:15,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4959207459207459 [2023-08-29 21:54:15,339 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 851 transitions. [2023-08-29 21:54:15,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 851 transitions. [2023-08-29 21:54:15,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:54:15,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 851 transitions. [2023-08-29 21:54:15,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:15,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 572.0) internal successors, (2288), 4 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:15,344 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 572.0) internal successors, (2288), 4 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:15,344 INFO L175 Difference]: Start difference. First operand has 107 places, 101 transitions, 254 flow. Second operand 3 states and 851 transitions. [2023-08-29 21:54:15,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 140 transitions, 576 flow [2023-08-29 21:54:15,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 140 transitions, 574 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 21:54:15,349 INFO L231 Difference]: Finished difference. Result has 106 places, 99 transitions, 254 flow [2023-08-29 21:54:15,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=106, PETRI_TRANSITIONS=99} [2023-08-29 21:54:15,350 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 3 predicate places. [2023-08-29 21:54:15,350 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 99 transitions, 254 flow [2023-08-29 21:54:15,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:15,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:54:15,351 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:54:15,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 21:54:15,351 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:54:15,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:54:15,351 INFO L85 PathProgramCache]: Analyzing trace with hash 276281295, now seen corresponding path program 1 times [2023-08-29 21:54:15,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:54:15,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358592138] [2023-08-29 21:54:15,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:54:15,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:54:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:54:15,404 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-29 21:54:15,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:54:15,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358592138] [2023-08-29 21:54:15,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358592138] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:54:15,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018522314] [2023-08-29 21:54:15,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:54:15,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:54:15,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:54:15,407 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-29 21:54:15,410 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-29 21:54:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:54:15,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 21:54:15,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:54:15,508 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-29 21:54:15,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:54:15,556 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-29 21:54:15,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018522314] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:54:15,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:54:15,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-29 21:54:15,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722559203] [2023-08-29 21:54:15,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:54:15,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 21:54:15,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:54:15,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 21:54:15,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-29 21:54:15,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 572 [2023-08-29 21:54:15,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 99 transitions, 254 flow. Second operand has 13 states, 13 states have (on average 248.46153846153845) internal successors, (3230), 13 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:15,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:54:15,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 572 [2023-08-29 21:54:15,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:54:18,443 INFO L130 PetriNetUnfolder]: 26438/42014 cut-off events. [2023-08-29 21:54:18,443 INFO L131 PetriNetUnfolder]: For 1412/1412 co-relation queries the response was YES. [2023-08-29 21:54:18,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83271 conditions, 42014 events. 26438/42014 cut-off events. For 1412/1412 co-relation queries the response was YES. Maximal size of possible extension queue 1766. Compared 339004 event pairs, 24913 based on Foata normal form. 6/27939 useless extension candidates. Maximal degree in co-relation 83217. Up to 38623 conditions per place. [2023-08-29 21:54:18,638 INFO L137 encePairwiseOnDemand]: 569/572 looper letters, 76 selfloop transitions, 11 changer transitions 0/105 dead transitions. [2023-08-29 21:54:18,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 105 transitions, 464 flow [2023-08-29 21:54:18,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 21:54:18,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 21:54:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3056 transitions. [2023-08-29 21:54:18,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44522144522144524 [2023-08-29 21:54:18,646 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3056 transitions. [2023-08-29 21:54:18,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3056 transitions. [2023-08-29 21:54:18,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:54:18,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3056 transitions. [2023-08-29 21:54:18,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 254.66666666666666) internal successors, (3056), 12 states have internal predecessors, (3056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:18,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 572.0) internal successors, (7436), 13 states have internal predecessors, (7436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:18,662 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 572.0) internal successors, (7436), 13 states have internal predecessors, (7436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:18,662 INFO L175 Difference]: Start difference. First operand has 106 places, 99 transitions, 254 flow. Second operand 12 states and 3056 transitions. [2023-08-29 21:54:18,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 105 transitions, 464 flow [2023-08-29 21:54:18,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 105 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 21:54:18,722 INFO L231 Difference]: Finished difference. Result has 121 places, 105 transitions, 332 flow [2023-08-29 21:54:18,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=332, PETRI_PLACES=121, PETRI_TRANSITIONS=105} [2023-08-29 21:54:18,723 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 18 predicate places. [2023-08-29 21:54:18,723 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 105 transitions, 332 flow [2023-08-29 21:54:18,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 248.46153846153845) internal successors, (3230), 13 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:18,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:54:18,724 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:54:18,735 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-29 21:54:18,930 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,SelfDestructingSolverStorable16 [2023-08-29 21:54:18,930 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:54:18,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:54:18,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1399438033, now seen corresponding path program 2 times [2023-08-29 21:54:18,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:54:18,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248573072] [2023-08-29 21:54:18,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:54:18,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:54:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:54:19,306 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:54:19,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:54:19,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248573072] [2023-08-29 21:54:19,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248573072] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:54:19,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:54:19,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 21:54:19,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820654745] [2023-08-29 21:54:19,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:54:19,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 21:54:19,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:54:19,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 21:54:19,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 21:54:19,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 572 [2023-08-29 21:54:19,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 105 transitions, 332 flow. Second operand has 5 states, 5 states have (on average 224.6) internal successors, (1123), 5 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:19,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:54:19,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 572 [2023-08-29 21:54:19,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:54:21,066 INFO L130 PetriNetUnfolder]: 14864/23941 cut-off events. [2023-08-29 21:54:21,066 INFO L131 PetriNetUnfolder]: For 682/682 co-relation queries the response was YES. [2023-08-29 21:54:21,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47302 conditions, 23941 events. 14864/23941 cut-off events. For 682/682 co-relation queries the response was YES. Maximal size of possible extension queue 884. Compared 180745 event pairs, 3586 based on Foata normal form. 486/19170 useless extension candidates. Maximal degree in co-relation 47224. Up to 18895 conditions per place. [2023-08-29 21:54:21,203 INFO L137 encePairwiseOnDemand]: 552/572 looper letters, 177 selfloop transitions, 7 changer transitions 0/198 dead transitions. [2023-08-29 21:54:21,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 198 transitions, 902 flow [2023-08-29 21:54:21,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 21:54:21,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 21:54:21,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1537 transitions. [2023-08-29 21:54:21,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44784382284382285 [2023-08-29 21:54:21,208 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1537 transitions. [2023-08-29 21:54:21,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1537 transitions. [2023-08-29 21:54:21,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:54:21,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1537 transitions. [2023-08-29 21:54:21,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 256.1666666666667) internal successors, (1537), 6 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:21,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 572.0) internal successors, (4004), 7 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-29 21:54:21,216 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 572.0) internal successors, (4004), 7 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-29 21:54:21,217 INFO L175 Difference]: Start difference. First operand has 121 places, 105 transitions, 332 flow. Second operand 6 states and 1537 transitions. [2023-08-29 21:54:21,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 198 transitions, 902 flow [2023-08-29 21:54:21,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 198 transitions, 854 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-29 21:54:21,221 INFO L231 Difference]: Finished difference. Result has 117 places, 102 transitions, 329 flow [2023-08-29 21:54:21,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=329, PETRI_PLACES=117, PETRI_TRANSITIONS=102} [2023-08-29 21:54:21,222 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 14 predicate places. [2023-08-29 21:54:21,222 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 102 transitions, 329 flow [2023-08-29 21:54:21,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 224.6) internal successors, (1123), 5 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:21,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:54:21,223 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:54:21,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 21:54:21,223 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:54:21,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:54:21,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1399892665, now seen corresponding path program 1 times [2023-08-29 21:54:21,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:54:21,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016487786] [2023-08-29 21:54:21,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:54:21,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:54:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:54:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:54:21,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:54:21,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016487786] [2023-08-29 21:54:21,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016487786] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:54:21,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238325768] [2023-08-29 21:54:21,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:54:21,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:54:21,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:54:21,309 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-29 21:54:21,337 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-29 21:54:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:54:21,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-29 21:54:21,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:54:21,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-29 21:54:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:54:21,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:54:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:54:21,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238325768] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:54:21,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:54:21,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2023-08-29 21:54:21,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497499828] [2023-08-29 21:54:21,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:54:21,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 21:54:21,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:54:21,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 21:54:21,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-29 21:54:21,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 572 [2023-08-29 21:54:21,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 102 transitions, 329 flow. Second operand has 8 states, 8 states have (on average 245.125) internal successors, (1961), 8 states have internal predecessors, (1961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:21,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:54:21,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 572 [2023-08-29 21:54:21,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:54:22,279 INFO L130 PetriNetUnfolder]: 1329/2528 cut-off events. [2023-08-29 21:54:22,279 INFO L131 PetriNetUnfolder]: For 811/811 co-relation queries the response was YES. [2023-08-29 21:54:22,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5721 conditions, 2528 events. 1329/2528 cut-off events. For 811/811 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 16057 event pairs, 114 based on Foata normal form. 285/2562 useless extension candidates. Maximal degree in co-relation 5664. Up to 1554 conditions per place. [2023-08-29 21:54:22,289 INFO L137 encePairwiseOnDemand]: 568/572 looper letters, 93 selfloop transitions, 3 changer transitions 0/106 dead transitions. [2023-08-29 21:54:22,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 106 transitions, 483 flow [2023-08-29 21:54:22,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 21:54:22,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 21:54:22,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1305 transitions. [2023-08-29 21:54:22,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4562937062937063 [2023-08-29 21:54:22,292 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1305 transitions. [2023-08-29 21:54:22,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1305 transitions. [2023-08-29 21:54:22,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:54:22,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1305 transitions. [2023-08-29 21:54:22,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:22,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 572.0) internal successors, (3432), 6 states have internal predecessors, (3432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:22,299 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 572.0) internal successors, (3432), 6 states have internal predecessors, (3432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:22,300 INFO L175 Difference]: Start difference. First operand has 117 places, 102 transitions, 329 flow. Second operand 5 states and 1305 transitions. [2023-08-29 21:54:22,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 106 transitions, 483 flow [2023-08-29 21:54:22,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 106 transitions, 469 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-29 21:54:22,306 INFO L231 Difference]: Finished difference. Result has 78 places, 59 transitions, 187 flow [2023-08-29 21:54:22,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=78, PETRI_TRANSITIONS=59} [2023-08-29 21:54:22,307 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -25 predicate places. [2023-08-29 21:54:22,307 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 59 transitions, 187 flow [2023-08-29 21:54:22,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 245.125) internal successors, (1961), 8 states have internal predecessors, (1961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:22,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:54:22,308 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:54:22,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-29 21:54:22,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:54:22,514 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:54:22,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:54:22,514 INFO L85 PathProgramCache]: Analyzing trace with hash -432908353, now seen corresponding path program 1 times [2023-08-29 21:54:22,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:54:22,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943080623] [2023-08-29 21:54:22,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:54:22,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:54:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:54:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:54:22,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:54:22,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943080623] [2023-08-29 21:54:22,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943080623] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:54:22,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:54:22,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 21:54:22,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184834414] [2023-08-29 21:54:22,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:54:22,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 21:54:22,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:54:22,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 21:54:22,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-08-29 21:54:22,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 572 [2023-08-29 21:54:22,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 59 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 222.5) internal successors, (1335), 6 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:22,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:54:22,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 572 [2023-08-29 21:54:22,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:54:23,261 INFO L130 PetriNetUnfolder]: 1407/2540 cut-off events. [2023-08-29 21:54:23,262 INFO L131 PetriNetUnfolder]: For 1025/1025 co-relation queries the response was YES. [2023-08-29 21:54:23,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5616 conditions, 2540 events. 1407/2540 cut-off events. For 1025/1025 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 15417 event pairs, 565 based on Foata normal form. 0/2343 useless extension candidates. Maximal degree in co-relation 5562. Up to 1388 conditions per place. [2023-08-29 21:54:23,270 INFO L137 encePairwiseOnDemand]: 563/572 looper letters, 68 selfloop transitions, 6 changer transitions 9/93 dead transitions. [2023-08-29 21:54:23,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 93 transitions, 439 flow [2023-08-29 21:54:23,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 21:54:23,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 21:54:23,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1178 transitions. [2023-08-29 21:54:23,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41188811188811186 [2023-08-29 21:54:23,273 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1178 transitions. [2023-08-29 21:54:23,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1178 transitions. [2023-08-29 21:54:23,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:54:23,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1178 transitions. [2023-08-29 21:54:23,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 235.6) internal successors, (1178), 5 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:23,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 572.0) internal successors, (3432), 6 states have internal predecessors, (3432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:23,280 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 572.0) internal successors, (3432), 6 states have internal predecessors, (3432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:23,280 INFO L175 Difference]: Start difference. First operand has 78 places, 59 transitions, 187 flow. Second operand 5 states and 1178 transitions. [2023-08-29 21:54:23,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 93 transitions, 439 flow [2023-08-29 21:54:23,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 93 transitions, 426 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 21:54:23,284 INFO L231 Difference]: Finished difference. Result has 82 places, 61 transitions, 220 flow [2023-08-29 21:54:23,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=82, PETRI_TRANSITIONS=61} [2023-08-29 21:54:23,285 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -21 predicate places. [2023-08-29 21:54:23,285 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 61 transitions, 220 flow [2023-08-29 21:54:23,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 222.5) internal successors, (1335), 6 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:23,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:54:23,286 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:54:23,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 21:54:23,286 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:54:23,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:54:23,287 INFO L85 PathProgramCache]: Analyzing trace with hash -2125383658, now seen corresponding path program 1 times [2023-08-29 21:54:23,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:54:23,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786204656] [2023-08-29 21:54:23,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:54:23,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:54:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:54:23,470 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-29 21:54:23,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:54:23,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786204656] [2023-08-29 21:54:23,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786204656] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:54:23,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:54:23,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 21:54:23,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261420018] [2023-08-29 21:54:23,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:54:23,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 21:54:23,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:54:23,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 21:54:23,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 21:54:23,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 572 [2023-08-29 21:54:23,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 61 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:23,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:54:23,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 572 [2023-08-29 21:54:23,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:54:23,909 INFO L130 PetriNetUnfolder]: 962/1849 cut-off events. [2023-08-29 21:54:23,909 INFO L131 PetriNetUnfolder]: For 727/727 co-relation queries the response was YES. [2023-08-29 21:54:23,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4345 conditions, 1849 events. 962/1849 cut-off events. For 727/727 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 10849 event pairs, 121 based on Foata normal form. 99/1862 useless extension candidates. Maximal degree in co-relation 4288. Up to 1458 conditions per place. [2023-08-29 21:54:23,917 INFO L137 encePairwiseOnDemand]: 567/572 looper letters, 53 selfloop transitions, 2 changer transitions 8/73 dead transitions. [2023-08-29 21:54:23,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 73 transitions, 381 flow [2023-08-29 21:54:23,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 21:54:23,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 21:54:23,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 943 transitions. [2023-08-29 21:54:23,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41215034965034963 [2023-08-29 21:54:23,920 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 943 transitions. [2023-08-29 21:54:23,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 943 transitions. [2023-08-29 21:54:23,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:54:23,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 943 transitions. [2023-08-29 21:54:23,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 235.75) internal successors, (943), 4 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:23,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 572.0) internal successors, (2860), 5 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:23,925 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 572.0) internal successors, (2860), 5 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:23,925 INFO L175 Difference]: Start difference. First operand has 82 places, 61 transitions, 220 flow. Second operand 4 states and 943 transitions. [2023-08-29 21:54:23,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 73 transitions, 381 flow [2023-08-29 21:54:23,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 73 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 21:54:23,928 INFO L231 Difference]: Finished difference. Result has 80 places, 52 transitions, 190 flow [2023-08-29 21:54:23,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=80, PETRI_TRANSITIONS=52} [2023-08-29 21:54:23,929 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -23 predicate places. [2023-08-29 21:54:23,929 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 52 transitions, 190 flow [2023-08-29 21:54:23,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:23,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:54:23,930 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:54:23,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 21:54:23,930 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:54:23,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:54:23,930 INFO L85 PathProgramCache]: Analyzing trace with hash -807617614, now seen corresponding path program 1 times [2023-08-29 21:54:23,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:54:23,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750356121] [2023-08-29 21:54:23,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:54:23,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:54:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:54:24,110 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 21:54:24,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:54:24,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750356121] [2023-08-29 21:54:24,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750356121] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:54:24,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:54:24,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 21:54:24,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679316095] [2023-08-29 21:54:24,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:54:24,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 21:54:24,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:54:24,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 21:54:24,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 21:54:24,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 572 [2023-08-29 21:54:24,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 52 transitions, 190 flow. Second operand has 5 states, 5 states have (on average 231.2) internal successors, (1156), 5 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:24,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:54:24,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 572 [2023-08-29 21:54:24,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:54:24,518 INFO L130 PetriNetUnfolder]: 493/988 cut-off events. [2023-08-29 21:54:24,518 INFO L131 PetriNetUnfolder]: For 424/424 co-relation queries the response was YES. [2023-08-29 21:54:24,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2446 conditions, 988 events. 493/988 cut-off events. For 424/424 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5065 event pairs, 193 based on Foata normal form. 102/1005 useless extension candidates. Maximal degree in co-relation 2388. Up to 533 conditions per place. [2023-08-29 21:54:24,523 INFO L137 encePairwiseOnDemand]: 559/572 looper letters, 44 selfloop transitions, 13 changer transitions 4/68 dead transitions. [2023-08-29 21:54:24,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 68 transitions, 362 flow [2023-08-29 21:54:24,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 21:54:24,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 21:54:24,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 967 transitions. [2023-08-29 21:54:24,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42263986013986016 [2023-08-29 21:54:24,527 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 967 transitions. [2023-08-29 21:54:24,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 967 transitions. [2023-08-29 21:54:24,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:54:24,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 967 transitions. [2023-08-29 21:54:24,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 241.75) internal successors, (967), 4 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:24,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 572.0) internal successors, (2860), 5 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:24,533 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 572.0) internal successors, (2860), 5 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:24,533 INFO L175 Difference]: Start difference. First operand has 80 places, 52 transitions, 190 flow. Second operand 4 states and 967 transitions. [2023-08-29 21:54:24,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 68 transitions, 362 flow [2023-08-29 21:54:24,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 68 transitions, 352 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 21:54:24,536 INFO L231 Difference]: Finished difference. Result has 78 places, 54 transitions, 227 flow [2023-08-29 21:54:24,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=227, PETRI_PLACES=78, PETRI_TRANSITIONS=54} [2023-08-29 21:54:24,537 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -25 predicate places. [2023-08-29 21:54:24,537 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 54 transitions, 227 flow [2023-08-29 21:54:24,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 231.2) internal successors, (1156), 5 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:24,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:54:24,538 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:54:24,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-29 21:54:24,538 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:54:24,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:54:24,539 INFO L85 PathProgramCache]: Analyzing trace with hash -766522198, now seen corresponding path program 1 times [2023-08-29 21:54:24,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:54:24,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087673009] [2023-08-29 21:54:24,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:54:24,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:54:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:54:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 21:54:28,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:54:28,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087673009] [2023-08-29 21:54:28,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087673009] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:54:28,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550827079] [2023-08-29 21:54:28,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:54:28,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:54:28,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:54:28,942 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 21:54:28,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-29 21:54:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:54:29,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-29 21:54:29,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:54:29,088 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 7 treesize of output 6 [2023-08-29 21:54:29,197 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:54:29,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 21:54:29,236 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 13 treesize of output 15 [2023-08-29 21:54:29,269 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 13 treesize of output 15 [2023-08-29 21:54:29,307 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 16 treesize of output 12 [2023-08-29 21:54:29,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:54:29,369 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 21 [2023-08-29 21:54:29,395 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 22 treesize of output 17 [2023-08-29 21:54:29,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:54:29,466 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 21 [2023-08-29 21:54:29,557 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:54:29,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-29 21:54:29,638 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 21:54:29,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:54:29,770 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_81| Int) (v_ArrVal_605 (Array Int Int))) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_81| 28))) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset|)) 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_81|) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_605) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0)) (< |v_t_funThread2of2ForFork0_~i~0#1_81| 0)))) is different from false [2023-08-29 21:54:29,791 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_81| Int) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 Int)) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_81| 28))) (or (= 0 (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_604) (+ .cse0 |c_~#a~0.offset|))) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_81|) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_605) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0)) (< |v_t_funThread2of2ForFork0_~i~0#1_81| 0)))) is different from false [2023-08-29 21:54:29,874 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:54:29,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-29 21:54:29,886 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:54:29,886 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 48 treesize of output 38 [2023-08-29 21:54:29,894 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 25 treesize of output 18 [2023-08-29 21:54:38,790 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~i~0#1_81| Int) (v_ArrVal_599 (Array Int Int))) (or (forall ((|v_t_funThread1of2ForFork0_~i~0#1_90| Int) (|~#a~0.offset| Int) (v_ArrVal_604 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_599) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_90| 28) |~#a~0.offset|) v_ArrVal_604) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_81| 28) |~#a~0.offset|)) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_81| |v_t_funThread1of2ForFork0_~i~0#1_90|))) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_81|) (< |v_t_funThread2of2ForFork0_~i~0#1_81| 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-29 21:54:42,753 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-29 21:54:42,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550827079] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:54:42,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:54:42,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 7] total 32 [2023-08-29 21:54:42,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760984116] [2023-08-29 21:54:42,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:54:42,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-29 21:54:42,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:54:42,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-29 21:54:42,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=721, Unknown=3, NotChecked=180, Total=1122 [2023-08-29 21:54:42,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 572 [2023-08-29 21:54:42,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 54 transitions, 227 flow. Second operand has 34 states, 34 states have (on average 143.85294117647058) internal successors, (4891), 34 states have internal predecessors, (4891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:42,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:54:42,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 572 [2023-08-29 21:54:42,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:54:45,104 INFO L130 PetriNetUnfolder]: 647/1296 cut-off events. [2023-08-29 21:54:45,104 INFO L131 PetriNetUnfolder]: For 754/760 co-relation queries the response was YES. [2023-08-29 21:54:45,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3511 conditions, 1296 events. 647/1296 cut-off events. For 754/760 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7356 event pairs, 28 based on Foata normal form. 3/1188 useless extension candidates. Maximal degree in co-relation 3454. Up to 653 conditions per place. [2023-08-29 21:54:45,108 INFO L137 encePairwiseOnDemand]: 562/572 looper letters, 71 selfloop transitions, 25 changer transitions 16/118 dead transitions. [2023-08-29 21:54:45,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 118 transitions, 683 flow [2023-08-29 21:54:45,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-29 21:54:45,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-29 21:54:45,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2805 transitions. [2023-08-29 21:54:45,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25809716599190285 [2023-08-29 21:54:45,113 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2805 transitions. [2023-08-29 21:54:45,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2805 transitions. [2023-08-29 21:54:45,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:54:45,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2805 transitions. [2023-08-29 21:54:45,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 147.6315789473684) internal successors, (2805), 19 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:45,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 572.0) internal successors, (11440), 20 states have internal predecessors, (11440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:45,127 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 572.0) internal successors, (11440), 20 states have internal predecessors, (11440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:45,127 INFO L175 Difference]: Start difference. First operand has 78 places, 54 transitions, 227 flow. Second operand 19 states and 2805 transitions. [2023-08-29 21:54:45,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 118 transitions, 683 flow [2023-08-29 21:54:45,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 118 transitions, 682 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 21:54:45,131 INFO L231 Difference]: Finished difference. Result has 97 places, 65 transitions, 331 flow [2023-08-29 21:54:45,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=331, PETRI_PLACES=97, PETRI_TRANSITIONS=65} [2023-08-29 21:54:45,132 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -6 predicate places. [2023-08-29 21:54:45,132 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 65 transitions, 331 flow [2023-08-29 21:54:45,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 143.85294117647058) internal successors, (4891), 34 states have internal predecessors, (4891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:45,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:54:45,134 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:54:45,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-29 21:54:45,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-08-29 21:54:45,339 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:54:45,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:54:45,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1152540004, now seen corresponding path program 2 times [2023-08-29 21:54:45,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:54:45,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780353572] [2023-08-29 21:54:45,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:54:45,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:54:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:54:49,797 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 21:54:49,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:54:49,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780353572] [2023-08-29 21:54:49,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780353572] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:54:49,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652075392] [2023-08-29 21:54:49,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 21:54:49,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:54:49,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:54:49,801 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 21:54:49,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-29 21:54:49,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 21:54:49,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:54:49,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-29 21:54:49,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:54:49,945 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 7 treesize of output 6 [2023-08-29 21:54:50,089 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:54:50,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 21:54:50,141 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 13 treesize of output 15 [2023-08-29 21:54:50,185 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 13 treesize of output 15 [2023-08-29 21:54:50,242 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 16 treesize of output 12 [2023-08-29 21:54:50,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:54:50,330 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 21 [2023-08-29 21:54:50,402 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:54:50,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-29 21:54:50,445 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 22 treesize of output 17 [2023-08-29 21:54:50,540 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 21:54:50,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:54:50,899 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:54:50,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-29 21:54:50,913 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:54:50,913 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 48 treesize of output 38 [2023-08-29 21:54:50,921 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 25 treesize of output 18 [2023-08-29 21:55:11,148 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~i~0#1_83| Int) (v_ArrVal_691 Int) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_92| Int) (v_ArrVal_686 (Array Int Int))) (or (= |v_t_funThread2of2ForFork0_~i~0#1_83| |v_t_funThread1of2ForFork0_~i~0#1_92|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_686) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_92| 28) |~#a~0.offset|) v_ArrVal_691) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_83| 28) |~#a~0.offset|)) 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-29 21:55:14,668 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-29 21:55:14,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652075392] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:55:14,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:55:14,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 7] total 32 [2023-08-29 21:55:14,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846952718] [2023-08-29 21:55:14,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:55:14,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-29 21:55:14,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:55:14,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-29 21:55:14,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=867, Unknown=6, NotChecked=62, Total=1122 [2023-08-29 21:55:15,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 572 [2023-08-29 21:55:15,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 65 transitions, 331 flow. Second operand has 34 states, 34 states have (on average 141.85294117647058) internal successors, (4823), 34 states have internal predecessors, (4823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:55:15,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:55:15,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 572 [2023-08-29 21:55:15,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:55:46,249 WARN L222 SmtUtils]: Spent 30.30s on a formula simplification. DAG size of input: 55 DAG size of output: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:55:48,254 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-29 21:55:50,264 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-29 21:55:51,714 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 [1] [2023-08-29 21:55:53,727 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-29 21:55:55,735 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-29 21:55:57,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 21:56:00,556 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-29 21:56:02,641 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-29 21:56:28,807 WARN L222 SmtUtils]: Spent 24.13s on a formula simplification. DAG size of input: 47 DAG size of output: 36 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:56:30,809 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-29 21:56:32,812 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-29 21:56:35,003 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-29 21:56:37,015 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-29 21:56:39,017 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-29 21:56:41,023 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-29 21:56:43,033 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-29 21:56:44,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 21:56:47,001 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-29 21:56:49,382 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-29 21:56:51,420 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-29 21:56:53,599 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-29 21:56:55,604 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-29 21:56:57,617 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-29 21:56:59,633 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-29 21:57:01,661 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-29 21:57:03,670 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-29 21:57:06,260 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-29 21:57:08,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 21:57:10,299 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-29 21:57:12,310 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-29 21:57:14,324 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-29 21:57:16,359 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-29 21:57:17,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 21:57:19,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 21:57:21,587 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-29 21:57:29,144 INFO L130 PetriNetUnfolder]: 938/1889 cut-off events. [2023-08-29 21:57:29,145 INFO L131 PetriNetUnfolder]: For 2383/2389 co-relation queries the response was YES. [2023-08-29 21:57:29,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5836 conditions, 1889 events. 938/1889 cut-off events. For 2383/2389 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 11990 event pairs, 130 based on Foata normal form. 21/1720 useless extension candidates. Maximal degree in co-relation 5766. Up to 814 conditions per place. [2023-08-29 21:57:29,154 INFO L137 encePairwiseOnDemand]: 555/572 looper letters, 103 selfloop transitions, 49 changer transitions 38/196 dead transitions. [2023-08-29 21:57:29,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 196 transitions, 1283 flow [2023-08-29 21:57:29,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-08-29 21:57:29,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-08-29 21:57:29,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 4517 transitions. [2023-08-29 21:57:29,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2547371982855854 [2023-08-29 21:57:29,163 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 4517 transitions. [2023-08-29 21:57:29,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 4517 transitions. [2023-08-29 21:57:29,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:57:29,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 4517 transitions. [2023-08-29 21:57:29,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 145.70967741935485) internal successors, (4517), 31 states have internal predecessors, (4517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:57:29,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 572.0) internal successors, (18304), 32 states have internal predecessors, (18304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:57:29,187 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 572.0) internal successors, (18304), 32 states have internal predecessors, (18304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:57:29,187 INFO L175 Difference]: Start difference. First operand has 97 places, 65 transitions, 331 flow. Second operand 31 states and 4517 transitions. [2023-08-29 21:57:29,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 196 transitions, 1283 flow [2023-08-29 21:57:29,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 196 transitions, 1206 flow, removed 16 selfloop flow, removed 20 redundant places. [2023-08-29 21:57:29,196 INFO L231 Difference]: Finished difference. Result has 116 places, 93 transitions, 597 flow [2023-08-29 21:57:29,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=597, PETRI_PLACES=116, PETRI_TRANSITIONS=93} [2023-08-29 21:57:29,196 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 13 predicate places. [2023-08-29 21:57:29,197 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 93 transitions, 597 flow [2023-08-29 21:57:29,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 141.85294117647058) internal successors, (4823), 34 states have internal predecessors, (4823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:57:29,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:57:29,198 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:57:29,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-29 21:57:29,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-08-29 21:57:29,404 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:57:29,404 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:57:29,404 INFO L85 PathProgramCache]: Analyzing trace with hash 568908036, now seen corresponding path program 3 times [2023-08-29 21:57:29,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:57:29,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873649032] [2023-08-29 21:57:29,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:57:29,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:57:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:57:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 21:57:33,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:57:33,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873649032] [2023-08-29 21:57:33,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873649032] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:57:33,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546069104] [2023-08-29 21:57:33,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 21:57:33,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:57:33,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:57:33,465 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 21:57:33,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-29 21:57:33,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-29 21:57:33,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:57:33,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-29 21:57:33,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:57:33,577 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 7 treesize of output 6 [2023-08-29 21:57:33,712 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:57:33,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 21:57:33,746 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 13 treesize of output 15 [2023-08-29 21:57:33,784 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 16 treesize of output 12 [2023-08-29 21:57:33,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:57:33,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 19 treesize of output 21 [2023-08-29 21:57:33,875 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 22 treesize of output 17 [2023-08-29 21:57:33,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:57:33,937 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 21 [2023-08-29 21:57:33,988 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 20 treesize of output 22 [2023-08-29 21:57:34,060 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:57:34,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-29 21:57:34,130 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:57:34,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:57:34,280 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_85| Int)) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_85| 28))) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_85|) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_777) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0)) (< |v_t_funThread2of2ForFork0_~i~0#1_85| 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_778) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset|)) 0)))) is different from false [2023-08-29 21:57:34,434 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:57:34,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-29 21:57:34,448 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:57:34,449 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 48 treesize of output 38 [2023-08-29 21:57:34,456 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 25 treesize of output 18 [2023-08-29 21:57:36,508 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread2of2ForFork0_~i~0#1_85| Int)) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_85|) (< |v_t_funThread2of2ForFork0_~i~0#1_85| 0) (forall ((v_ArrVal_775 Int) (v_ArrVal_778 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_94| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_94| 28) |~#a~0.offset|) v_ArrVal_775)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_778) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_85| 28) |~#a~0.offset|)) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_85| |v_t_funThread1of2ForFork0_~i~0#1_94|))))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_775 Int) (v_ArrVal_778 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_85| Int) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_94| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_94| 28) |~#a~0.offset|) v_ArrVal_775)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_778) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_85| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_85|) (< |v_t_funThread2of2ForFork0_~i~0#1_85| 0)))))) is different from false [2023-08-29 21:57:38,658 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~i~0#1_85| Int) (v_ArrVal_771 (Array Int Int))) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_85|) (< |v_t_funThread2of2ForFork0_~i~0#1_85| 0) (forall ((v_ArrVal_775 Int) (v_ArrVal_778 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_94| Int)) (or (= |v_t_funThread2of2ForFork0_~i~0#1_85| |v_t_funThread1of2ForFork0_~i~0#1_94|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_771))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_94| 28) |~#a~0.offset|) v_ArrVal_775))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_778) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_85| 28) |~#a~0.offset|)) 0))))) (or (forall ((v_ArrVal_775 Int) (v_ArrVal_778 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_85| Int) (|~#a~0.offset| Int) (v_ArrVal_771 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_94| Int)) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_85|) (< |v_t_funThread2of2ForFork0_~i~0#1_85| 0) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_771))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_94| 28) |~#a~0.offset|) v_ArrVal_775))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_778) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_85| 28) |~#a~0.offset|)) 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-08-29 21:57:45,338 WARN L222 SmtUtils]: Spent 6.55s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:57:45,890 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-29 21:57:45,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546069104] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:57:45,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:57:45,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 8] total 32 [2023-08-29 21:57:45,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603394056] [2023-08-29 21:57:45,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:57:45,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-29 21:57:45,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:57:45,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-29 21:57:45,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=758, Unknown=6, NotChecked=180, Total=1122 [2023-08-29 21:57:46,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 572 [2023-08-29 21:57:46,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 93 transitions, 597 flow. Second operand has 34 states, 34 states have (on average 141.76470588235293) internal successors, (4820), 34 states have internal predecessors, (4820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:57:46,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:57:46,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 572 [2023-08-29 21:57:46,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:57:48,136 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#a~0.base|)) (.cse0 (select |c_#pthreadsMutex| |c_~#a~0.base|))) (and (forall ((|v_t_funThread2of2ForFork0_~i~0#1_85| Int)) (let ((.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_85| 28))) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_85|) (< |v_t_funThread2of2ForFork0_~i~0#1_85| 0) (not (= (select .cse0 (+ .cse1 |c_~#a~0.offset| 4)) 0)) (= (select .cse2 (+ .cse1 |c_~#a~0.offset|)) 0)))) (forall ((v_ArrVal_775 Int) (v_ArrVal_777 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_85| Int)) (let ((.cse3 (* |v_t_funThread2of2ForFork0_~i~0#1_85| 28))) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_85|) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_777) |c_~#a~0.base|) (+ .cse3 |c_~#a~0.offset| 4)) 0)) (< |v_t_funThread2of2ForFork0_~i~0#1_85| 0) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse2 (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_775)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_778) |c_~#a~0.base|) (+ .cse3 |c_~#a~0.offset|)) 0)))) (forall ((v_ArrVal_778 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_85| Int)) (let ((.cse4 (* |v_t_funThread2of2ForFork0_~i~0#1_85| 28))) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_85|) (< |v_t_funThread2of2ForFork0_~i~0#1_85| 0) (not (= (select .cse0 (+ .cse4 |c_~#a~0.offset| 4)) 0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_778) |c_~#a~0.base|) (+ .cse4 |c_~#a~0.offset|)) 0)))))) is different from false [2023-08-29 21:57:49,149 INFO L130 PetriNetUnfolder]: 984/1993 cut-off events. [2023-08-29 21:57:49,149 INFO L131 PetriNetUnfolder]: For 10414/10420 co-relation queries the response was YES. [2023-08-29 21:57:49,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8013 conditions, 1993 events. 984/1993 cut-off events. For 10414/10420 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12999 event pairs, 83 based on Foata normal form. 12/1800 useless extension candidates. Maximal degree in co-relation 7950. Up to 644 conditions per place. [2023-08-29 21:57:49,156 INFO L137 encePairwiseOnDemand]: 556/572 looper letters, 103 selfloop transitions, 51 changer transitions 21/181 dead transitions. [2023-08-29 21:57:49,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 181 transitions, 1573 flow [2023-08-29 21:57:49,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-29 21:57:49,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-29 21:57:49,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3635 transitions. [2023-08-29 21:57:49,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2541958041958042 [2023-08-29 21:57:49,162 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3635 transitions. [2023-08-29 21:57:49,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3635 transitions. [2023-08-29 21:57:49,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:57:49,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3635 transitions. [2023-08-29 21:57:49,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 145.4) internal successors, (3635), 25 states have internal predecessors, (3635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:57:49,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 572.0) internal successors, (14872), 26 states have internal predecessors, (14872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:57:49,178 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 572.0) internal successors, (14872), 26 states have internal predecessors, (14872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:57:49,178 INFO L175 Difference]: Start difference. First operand has 116 places, 93 transitions, 597 flow. Second operand 25 states and 3635 transitions. [2023-08-29 21:57:49,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 181 transitions, 1573 flow [2023-08-29 21:57:49,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 181 transitions, 1497 flow, removed 21 selfloop flow, removed 13 redundant places. [2023-08-29 21:57:49,193 INFO L231 Difference]: Finished difference. Result has 131 places, 111 transitions, 843 flow [2023-08-29 21:57:49,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=843, PETRI_PLACES=131, PETRI_TRANSITIONS=111} [2023-08-29 21:57:49,193 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 28 predicate places. [2023-08-29 21:57:49,193 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 111 transitions, 843 flow [2023-08-29 21:57:49,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 141.76470588235293) internal successors, (4820), 34 states have internal predecessors, (4820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:57:49,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:57:49,195 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:57:49,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-29 21:57:49,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-08-29 21:57:49,400 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:57:49,400 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:57:49,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1828135719, now seen corresponding path program 1 times [2023-08-29 21:57:49,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:57:49,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393480994] [2023-08-29 21:57:49,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:57:49,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:57:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:57:51,936 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 21:57:51,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:57:51,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393480994] [2023-08-29 21:57:51,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393480994] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:57:51,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367399630] [2023-08-29 21:57:51,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:57:51,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:57:51,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:57:51,941 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 21:57:51,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-29 21:57:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:57:52,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-29 21:57:52,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:57:52,056 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 7 treesize of output 6 [2023-08-29 21:57:52,130 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:57:52,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 21:57:52,162 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 13 treesize of output 15 [2023-08-29 21:57:52,181 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 16 treesize of output 12 [2023-08-29 21:57:52,247 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 13 treesize of output 15 [2023-08-29 21:57:52,292 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:57:52,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-29 21:57:52,365 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 22 treesize of output 17 [2023-08-29 21:57:52,473 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:57:52,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:57:52,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-08-29 21:57:52,765 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 15 treesize of output 8 [2023-08-29 21:57:52,774 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_862 Int) (|v_t_funThread2of2ForFork0_~i~0#1_87| Int) (|~#a~0.offset| Int) (v_ArrVal_861 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_96| Int)) (or (= |v_t_funThread2of2ForFork0_~i~0#1_87| |v_t_funThread1of2ForFork0_~i~0#1_96|) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_87|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_861) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_87| 28) |~#a~0.offset|) v_ArrVal_862) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_96| 28) |~#a~0.offset|)) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_87| 0))) is different from false [2023-08-29 21:57:53,088 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-29 21:57:53,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367399630] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:57:53,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:57:53,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 28 [2023-08-29 21:57:53,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116866646] [2023-08-29 21:57:53,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:57:53,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-29 21:57:53,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:57:53,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-29 21:57:53,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=672, Unknown=2, NotChecked=54, Total=870 [2023-08-29 21:57:53,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 572 [2023-08-29 21:57:53,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 111 transitions, 843 flow. Second operand has 30 states, 30 states have (on average 143.0) internal successors, (4290), 30 states have internal predecessors, (4290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:57:53,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:57:53,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 572 [2023-08-29 21:57:53,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:57:54,530 INFO L130 PetriNetUnfolder]: 1065/2174 cut-off events. [2023-08-29 21:57:54,531 INFO L131 PetriNetUnfolder]: For 20480/20486 co-relation queries the response was YES. [2023-08-29 21:57:54,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10443 conditions, 2174 events. 1065/2174 cut-off events. For 20480/20486 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14528 event pairs, 175 based on Foata normal form. 12/1968 useless extension candidates. Maximal degree in co-relation 10374. Up to 1318 conditions per place. [2023-08-29 21:57:54,539 INFO L137 encePairwiseOnDemand]: 560/572 looper letters, 115 selfloop transitions, 31 changer transitions 18/170 dead transitions. [2023-08-29 21:57:54,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 170 transitions, 1613 flow [2023-08-29 21:57:54,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-29 21:57:54,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-29 21:57:54,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3074 transitions. [2023-08-29 21:57:54,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2559107559107559 [2023-08-29 21:57:54,544 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3074 transitions. [2023-08-29 21:57:54,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3074 transitions. [2023-08-29 21:57:54,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:57:54,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3074 transitions. [2023-08-29 21:57:54,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 146.38095238095238) internal successors, (3074), 21 states have internal predecessors, (3074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:57:54,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 572.0) internal successors, (12584), 22 states have internal predecessors, (12584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:57:54,557 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 572.0) internal successors, (12584), 22 states have internal predecessors, (12584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:57:54,557 INFO L175 Difference]: Start difference. First operand has 131 places, 111 transitions, 843 flow. Second operand 21 states and 3074 transitions. [2023-08-29 21:57:54,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 170 transitions, 1613 flow [2023-08-29 21:57:54,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 170 transitions, 1498 flow, removed 36 selfloop flow, removed 15 redundant places. [2023-08-29 21:57:54,589 INFO L231 Difference]: Finished difference. Result has 139 places, 117 transitions, 910 flow [2023-08-29 21:57:54,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=910, PETRI_PLACES=139, PETRI_TRANSITIONS=117} [2023-08-29 21:57:54,589 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 36 predicate places. [2023-08-29 21:57:54,590 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 117 transitions, 910 flow [2023-08-29 21:57:54,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 143.0) internal successors, (4290), 30 states have internal predecessors, (4290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:57:54,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:57:54,591 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:57:54,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-29 21:57:54,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-29 21:57:54,796 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:57:54,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:57:54,796 INFO L85 PathProgramCache]: Analyzing trace with hash -788866064, now seen corresponding path program 4 times [2023-08-29 21:57:54,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:57:54,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111996533] [2023-08-29 21:57:54,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:57:54,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:57:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:57:57,338 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 21:57:57,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:57:57,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111996533] [2023-08-29 21:57:57,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111996533] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:57:57,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011214867] [2023-08-29 21:57:57,339 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 21:57:57,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:57:57,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:57:57,341 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 21:57:57,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-29 21:57:57,448 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 21:57:57,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:57:57,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-29 21:57:57,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:57:57,458 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 7 treesize of output 6 [2023-08-29 21:57:57,534 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:57:57,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 21:57:57,573 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 13 treesize of output 15 [2023-08-29 21:57:57,598 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 13 treesize of output 15 [2023-08-29 21:57:57,634 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 16 treesize of output 12 [2023-08-29 21:57:57,698 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:57:57,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-29 21:57:57,788 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 22 treesize of output 17 [2023-08-29 21:57:57,881 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 21:57:57,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:57:58,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-08-29 21:57:58,055 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 15 treesize of output 8 [2023-08-29 21:58:12,205 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_98| Int) (v_ArrVal_944 (Array Int Int)) (v_ArrVal_948 Int) (|~#a~0.offset| Int) (|v_t_funThread2of2ForFork0_~i~0#1_89| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_944) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_98| 28) |~#a~0.offset|) v_ArrVal_948) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_89| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_98|) (< |v_t_funThread1of2ForFork0_~i~0#1_98| 0) (= |v_t_funThread2of2ForFork0_~i~0#1_89| |v_t_funThread1of2ForFork0_~i~0#1_98|))) is different from false [2023-08-29 21:58:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-29 21:58:12,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011214867] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:58:12,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:58:12,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 29 [2023-08-29 21:58:12,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216373990] [2023-08-29 21:58:12,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:58:12,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-29 21:58:12,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:58:12,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-29 21:58:12,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=674, Unknown=3, NotChecked=56, Total=930 [2023-08-29 21:58:12,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 572 [2023-08-29 21:58:12,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 117 transitions, 910 flow. Second operand has 31 states, 31 states have (on average 144.03225806451613) internal successors, (4465), 31 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:58:12,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:58:12,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 572 [2023-08-29 21:58:12,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:58:13,657 INFO L130 PetriNetUnfolder]: 1105/2280 cut-off events. [2023-08-29 21:58:13,658 INFO L131 PetriNetUnfolder]: For 28732/28744 co-relation queries the response was YES. [2023-08-29 21:58:13,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11551 conditions, 2280 events. 1105/2280 cut-off events. For 28732/28744 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 15443 event pairs, 165 based on Foata normal form. 12/2066 useless extension candidates. Maximal degree in co-relation 11478. Up to 1405 conditions per place. [2023-08-29 21:58:13,667 INFO L137 encePairwiseOnDemand]: 561/572 looper letters, 122 selfloop transitions, 30 changer transitions 14/172 dead transitions. [2023-08-29 21:58:13,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 172 transitions, 1676 flow [2023-08-29 21:58:13,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-29 21:58:13,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-29 21:58:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2803 transitions. [2023-08-29 21:58:13,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2579131394920869 [2023-08-29 21:58:13,672 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2803 transitions. [2023-08-29 21:58:13,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2803 transitions. [2023-08-29 21:58:13,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:58:13,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2803 transitions. [2023-08-29 21:58:13,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 147.52631578947367) internal successors, (2803), 19 states have internal predecessors, (2803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:58:13,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 572.0) internal successors, (11440), 20 states have internal predecessors, (11440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:58:13,684 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 572.0) internal successors, (11440), 20 states have internal predecessors, (11440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:58:13,684 INFO L175 Difference]: Start difference. First operand has 139 places, 117 transitions, 910 flow. Second operand 19 states and 2803 transitions. [2023-08-29 21:58:13,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 172 transitions, 1676 flow [2023-08-29 21:58:13,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 172 transitions, 1559 flow, removed 37 selfloop flow, removed 15 redundant places. [2023-08-29 21:58:13,720 INFO L231 Difference]: Finished difference. Result has 145 places, 124 transitions, 961 flow [2023-08-29 21:58:13,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=793, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=961, PETRI_PLACES=145, PETRI_TRANSITIONS=124} [2023-08-29 21:58:13,721 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 42 predicate places. [2023-08-29 21:58:13,721 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 124 transitions, 961 flow [2023-08-29 21:58:13,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 144.03225806451613) internal successors, (4465), 31 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:58:13,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:58:13,722 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:58:13,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-29 21:58:13,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:58:13,927 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:58:13,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:58:13,928 INFO L85 PathProgramCache]: Analyzing trace with hash 468433063, now seen corresponding path program 2 times [2023-08-29 21:58:13,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:58:13,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658642872] [2023-08-29 21:58:13,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:58:13,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:58:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:58:16,615 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 21:58:16,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:58:16,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658642872] [2023-08-29 21:58:16,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658642872] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:58:16,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632925124] [2023-08-29 21:58:16,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 21:58:16,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:58:16,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:58:16,621 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 21:58:16,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-29 21:58:16,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 21:58:16,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:58:16,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-29 21:58:16,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:58:16,774 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 7 treesize of output 6 [2023-08-29 21:58:16,883 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:58:16,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 21:58:16,919 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 13 treesize of output 15 [2023-08-29 21:58:16,948 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 13 treesize of output 15 [2023-08-29 21:58:16,993 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 16 treesize of output 12 [2023-08-29 21:58:17,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:58:17,049 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 21 [2023-08-29 21:58:17,095 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:58:17,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-29 21:58:17,142 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 22 treesize of output 17 [2023-08-29 21:58:17,211 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 21:58:17,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:58:17,362 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_100| Int) (v_ArrVal_1033 Int) (v_ArrVal_1032 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of2ForFork0_~i~0#1_100| 28))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) v_ArrVal_1033) (+ .cse0 |c_~#a~0.offset|)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1032) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0))))) is different from false [2023-08-29 21:58:17,385 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:58:17,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-29 21:58:17,394 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:58:17,394 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 48 treesize of output 38 [2023-08-29 21:58:17,399 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 25 treesize of output 18 [2023-08-29 21:58:33,535 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~i~0#1_91| Int) (v_ArrVal_1029 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_100| Int) (v_ArrVal_1033 Int) (|~#a~0.offset| Int)) (or (= |v_t_funThread1of2ForFork0_~i~0#1_100| |v_t_funThread2of2ForFork0_~i~0#1_91|) (= 0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1029) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_91| 28) |~#a~0.offset|) v_ArrVal_1033) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_100| 28) |~#a~0.offset|))))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-29 21:58:37,065 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-29 21:58:37,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632925124] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:58:37,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:58:37,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 7] total 32 [2023-08-29 21:58:37,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504736675] [2023-08-29 21:58:37,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:58:37,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-29 21:58:37,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:58:37,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-29 21:58:37,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=814, Unknown=5, NotChecked=122, Total=1122 [2023-08-29 21:58:37,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 572 [2023-08-29 21:58:37,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 124 transitions, 961 flow. Second operand has 34 states, 34 states have (on average 143.85294117647058) internal successors, (4891), 34 states have internal predecessors, (4891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:58:37,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:58:37,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 572 [2023-08-29 21:58:37,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:59:04,145 WARN L222 SmtUtils]: Spent 26.15s on a formula simplification. DAG size of input: 55 DAG size of output: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:59:06,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 21:59:08,149 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-29 21:59:10,161 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-29 21:59:12,283 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-29 21:59:14,289 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-29 21:59:16,312 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-29 21:59:41,338 WARN L222 SmtUtils]: Spent 24.11s on a formula simplification. DAG size of input: 47 DAG size of output: 36 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:59:43,341 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-29 21:59:45,346 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-29 21:59:47,352 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-29 21:59:49,356 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-29 21:59:51,368 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-29 21:59:53,371 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-29 21:59:55,376 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-29 21:59:57,386 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-29 21:59:59,423 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-29 22:00:01,502 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-29 22:00:03,531 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-29 22:00:07,673 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-29 22:00:09,675 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-29 22:00:11,704 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-29 22:00:13,712 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-29 22:00:15,721 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-29 22:00:17,751 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-29 22:00:19,764 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-29 22:00:21,786 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-29 22:00:23,844 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-29 22:00:27,709 INFO L130 PetriNetUnfolder]: 1290/2671 cut-off events. [2023-08-29 22:00:27,709 INFO L131 PetriNetUnfolder]: For 37690/37708 co-relation queries the response was YES. [2023-08-29 22:00:27,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13689 conditions, 2671 events. 1290/2671 cut-off events. For 37690/37708 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 19071 event pairs, 190 based on Foata normal form. 24/2427 useless extension candidates. Maximal degree in co-relation 13612. Up to 1578 conditions per place. [2023-08-29 22:00:27,721 INFO L137 encePairwiseOnDemand]: 558/572 looper letters, 143 selfloop transitions, 46 changer transitions 26/221 dead transitions. [2023-08-29 22:00:27,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 221 transitions, 2279 flow [2023-08-29 22:00:27,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-29 22:00:27,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-29 22:00:27,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4131 transitions. [2023-08-29 22:00:27,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25792957042957043 [2023-08-29 22:00:27,726 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 4131 transitions. [2023-08-29 22:00:27,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 4131 transitions. [2023-08-29 22:00:27,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:00:27,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 4131 transitions. [2023-08-29 22:00:27,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 147.53571428571428) internal successors, (4131), 28 states have internal predecessors, (4131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:00:27,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 572.0) internal successors, (16588), 29 states have internal predecessors, (16588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:00:27,742 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 572.0) internal successors, (16588), 29 states have internal predecessors, (16588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:00:27,743 INFO L175 Difference]: Start difference. First operand has 145 places, 124 transitions, 961 flow. Second operand 28 states and 4131 transitions. [2023-08-29 22:00:27,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 221 transitions, 2279 flow [2023-08-29 22:00:27,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 221 transitions, 2184 flow, removed 30 selfloop flow, removed 14 redundant places. [2023-08-29 22:00:27,788 INFO L231 Difference]: Finished difference. Result has 164 places, 136 transitions, 1279 flow [2023-08-29 22:00:27,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1279, PETRI_PLACES=164, PETRI_TRANSITIONS=136} [2023-08-29 22:00:27,789 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 61 predicate places. [2023-08-29 22:00:27,789 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 136 transitions, 1279 flow [2023-08-29 22:00:27,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 143.85294117647058) internal successors, (4891), 34 states have internal predecessors, (4891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:00:27,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:00:27,791 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:00:27,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-29 22:00:27,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-29 22:00:27,996 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 22:00:27,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:00:27,997 INFO L85 PathProgramCache]: Analyzing trace with hash -2063981827, now seen corresponding path program 3 times [2023-08-29 22:00:27,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:00:27,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599286964] [2023-08-29 22:00:27,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:00:27,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:00:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:00:30,810 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 22:00:30,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:00:30,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599286964] [2023-08-29 22:00:30,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599286964] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 22:00:30,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176095994] [2023-08-29 22:00:30,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 22:00:30,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:00:30,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 22:00:30,811 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 22:00:30,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-29 22:00:30,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-29 22:00:30,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 22:00:30,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-29 22:00:30,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:00:30,941 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 7 treesize of output 6 [2023-08-29 22:00:31,040 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:00:31,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 22:00:31,075 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 13 treesize of output 15 [2023-08-29 22:00:31,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 13 treesize of output 15 [2023-08-29 22:00:31,144 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 16 treesize of output 12 [2023-08-29 22:00:31,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 22:00:31,193 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 21 [2023-08-29 22:00:31,213 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 22 treesize of output 17 [2023-08-29 22:00:31,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 22:00:31,265 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 21 [2023-08-29 22:00:31,317 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:00:31,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-29 22:00:31,385 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 22:00:31,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 22:00:31,470 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_102| Int) (v_ArrVal_1121 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of2ForFork0_~i~0#1_102| 28))) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1121) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse0)) 0))))) is different from false [2023-08-29 22:00:31,567 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 22:00:31,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-29 22:00:31,575 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 22:00:31,576 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 48 treesize of output 38 [2023-08-29 22:00:31,581 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 25 treesize of output 18 [2023-08-29 22:00:49,775 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~i~0#1_93| Int) (|v_t_funThread1of2ForFork0_~i~0#1_102| Int) (v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1120 Int) (|~#a~0.offset| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1115) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28) |~#a~0.offset|) v_ArrVal_1120) (+ |~#a~0.offset| (* |v_t_funThread1of2ForFork0_~i~0#1_102| 28))) 0) (= |v_t_funThread1of2ForFork0_~i~0#1_102| |v_t_funThread2of2ForFork0_~i~0#1_93|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-29 22:00:53,506 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-29 22:00:53,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176095994] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 22:00:53,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 22:00:53,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 7] total 32 [2023-08-29 22:00:53,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851780036] [2023-08-29 22:00:53,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 22:00:53,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-29 22:00:53,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:00:53,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-29 22:00:53,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=766, Unknown=5, NotChecked=122, Total=1122 [2023-08-29 22:00:53,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 572 [2023-08-29 22:00:53,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 136 transitions, 1279 flow. Second operand has 34 states, 34 states have (on average 143.85294117647058) internal successors, (4891), 34 states have internal predecessors, (4891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:00:53,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:00:53,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 572 [2023-08-29 22:00:53,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:01:14,414 WARN L222 SmtUtils]: Spent 20.16s on a formula simplification. DAG size of input: 55 DAG size of output: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 22:01:16,421 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-29 22:01:18,593 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-29 22:01:20,595 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-29 22:01:22,655 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-29 22:01:40,865 WARN L222 SmtUtils]: Spent 18.12s on a formula simplification. DAG size of input: 47 DAG size of output: 36 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 22:01:42,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:01:44,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 [1] [2023-08-29 22:01:46,889 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-29 22:01:48,892 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-29 22:01:50,909 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-29 22:01:53,033 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-29 22:01:55,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-29 22:01:57,049 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-29 22:01:59,066 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-29 22:02:01,071 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-29 22:02:04,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-29 22:02:06,023 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-29 22:02:08,025 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-29 22:02:10,041 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-29 22:02:12,043 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-29 22:02:14,057 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-29 22:02:16,059 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-29 22:02:18,068 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-29 22:02:20,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:02:22,090 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-29 22:02:24,092 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-29 22:02:26,094 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-29 22:02:28,104 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-29 22:02:30,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:02:32,145 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-29 22:02:34,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:02:36,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:02:38,601 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-29 22:02:40,602 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-29 22:02:42,605 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-29 22:02:44,646 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-29 22:02:46,649 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-29 22:02:48,668 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-29 22:02:50,686 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-29 22:02:52,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 [1] [2023-08-29 22:02:54,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:02:56,703 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-29 22:02:58,713 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-29 22:03:00,717 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-29 22:03:04,476 INFO L130 PetriNetUnfolder]: 1369/2857 cut-off events. [2023-08-29 22:03:04,477 INFO L131 PetriNetUnfolder]: For 56206/56206 co-relation queries the response was YES. [2023-08-29 22:03:04,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15616 conditions, 2857 events. 1369/2857 cut-off events. For 56206/56206 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 20844 event pairs, 204 based on Foata normal form. 12/2579 useless extension candidates. Maximal degree in co-relation 15533. Up to 1563 conditions per place. [2023-08-29 22:03:04,490 INFO L137 encePairwiseOnDemand]: 557/572 looper letters, 137 selfloop transitions, 63 changer transitions 20/226 dead transitions. [2023-08-29 22:03:04,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 226 transitions, 2788 flow [2023-08-29 22:03:04,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-29 22:03:04,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-29 22:03:04,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 3977 transitions. [2023-08-29 22:03:04,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25751100751100753 [2023-08-29 22:03:04,495 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 3977 transitions. [2023-08-29 22:03:04,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 3977 transitions. [2023-08-29 22:03:04,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:03:04,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 3977 transitions. [2023-08-29 22:03:04,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 147.2962962962963) internal successors, (3977), 27 states have internal predecessors, (3977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:03:04,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 572.0) internal successors, (16016), 28 states have internal predecessors, (16016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:03:04,512 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 572.0) internal successors, (16016), 28 states have internal predecessors, (16016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:03:04,512 INFO L175 Difference]: Start difference. First operand has 164 places, 136 transitions, 1279 flow. Second operand 27 states and 3977 transitions. [2023-08-29 22:03:04,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 226 transitions, 2788 flow [2023-08-29 22:03:04,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 226 transitions, 2453 flow, removed 135 selfloop flow, removed 18 redundant places. [2023-08-29 22:03:04,649 INFO L231 Difference]: Finished difference. Result has 178 places, 158 transitions, 1622 flow [2023-08-29 22:03:04,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1622, PETRI_PLACES=178, PETRI_TRANSITIONS=158} [2023-08-29 22:03:04,649 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 75 predicate places. [2023-08-29 22:03:04,649 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 158 transitions, 1622 flow [2023-08-29 22:03:04,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 143.85294117647058) internal successors, (4891), 34 states have internal predecessors, (4891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:03:04,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:03:04,651 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:03:04,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-29 22:03:04,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-29 22:03:04,855 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 22:03:04,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:03:04,855 INFO L85 PathProgramCache]: Analyzing trace with hash -865988252, now seen corresponding path program 5 times [2023-08-29 22:03:04,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:03:04,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48589690] [2023-08-29 22:03:04,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:03:04,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:03:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:03:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 22:03:08,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:03:08,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48589690] [2023-08-29 22:03:08,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48589690] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 22:03:08,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516855854] [2023-08-29 22:03:08,178 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-29 22:03:08,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:03:08,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 22:03:08,179 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 22:03:08,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-29 22:03:08,493 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-29 22:03:08,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 22:03:08,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-29 22:03:08,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:03:08,503 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 7 treesize of output 6 [2023-08-29 22:03:08,606 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:03:08,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 22:03:08,643 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 13 treesize of output 15 [2023-08-29 22:03:08,673 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 13 treesize of output 15 [2023-08-29 22:03:08,692 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 16 treesize of output 12 [2023-08-29 22:03:08,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 22:03:08,768 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 21 [2023-08-29 22:03:08,880 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:03:08,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-29 22:03:08,934 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 22 treesize of output 17 [2023-08-29 22:03:09,008 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 20 treesize of output 22 [2023-08-29 22:03:09,085 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 22:03:09,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 22:03:09,121 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1212 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1212) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-08-29 22:03:09,299 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_95| Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 (Array Int Int)) (v_ArrVal_1209 (Array Int Int))) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_95| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1209) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_1210)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1212) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset|)) 0)))) is different from false [2023-08-29 22:03:09,334 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 22:03:09,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-29 22:03:09,346 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 22:03:09,347 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 48 treesize of output 38 [2023-08-29 22:03:09,354 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 25 treesize of output 18 [2023-08-29 22:03:11,413 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread1of2ForFork0_~i~0#1_104| Int)) (or (< |v_t_funThread1of2ForFork0_~i~0#1_104| 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_104|) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_95| Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 (Array Int Int)) (|~#a~0.offset| Int)) (or (= 0 (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_104| 28) |~#a~0.offset|) v_ArrVal_1210)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1212) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_95| 28) |~#a~0.offset|))) (= |v_t_funThread1of2ForFork0_~i~0#1_104| |v_t_funThread2of2ForFork0_~i~0#1_95|))))) (or (forall ((|v_t_funThread2of2ForFork0_~i~0#1_95| Int) (|v_t_funThread1of2ForFork0_~i~0#1_104| Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 (Array Int Int)) (|~#a~0.offset| Int)) (or (< |v_t_funThread1of2ForFork0_~i~0#1_104| 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_104|) (= 0 (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_104| 28) |~#a~0.offset|) v_ArrVal_1210)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1212) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_95| 28) |~#a~0.offset|))))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2023-08-29 22:03:13,445 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1206 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_95| Int) (|v_t_funThread1of2ForFork0_~i~0#1_104| Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 (Array Int Int)) (|~#a~0.offset| Int)) (or (< |v_t_funThread1of2ForFork0_~i~0#1_104| 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_104|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1206))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_104| 28) |~#a~0.offset|) v_ArrVal_1210))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1212) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_95| 28) |~#a~0.offset|)) 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_1206 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_104| Int)) (or (< |v_t_funThread1of2ForFork0_~i~0#1_104| 0) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_95| Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 (Array Int Int)) (|~#a~0.offset| Int)) (or (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1206))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_104| 28) |~#a~0.offset|) v_ArrVal_1210))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1212) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_95| 28) |~#a~0.offset|)) 0) (= |v_t_funThread1of2ForFork0_~i~0#1_104| |v_t_funThread2of2ForFork0_~i~0#1_95|))) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_104|)))) is different from false [2023-08-29 22:03:21,693 WARN L222 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 22:03:22,062 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-29 22:03:22,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516855854] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 22:03:22,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 22:03:22,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 8] total 33 [2023-08-29 22:03:22,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708753376] [2023-08-29 22:03:22,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 22:03:22,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-29 22:03:22,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:03:22,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-29 22:03:22,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=777, Unknown=6, NotChecked=244, Total=1190 [2023-08-29 22:03:22,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 572 [2023-08-29 22:03:22,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 158 transitions, 1622 flow. Second operand has 35 states, 35 states have (on average 141.9142857142857) internal successors, (4967), 35 states have internal predecessors, (4967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:03:22,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:03:22,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 572 [2023-08-29 22:03:22,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:03:25,990 INFO L130 PetriNetUnfolder]: 1447/3060 cut-off events. [2023-08-29 22:03:25,991 INFO L131 PetriNetUnfolder]: For 70015/70045 co-relation queries the response was YES. [2023-08-29 22:03:26,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16948 conditions, 3060 events. 1447/3060 cut-off events. For 70015/70045 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 23020 event pairs, 270 based on Foata normal form. 4/2757 useless extension candidates. Maximal degree in co-relation 16858. Up to 1805 conditions per place. [2023-08-29 22:03:26,006 INFO L137 encePairwiseOnDemand]: 555/572 looper letters, 140 selfloop transitions, 35 changer transitions 73/254 dead transitions. [2023-08-29 22:03:26,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 254 transitions, 2981 flow [2023-08-29 22:03:26,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-29 22:03:26,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-29 22:03:26,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3645 transitions. [2023-08-29 22:03:26,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2548951048951049 [2023-08-29 22:03:26,010 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3645 transitions. [2023-08-29 22:03:26,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3645 transitions. [2023-08-29 22:03:26,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:03:26,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3645 transitions. [2023-08-29 22:03:26,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 145.8) internal successors, (3645), 25 states have internal predecessors, (3645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:03:26,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 572.0) internal successors, (14872), 26 states have internal predecessors, (14872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:03:26,025 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 572.0) internal successors, (14872), 26 states have internal predecessors, (14872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:03:26,025 INFO L175 Difference]: Start difference. First operand has 178 places, 158 transitions, 1622 flow. Second operand 25 states and 3645 transitions. [2023-08-29 22:03:26,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 254 transitions, 2981 flow [2023-08-29 22:03:26,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 254 transitions, 2660 flow, removed 130 selfloop flow, removed 17 redundant places. [2023-08-29 22:03:26,118 INFO L231 Difference]: Finished difference. Result has 192 places, 150 transitions, 1372 flow [2023-08-29 22:03:26,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=1311, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1372, PETRI_PLACES=192, PETRI_TRANSITIONS=150} [2023-08-29 22:03:26,119 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 89 predicate places. [2023-08-29 22:03:26,119 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 150 transitions, 1372 flow [2023-08-29 22:03:26,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 141.9142857142857) internal successors, (4967), 35 states have internal predecessors, (4967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:03:26,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:03:26,121 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:03:26,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-29 22:03:26,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:03:26,322 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 22:03:26,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:03:26,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1167303077, now seen corresponding path program 4 times [2023-08-29 22:03:26,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:03:26,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186837958] [2023-08-29 22:03:26,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:03:26,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:03:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:03:28,566 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 22:03:28,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:03:28,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186837958] [2023-08-29 22:03:28,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186837958] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 22:03:28,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587110230] [2023-08-29 22:03:28,566 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 22:03:28,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:03:28,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 22:03:28,567 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 22:03:28,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-29 22:03:28,696 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 22:03:28,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 22:03:28,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-29 22:03:28,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:03:28,703 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 7 treesize of output 6 [2023-08-29 22:03:28,785 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:03:28,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 22:03:28,816 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 13 treesize of output 15 [2023-08-29 22:03:28,838 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 16 treesize of output 12 [2023-08-29 22:03:28,891 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 13 treesize of output 15 [2023-08-29 22:03:28,943 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:03:28,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-29 22:03:29,045 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 22 treesize of output 17 [2023-08-29 22:03:29,157 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 20 treesize of output 22 [2023-08-29 22:03:29,216 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 22:03:29,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 22:03:29,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-08-29 22:03:29,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 15 treesize of output 8 [2023-08-29 22:03:31,577 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_97| Int) (v_ArrVal_1302 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_106| Int) (|~#a~0.offset| Int) (v_ArrVal_1300 Int)) (or (= |v_t_funThread1of2ForFork0_~i~0#1_106| |v_t_funThread2of2ForFork0_~i~0#1_97|) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_97|) (< |v_t_funThread2of2ForFork0_~i~0#1_97| 0) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_97| 28) |~#a~0.offset|) v_ArrVal_1300)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1302) |c_~#a~0.base|) (+ |~#a~0.offset| (* |v_t_funThread1of2ForFork0_~i~0#1_106| 28))) 0))) is different from false [2023-08-29 22:03:33,621 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_97| Int) (v_ArrVal_1302 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_106| Int) (|~#a~0.offset| Int) (v_ArrVal_1300 Int) (v_ArrVal_1296 (Array Int Int))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1296))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_97| 28) |~#a~0.offset|) v_ArrVal_1300))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1302) |c_~#a~0.base|) (+ |~#a~0.offset| (* |v_t_funThread1of2ForFork0_~i~0#1_106| 28))) 0) (= |v_t_funThread1of2ForFork0_~i~0#1_106| |v_t_funThread2of2ForFork0_~i~0#1_97|) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_97|) (< |v_t_funThread2of2ForFork0_~i~0#1_97| 0))) is different from false [2023-08-29 22:03:33,904 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 4 not checked. [2023-08-29 22:03:33,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587110230] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 22:03:33,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 22:03:33,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 7] total 29 [2023-08-29 22:03:33,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629693573] [2023-08-29 22:03:33,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 22:03:33,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-29 22:03:33,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:03:33,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-29 22:03:33,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=656, Unknown=5, NotChecked=110, Total=930 [2023-08-29 22:03:34,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 572 [2023-08-29 22:03:34,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 150 transitions, 1372 flow. Second operand has 31 states, 31 states have (on average 144.1290322580645) internal successors, (4468), 31 states have internal predecessors, (4468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:03:34,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:03:34,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 572 [2023-08-29 22:03:34,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:03:35,699 INFO L130 PetriNetUnfolder]: 1308/2787 cut-off events. [2023-08-29 22:03:35,699 INFO L131 PetriNetUnfolder]: For 59294/59318 co-relation queries the response was YES. [2023-08-29 22:03:35,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16334 conditions, 2787 events. 1308/2787 cut-off events. For 59294/59318 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 20628 event pairs, 280 based on Foata normal form. 4/2510 useless extension candidates. Maximal degree in co-relation 16236. Up to 1749 conditions per place. [2023-08-29 22:03:35,715 INFO L137 encePairwiseOnDemand]: 562/572 looper letters, 123 selfloop transitions, 22 changer transitions 48/199 dead transitions. [2023-08-29 22:03:35,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 199 transitions, 2220 flow [2023-08-29 22:03:35,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-29 22:03:35,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-29 22:03:35,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2802 transitions. [2023-08-29 22:03:35,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2578211262421789 [2023-08-29 22:03:35,718 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2802 transitions. [2023-08-29 22:03:35,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2802 transitions. [2023-08-29 22:03:35,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:03:35,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2802 transitions. [2023-08-29 22:03:35,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 147.47368421052633) internal successors, (2802), 19 states have internal predecessors, (2802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:03:35,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 572.0) internal successors, (11440), 20 states have internal predecessors, (11440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:03:35,726 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 572.0) internal successors, (11440), 20 states have internal predecessors, (11440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:03:35,727 INFO L175 Difference]: Start difference. First operand has 192 places, 150 transitions, 1372 flow. Second operand 19 states and 2802 transitions. [2023-08-29 22:03:35,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 199 transitions, 2220 flow [2023-08-29 22:03:35,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 199 transitions, 2085 flow, removed 35 selfloop flow, removed 22 redundant places. [2023-08-29 22:03:35,787 INFO L231 Difference]: Finished difference. Result has 179 places, 139 transitions, 1215 flow [2023-08-29 22:03:35,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1215, PETRI_PLACES=179, PETRI_TRANSITIONS=139} [2023-08-29 22:03:35,787 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 76 predicate places. [2023-08-29 22:03:35,787 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 139 transitions, 1215 flow [2023-08-29 22:03:35,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 144.1290322580645) internal successors, (4468), 31 states have internal predecessors, (4468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:03:35,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:03:35,788 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:03:35,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-29 22:03:35,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:03:35,994 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 22:03:35,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:03:35,995 INFO L85 PathProgramCache]: Analyzing trace with hash 463363634, now seen corresponding path program 6 times [2023-08-29 22:03:35,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:03:35,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453024351] [2023-08-29 22:03:35,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:03:35,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:03:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:03:39,288 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-29 22:03:39,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:03:39,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453024351] [2023-08-29 22:03:39,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453024351] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 22:03:39,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747935875] [2023-08-29 22:03:39,288 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-29 22:03:39,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:03:39,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 22:03:39,289 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 22:03:39,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-29 22:03:39,623 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-08-29 22:03:39,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 22:03:39,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-29 22:03:39,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:03:39,634 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 7 treesize of output 6 [2023-08-29 22:03:39,719 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:03:39,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 22:03:39,745 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 13 treesize of output 15 [2023-08-29 22:03:39,764 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 13 treesize of output 15 [2023-08-29 22:03:39,785 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 16 treesize of output 12 [2023-08-29 22:03:39,833 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:03:39,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-29 22:03:39,894 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 22 treesize of output 17 [2023-08-29 22:03:39,936 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 20 treesize of output 22 [2023-08-29 22:03:39,995 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-29 22:03:39,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 22:03:40,008 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1392 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1392) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-08-29 22:03:40,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-08-29 22:03:40,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-08-29 22:03:40,185 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 15 treesize of output 8 [2023-08-29 22:03:50,260 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#a~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (forall ((v_ArrVal_1387 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread2of2ForFork0_~i~0#1_99| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1387) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_99| 28) |~#a~0.offset|)) 0))) is different from false [2023-08-29 22:03:50,373 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-29 22:03:50,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747935875] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 22:03:50,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 22:03:50,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 7] total 28 [2023-08-29 22:03:50,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185158812] [2023-08-29 22:03:50,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 22:03:50,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-29 22:03:50,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:03:50,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-29 22:03:50,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=609, Unknown=3, NotChecked=106, Total=870 [2023-08-29 22:03:50,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 572 [2023-08-29 22:03:50,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 139 transitions, 1215 flow. Second operand has 30 states, 30 states have (on average 145.06666666666666) internal successors, (4352), 30 states have internal predecessors, (4352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:03:50,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:03:50,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 572 [2023-08-29 22:03:50,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:03:51,720 INFO L130 PetriNetUnfolder]: 1093/2391 cut-off events. [2023-08-29 22:03:51,721 INFO L131 PetriNetUnfolder]: For 37827/37851 co-relation queries the response was YES. [2023-08-29 22:03:51,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13385 conditions, 2391 events. 1093/2391 cut-off events. For 37827/37851 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 17460 event pairs, 288 based on Foata normal form. 4/2169 useless extension candidates. Maximal degree in co-relation 13309. Up to 1531 conditions per place. [2023-08-29 22:03:51,733 INFO L137 encePairwiseOnDemand]: 558/572 looper letters, 113 selfloop transitions, 20 changer transitions 54/193 dead transitions. [2023-08-29 22:03:51,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 193 transitions, 2125 flow [2023-08-29 22:03:51,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-29 22:03:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-29 22:03:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2964 transitions. [2023-08-29 22:03:51,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2590909090909091 [2023-08-29 22:03:51,737 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2964 transitions. [2023-08-29 22:03:51,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2964 transitions. [2023-08-29 22:03:51,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:03:51,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2964 transitions. [2023-08-29 22:03:51,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 148.2) internal successors, (2964), 20 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:03:51,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 572.0) internal successors, (12012), 21 states have internal predecessors, (12012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:03:51,748 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 572.0) internal successors, (12012), 21 states have internal predecessors, (12012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:03:51,748 INFO L175 Difference]: Start difference. First operand has 179 places, 139 transitions, 1215 flow. Second operand 20 states and 2964 transitions. [2023-08-29 22:03:51,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 193 transitions, 2125 flow [2023-08-29 22:03:51,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 193 transitions, 2020 flow, removed 25 selfloop flow, removed 22 redundant places. [2023-08-29 22:03:51,817 INFO L231 Difference]: Finished difference. Result has 170 places, 129 transitions, 1078 flow [2023-08-29 22:03:51,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1078, PETRI_PLACES=170, PETRI_TRANSITIONS=129} [2023-08-29 22:03:51,818 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 67 predicate places. [2023-08-29 22:03:51,818 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 129 transitions, 1078 flow [2023-08-29 22:03:51,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 145.06666666666666) internal successors, (4352), 30 states have internal predecessors, (4352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:03:51,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:03:51,819 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:03:51,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-29 22:03:52,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:03:52,025 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 22:03:52,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:03:52,025 INFO L85 PathProgramCache]: Analyzing trace with hash 159581999, now seen corresponding path program 5 times [2023-08-29 22:03:52,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:03:52,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521506945] [2023-08-29 22:03:52,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:03:52,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:03:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:03:55,025 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-29 22:03:55,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:03:55,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521506945] [2023-08-29 22:03:55,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521506945] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 22:03:55,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107058962] [2023-08-29 22:03:55,025 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-29 22:03:55,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:03:55,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 22:03:55,029 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 22:03:55,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-29 22:03:55,342 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-29 22:03:55,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 22:03:55,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-29 22:03:55,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:03:55,350 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 7 treesize of output 6 [2023-08-29 22:03:55,429 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:03:55,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 22:03:55,460 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 13 treesize of output 15 [2023-08-29 22:03:55,485 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 13 treesize of output 15 [2023-08-29 22:03:55,515 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 16 treesize of output 12 [2023-08-29 22:03:55,580 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:03:55,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-29 22:03:55,671 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 22 treesize of output 17 [2023-08-29 22:03:55,759 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 20 treesize of output 22 [2023-08-29 22:03:55,826 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-29 22:03:55,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 22:03:56,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-08-29 22:03:56,049 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 15 treesize of output 8 [2023-08-29 22:03:58,064 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_101| Int) (v_ArrVal_1481 Int) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_110| Int) (v_ArrVal_1482 (Array Int Int))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_101| 0) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_101| 28) |~#a~0.offset|) v_ArrVal_1481)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1482) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_110| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_101|) (= |v_t_funThread1of2ForFork0_~i~0#1_110| |v_t_funThread2of2ForFork0_~i~0#1_101|))) is different from false [2023-08-29 22:04:00,114 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_101| Int) (v_ArrVal_1481 Int) (v_ArrVal_1477 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_1482 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_110| Int)) (or (< |v_t_funThread2of2ForFork0_~i~0#1_101| 0) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1477))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_101| 28) |~#a~0.offset|) v_ArrVal_1481))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1482) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_110| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_101|) (= |v_t_funThread1of2ForFork0_~i~0#1_110| |v_t_funThread2of2ForFork0_~i~0#1_101|))) is different from false [2023-08-29 22:04:00,477 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-29 22:04:00,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107058962] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 22:04:00,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 22:04:00,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 7] total 30 [2023-08-29 22:04:00,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160726554] [2023-08-29 22:04:00,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 22:04:00,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-29 22:04:00,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:04:00,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-29 22:04:00,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=708, Unknown=5, NotChecked=114, Total=992 [2023-08-29 22:04:00,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 572 [2023-08-29 22:04:00,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 129 transitions, 1078 flow. Second operand has 32 states, 32 states have (on average 144.03125) internal successors, (4609), 32 states have internal predecessors, (4609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:04:00,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:04:00,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 572 [2023-08-29 22:04:00,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:04:02,148 INFO L130 PetriNetUnfolder]: 977/2186 cut-off events. [2023-08-29 22:04:02,148 INFO L131 PetriNetUnfolder]: For 32294/32314 co-relation queries the response was YES. [2023-08-29 22:04:02,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12096 conditions, 2186 events. 977/2186 cut-off events. For 32294/32314 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 15945 event pairs, 307 based on Foata normal form. 8/1986 useless extension candidates. Maximal degree in co-relation 12004. Up to 1143 conditions per place. [2023-08-29 22:04:02,159 INFO L137 encePairwiseOnDemand]: 562/572 looper letters, 95 selfloop transitions, 18 changer transitions 71/190 dead transitions. [2023-08-29 22:04:02,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 190 transitions, 1948 flow [2023-08-29 22:04:02,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-29 22:04:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-29 22:04:02,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3095 transitions. [2023-08-29 22:04:02,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2576590076590077 [2023-08-29 22:04:02,163 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3095 transitions. [2023-08-29 22:04:02,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3095 transitions. [2023-08-29 22:04:02,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:04:02,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3095 transitions. [2023-08-29 22:04:02,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 147.38095238095238) internal successors, (3095), 21 states have internal predecessors, (3095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:04:02,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 572.0) internal successors, (12584), 22 states have internal predecessors, (12584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:04:02,172 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 572.0) internal successors, (12584), 22 states have internal predecessors, (12584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:04:02,173 INFO L175 Difference]: Start difference. First operand has 170 places, 129 transitions, 1078 flow. Second operand 21 states and 3095 transitions. [2023-08-29 22:04:02,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 190 transitions, 1948 flow [2023-08-29 22:04:02,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 190 transitions, 1846 flow, removed 26 selfloop flow, removed 23 redundant places. [2023-08-29 22:04:02,227 INFO L231 Difference]: Finished difference. Result has 163 places, 112 transitions, 898 flow [2023-08-29 22:04:02,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=898, PETRI_PLACES=163, PETRI_TRANSITIONS=112} [2023-08-29 22:04:02,228 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 60 predicate places. [2023-08-29 22:04:02,228 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 112 transitions, 898 flow [2023-08-29 22:04:02,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 144.03125) internal successors, (4609), 32 states have internal predecessors, (4609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:04:02,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:04:02,229 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:04:02,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-29 22:04:02,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-08-29 22:04:02,430 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 22:04:02,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:04:02,430 INFO L85 PathProgramCache]: Analyzing trace with hash -411737115, now seen corresponding path program 6 times [2023-08-29 22:04:02,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:04:02,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364461461] [2023-08-29 22:04:02,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:04:02,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:04:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:04:05,386 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-29 22:04:05,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:04:05,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364461461] [2023-08-29 22:04:05,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364461461] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 22:04:05,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821927400] [2023-08-29 22:04:05,386 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-29 22:04:05,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:04:05,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 22:04:05,387 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 22:04:05,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-29 22:04:05,621 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-08-29 22:04:05,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 22:04:05,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-29 22:04:05,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:04:05,630 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 7 treesize of output 6 [2023-08-29 22:04:05,740 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:04:05,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 22:04:05,782 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 13 treesize of output 15 [2023-08-29 22:04:05,817 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 13 treesize of output 15 [2023-08-29 22:04:05,863 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 16 treesize of output 12 [2023-08-29 22:04:05,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 22:04:05,963 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 21 [2023-08-29 22:04:06,001 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 22 treesize of output 17 [2023-08-29 22:04:06,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 22:04:06,071 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 21 [2023-08-29 22:04:06,134 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:04:06,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-29 22:04:06,220 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 20 treesize of output 22 [2023-08-29 22:04:06,284 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-29 22:04:06,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 22:04:06,320 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1574 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1574) |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-08-29 22:04:06,383 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_112| Int) (v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1573 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of2ForFork0_~i~0#1_112| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1573) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1574) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset|)) 0)))) is different from false [2023-08-29 22:04:06,391 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_112| Int) (v_ArrVal_1572 Int) (v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1573 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of2ForFork0_~i~0#1_112| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1573) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) v_ArrVal_1572)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1574) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset|)) 0)))) is different from false [2023-08-29 22:04:06,430 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 22:04:06,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-29 22:04:06,440 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 22:04:06,440 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 48 treesize of output 38 [2023-08-29 22:04:06,446 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 25 treesize of output 18 [2023-08-29 22:04:08,483 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (forall ((|v_t_funThread1of2ForFork0_~i~0#1_112| Int) (|v_t_funThread2of2ForFork0_~i~0#1_103| Int) (v_ArrVal_1572 Int) (v_ArrVal_1574 (Array Int Int)) (|~#a~0.offset| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread2of2ForFork0_~i~0#1_103| 28) |~#a~0.offset|) v_ArrVal_1572)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1574) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_112| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_103|) (< |v_t_funThread2of2ForFork0_~i~0#1_103| 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_103| Int)) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_103|) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_112| Int) (v_ArrVal_1572 Int) (v_ArrVal_1574 (Array Int Int)) (|~#a~0.offset| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread2of2ForFork0_~i~0#1_103| 28) |~#a~0.offset|) v_ArrVal_1572)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1574) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_112| 28) |~#a~0.offset|)) 0) (= |v_t_funThread1of2ForFork0_~i~0#1_112| |v_t_funThread2of2ForFork0_~i~0#1_103|))) (< |v_t_funThread2of2ForFork0_~i~0#1_103| 0))))) is different from false [2023-08-29 22:04:10,593 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((|v_t_funThread1of2ForFork0_~i~0#1_112| Int) (v_ArrVal_1567 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_103| Int) (v_ArrVal_1572 Int) (v_ArrVal_1574 (Array Int Int)) (|~#a~0.offset| Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1567))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_103| 28) |~#a~0.offset|) v_ArrVal_1572))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1574) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_112| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_103|) (< |v_t_funThread2of2ForFork0_~i~0#1_103| 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_1567 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_103| Int)) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_103|) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_112| Int) (v_ArrVal_1572 Int) (v_ArrVal_1574 (Array Int Int)) (|~#a~0.offset| Int)) (or (= |v_t_funThread1of2ForFork0_~i~0#1_112| |v_t_funThread2of2ForFork0_~i~0#1_103|) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1567))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_103| 28) |~#a~0.offset|) v_ArrVal_1572))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1574) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_112| 28) |~#a~0.offset|)) 0))) (< |v_t_funThread2of2ForFork0_~i~0#1_103| 0)))) is different from false [2023-08-29 22:04:18,335 WARN L222 SmtUtils]: Spent 7.53s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 22:04:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-29 22:04:18,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821927400] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 22:04:18,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 22:04:18,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 8] total 33 [2023-08-29 22:04:18,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864839395] [2023-08-29 22:04:18,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 22:04:18,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-29 22:04:18,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:04:18,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-29 22:04:18,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=722, Unknown=5, NotChecked=300, Total=1190 [2023-08-29 22:04:18,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 572 [2023-08-29 22:04:18,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 112 transitions, 898 flow. Second operand has 35 states, 35 states have (on average 143.85714285714286) internal successors, (5035), 35 states have internal predecessors, (5035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:04:18,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:04:18,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 572 [2023-08-29 22:04:18,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:04:21,521 INFO L130 PetriNetUnfolder]: 690/1576 cut-off events. [2023-08-29 22:04:21,522 INFO L131 PetriNetUnfolder]: For 24093/24093 co-relation queries the response was YES. [2023-08-29 22:04:21,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8751 conditions, 1576 events. 690/1576 cut-off events. For 24093/24093 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10693 event pairs, 155 based on Foata normal form. 4/1451 useless extension candidates. Maximal degree in co-relation 8662. Up to 1046 conditions per place. [2023-08-29 22:04:21,530 INFO L137 encePairwiseOnDemand]: 557/572 looper letters, 103 selfloop transitions, 33 changer transitions 18/160 dead transitions. [2023-08-29 22:04:21,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 160 transitions, 1641 flow [2023-08-29 22:04:21,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-29 22:04:21,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-29 22:04:21,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3220 transitions. [2023-08-29 22:04:21,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25588048315321044 [2023-08-29 22:04:21,534 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3220 transitions. [2023-08-29 22:04:21,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3220 transitions. [2023-08-29 22:04:21,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:04:21,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3220 transitions. [2023-08-29 22:04:21,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 146.36363636363637) internal successors, (3220), 22 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:04:21,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 572.0) internal successors, (13156), 23 states have internal predecessors, (13156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:04:21,548 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 572.0) internal successors, (13156), 23 states have internal predecessors, (13156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:04:21,548 INFO L175 Difference]: Start difference. First operand has 163 places, 112 transitions, 898 flow. Second operand 22 states and 3220 transitions. [2023-08-29 22:04:21,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 160 transitions, 1641 flow [2023-08-29 22:04:21,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 160 transitions, 1543 flow, removed 29 selfloop flow, removed 22 redundant places. [2023-08-29 22:04:21,586 INFO L231 Difference]: Finished difference. Result has 156 places, 123 transitions, 1067 flow [2023-08-29 22:04:21,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1067, PETRI_PLACES=156, PETRI_TRANSITIONS=123} [2023-08-29 22:04:21,586 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 53 predicate places. [2023-08-29 22:04:21,586 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 123 transitions, 1067 flow [2023-08-29 22:04:21,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 143.85714285714286) internal successors, (5035), 35 states have internal predecessors, (5035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:04:21,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:04:21,588 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:04:21,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-29 22:04:21,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-08-29 22:04:21,794 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 22:04:21,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:04:21,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1641641188, now seen corresponding path program 1 times [2023-08-29 22:04:21,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:04:21,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75241817] [2023-08-29 22:04:21,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:04:21,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:04:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:04:22,108 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 22:04:22,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:04:22,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75241817] [2023-08-29 22:04:22,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75241817] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 22:04:22,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427300665] [2023-08-29 22:04:22,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:04:22,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:04:22,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 22:04:22,113 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 22:04:22,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-29 22:04:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:04:22,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-29 22:04:22,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:04:22,297 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 7 treesize of output 6 [2023-08-29 22:04:22,376 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:04:22,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 22:04:22,423 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 13 treesize of output 15 [2023-08-29 22:04:22,467 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 13 treesize of output 15 [2023-08-29 22:04:22,533 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 25 [2023-08-29 22:04:22,605 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 48 treesize of output 41 [2023-08-29 22:04:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 22:04:22,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 22:04:24,674 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1667 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1667) |c_~#a~0.base|))) is different from false [2023-08-29 22:04:24,762 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-29 22:04:24,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427300665] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 22:04:24,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 22:04:24,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 19 [2023-08-29 22:04:24,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778914775] [2023-08-29 22:04:24,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 22:04:24,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-29 22:04:24,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:04:24,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-29 22:04:24,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=303, Unknown=1, NotChecked=36, Total=420 [2023-08-29 22:04:26,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:04:28,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:04:29,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:04:31,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:04:33,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:04:35,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:04:36,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:04:38,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:04:41,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:04:42,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:04:44,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 572 [2023-08-29 22:04:44,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 123 transitions, 1067 flow. Second operand has 21 states, 21 states have (on average 168.61904761904762) internal successors, (3541), 21 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-29 22:04:44,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:04:44,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 572 [2023-08-29 22:04:44,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:04:50,240 WARN L222 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 21 DAG size of output: 19 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 22:04:50,786 INFO L130 PetriNetUnfolder]: 763/1780 cut-off events. [2023-08-29 22:04:50,786 INFO L131 PetriNetUnfolder]: For 28364/28380 co-relation queries the response was YES. [2023-08-29 22:04:50,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10607 conditions, 1780 events. 763/1780 cut-off events. For 28364/28380 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 12865 event pairs, 160 based on Foata normal form. 18/1689 useless extension candidates. Maximal degree in co-relation 10518. Up to 840 conditions per place. [2023-08-29 22:04:50,796 INFO L137 encePairwiseOnDemand]: 560/572 looper letters, 133 selfloop transitions, 35 changer transitions 13/191 dead transitions. [2023-08-29 22:04:50,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 191 transitions, 2241 flow [2023-08-29 22:04:50,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 22:04:50,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 22:04:50,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1747 transitions. [2023-08-29 22:04:50,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3054195804195804 [2023-08-29 22:04:50,798 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1747 transitions. [2023-08-29 22:04:50,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1747 transitions. [2023-08-29 22:04:50,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:04:50,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1747 transitions. [2023-08-29 22:04:50,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 174.7) internal successors, (1747), 10 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:04:50,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 572.0) internal successors, (6292), 11 states have internal predecessors, (6292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:04:50,804 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 572.0) internal successors, (6292), 11 states have internal predecessors, (6292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:04:50,804 INFO L175 Difference]: Start difference. First operand has 156 places, 123 transitions, 1067 flow. Second operand 10 states and 1747 transitions. [2023-08-29 22:04:50,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 191 transitions, 2241 flow [2023-08-29 22:04:50,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 191 transitions, 2096 flow, removed 55 selfloop flow, removed 16 redundant places. [2023-08-29 22:04:50,844 INFO L231 Difference]: Finished difference. Result has 149 places, 135 transitions, 1232 flow [2023-08-29 22:04:50,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=970, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1232, PETRI_PLACES=149, PETRI_TRANSITIONS=135} [2023-08-29 22:04:50,844 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 46 predicate places. [2023-08-29 22:04:50,844 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 135 transitions, 1232 flow [2023-08-29 22:04:50,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 168.61904761904762) internal successors, (3541), 21 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-29 22:04:50,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:04:50,845 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:04:50,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-29 22:04:51,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:04:51,046 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 22:04:51,046 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:04:51,046 INFO L85 PathProgramCache]: Analyzing trace with hash -411036864, now seen corresponding path program 2 times [2023-08-29 22:04:51,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:04:51,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695565814] [2023-08-29 22:04:51,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:04:51,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:04:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:04:51,359 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 22:04:51,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:04:51,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695565814] [2023-08-29 22:04:51,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695565814] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 22:04:51,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703672172] [2023-08-29 22:04:51,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 22:04:51,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:04:51,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 22:04:51,361 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 22:04:51,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-08-29 22:04:51,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 22:04:51,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 22:04:51,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-29 22:04:51,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:04:51,511 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 7 treesize of output 6 [2023-08-29 22:04:51,573 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:04:51,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 22:04:51,592 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 13 treesize of output 15 [2023-08-29 22:04:51,658 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 25 [2023-08-29 22:04:51,720 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 48 treesize of output 41 [2023-08-29 22:04:51,741 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 13 treesize of output 15 [2023-08-29 22:04:51,769 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 22:04:51,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 22:04:59,817 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1768 (Array Int Int)) (|t_funThread2of2ForFork0_~i~0#1| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1768) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* 28 |t_funThread2of2ForFork0_~i~0#1|))) 0)) is different from false [2023-08-29 22:04:59,830 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1768 (Array Int Int)) (|t_funThread2of2ForFork0_~i~0#1| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) (+ (- 1) |c_t_funThread1of2ForFork0_#t~mem38#1|))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1768) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* 28 |t_funThread2of2ForFork0_~i~0#1|))) 0)) is different from false [2023-08-29 22:04:59,838 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1768 (Array Int Int)) (|t_funThread2of2ForFork0_~i~0#1| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1768) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* 28 |t_funThread2of2ForFork0_~i~0#1|))) 0)) is different from false [2023-08-29 22:04:59,854 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1768 (Array Int Int)) (|t_funThread2of2ForFork0_~i~0#1| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) |c_t_funThread1of2ForFork0_#t~mem35#1|)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1768) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* 28 |t_funThread2of2ForFork0_~i~0#1|))) 0)) is different from false [2023-08-29 22:05:01,860 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1768 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1768) |c_~#a~0.base|) (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|)) 0)) is different from false [2023-08-29 22:05:01,888 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1768 (Array Int Int)) (v_ArrVal_1763 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1763))) (store .cse0 |c_~#a~0.base| (let ((.cse1 (select .cse0 |c_~#a~0.base|)) (.cse2 (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1768) |c_~#a~0.base|) (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|)) 0)) is different from false [2023-08-29 22:05:02,017 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-29 22:05:02,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703672172] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 22:05:02,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 22:05:02,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 8] total 20 [2023-08-29 22:05:02,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997715296] [2023-08-29 22:05:02,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 22:05:02,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-29 22:05:02,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:05:02,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-29 22:05:02,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=179, Unknown=10, NotChecked=198, Total=462 [2023-08-29 22:05:02,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 572 [2023-08-29 22:05:02,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 135 transitions, 1232 flow. Second operand has 22 states, 22 states have (on average 168.77272727272728) internal successors, (3713), 22 states have internal predecessors, (3713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:05:02,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:05:02,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 572 [2023-08-29 22:05:02,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:05:08,293 WARN L222 SmtUtils]: Spent 6.06s on a formula simplification. DAG size of input: 36 DAG size of output: 32 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 22:05:10,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 [1] [2023-08-29 22:05:10,785 INFO L130 PetriNetUnfolder]: 1099/2636 cut-off events. [2023-08-29 22:05:10,786 INFO L131 PetriNetUnfolder]: For 35643/35681 co-relation queries the response was YES. [2023-08-29 22:05:10,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15541 conditions, 2636 events. 1099/2636 cut-off events. For 35643/35681 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 21433 event pairs, 413 based on Foata normal form. 9/2451 useless extension candidates. Maximal degree in co-relation 15462. Up to 1025 conditions per place. [2023-08-29 22:05:10,799 INFO L137 encePairwiseOnDemand]: 561/572 looper letters, 111 selfloop transitions, 6 changer transitions 97/224 dead transitions. [2023-08-29 22:05:10,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 224 transitions, 2773 flow [2023-08-29 22:05:10,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 22:05:10,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 22:05:10,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1399 transitions. [2023-08-29 22:05:10,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3057255244755245 [2023-08-29 22:05:10,801 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1399 transitions. [2023-08-29 22:05:10,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1399 transitions. [2023-08-29 22:05:10,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:05:10,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1399 transitions. [2023-08-29 22:05:10,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 174.875) internal successors, (1399), 8 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:05:10,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 572.0) internal successors, (5148), 9 states have internal predecessors, (5148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:05:10,804 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 572.0) internal successors, (5148), 9 states have internal predecessors, (5148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:05:10,804 INFO L175 Difference]: Start difference. First operand has 149 places, 135 transitions, 1232 flow. Second operand 8 states and 1399 transitions. [2023-08-29 22:05:10,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 224 transitions, 2773 flow [2023-08-29 22:05:10,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 224 transitions, 2584 flow, removed 67 selfloop flow, removed 6 redundant places. [2023-08-29 22:05:10,858 INFO L231 Difference]: Finished difference. Result has 154 places, 124 transitions, 1072 flow [2023-08-29 22:05:10,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1072, PETRI_PLACES=154, PETRI_TRANSITIONS=124} [2023-08-29 22:05:10,858 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 51 predicate places. [2023-08-29 22:05:10,858 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 124 transitions, 1072 flow [2023-08-29 22:05:10,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 168.77272727272728) internal successors, (3713), 22 states have internal predecessors, (3713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:05:10,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:05:10,859 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:05:10,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-08-29 22:05:11,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:05:11,060 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 22:05:11,060 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:05:11,060 INFO L85 PathProgramCache]: Analyzing trace with hash -2111462747, now seen corresponding path program 1 times [2023-08-29 22:05:11,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:05:11,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767798679] [2023-08-29 22:05:11,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:05:11,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:05:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:05:11,417 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 22:05:11,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:05:11,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767798679] [2023-08-29 22:05:11,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767798679] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 22:05:11,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849822959] [2023-08-29 22:05:11,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:05:11,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:05:11,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 22:05:11,419 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 22:05:11,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-08-29 22:05:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:05:11,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-29 22:05:11,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:05:11,608 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 7 treesize of output 6 [2023-08-29 22:05:11,652 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:05:11,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 22:05:11,671 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 13 treesize of output 15 [2023-08-29 22:05:11,690 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 13 treesize of output 15 [2023-08-29 22:05:11,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-08-29 22:05:11,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2023-08-29 22:05:11,846 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 22:05:11,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 22:05:27,411 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 22:05:27,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849822959] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 22:05:27,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 22:05:27,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2023-08-29 22:05:27,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200670809] [2023-08-29 22:05:27,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 22:05:27,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-29 22:05:27,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:05:27,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-29 22:05:27,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=404, Unknown=9, NotChecked=0, Total=506 [2023-08-29 22:05:28,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:05:30,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:05:32,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:05:34,346 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-29 22:05:36,621 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-29 22:05:38,651 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-29 22:05:40,842 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-29 22:05:43,036 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-29 22:05:44,419 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 [1] [2023-08-29 22:05:46,444 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-29 22:05:47,829 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 [1] [2023-08-29 22:05:50,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-29 22:05:52,254 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-29 22:05:54,450 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-29 22:05:56,483 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-29 22:05:58,517 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-29 22:06:00,547 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-29 22:06:02,581 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-29 22:06:04,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:06:05,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:06:07,428 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-29 22:06:09,703 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-29 22:06:11,882 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-29 22:06:13,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-29 22:06:16,253 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-29 22:06:18,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:06:20,551 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-29 22:06:21,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:06:24,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:06:25,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:06:27,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:06:30,052 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-29 22:06:31,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:06:33,359 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-29 22:06:34,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:06:36,769 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-29 22:06:38,884 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-29 22:06:40,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:06:42,392 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-29 22:06:43,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:06:45,762 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-29 22:06:47,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:06:49,647 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-29 22:06:50,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:06:52,935 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-29 22:06:54,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:06:56,515 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-29 22:06:58,716 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-29 22:07:00,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:07:02,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:07:04,447 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-29 22:07:05,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:07:08,053 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-29 22:07:09,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:07:11,662 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-29 22:07:12,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:07:14,917 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-29 22:07:17,098 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-29 22:07:19,471 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-29 22:07:20,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:07:23,021 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-29 22:07:24,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:07:24,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 572 [2023-08-29 22:07:24,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 124 transitions, 1072 flow. Second operand has 23 states, 23 states have (on average 168.2608695652174) internal successors, (3870), 23 states have internal predecessors, (3870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:07:24,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:07:24,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 572 [2023-08-29 22:07:24,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:07:25,099 INFO L130 PetriNetUnfolder]: 563/1419 cut-off events. [2023-08-29 22:07:25,100 INFO L131 PetriNetUnfolder]: For 14131/14149 co-relation queries the response was YES. [2023-08-29 22:07:25,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7702 conditions, 1419 events. 563/1419 cut-off events. For 14131/14149 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10406 event pairs, 146 based on Foata normal form. 18/1355 useless extension candidates. Maximal degree in co-relation 7619. Up to 789 conditions per place. [2023-08-29 22:07:25,108 INFO L137 encePairwiseOnDemand]: 560/572 looper letters, 119 selfloop transitions, 34 changer transitions 16/179 dead transitions. [2023-08-29 22:07:25,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 179 transitions, 2001 flow [2023-08-29 22:07:25,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-29 22:07:25,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-29 22:07:25,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2253 transitions. [2023-08-29 22:07:25,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3029854760623991 [2023-08-29 22:07:25,111 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2253 transitions. [2023-08-29 22:07:25,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2253 transitions. [2023-08-29 22:07:25,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:07:25,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2253 transitions. [2023-08-29 22:07:25,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 173.30769230769232) internal successors, (2253), 13 states have internal predecessors, (2253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:07:25,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 572.0) internal successors, (8008), 14 states have internal predecessors, (8008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:07:25,116 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 572.0) internal successors, (8008), 14 states have internal predecessors, (8008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:07:25,116 INFO L175 Difference]: Start difference. First operand has 154 places, 124 transitions, 1072 flow. Second operand 13 states and 2253 transitions. [2023-08-29 22:07:25,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 179 transitions, 2001 flow [2023-08-29 22:07:25,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 179 transitions, 1908 flow, removed 37 selfloop flow, removed 8 redundant places. [2023-08-29 22:07:25,138 INFO L231 Difference]: Finished difference. Result has 157 places, 137 transitions, 1300 flow [2023-08-29 22:07:25,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1300, PETRI_PLACES=157, PETRI_TRANSITIONS=137} [2023-08-29 22:07:25,139 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 54 predicate places. [2023-08-29 22:07:25,139 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 137 transitions, 1300 flow [2023-08-29 22:07:25,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 168.2608695652174) internal successors, (3870), 23 states have internal predecessors, (3870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:07:25,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:07:25,140 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:07:25,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-08-29 22:07:25,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-08-29 22:07:25,341 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 22:07:25,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:07:25,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1485106694, now seen corresponding path program 3 times [2023-08-29 22:07:25,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:07:25,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620140879] [2023-08-29 22:07:25,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:07:25,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:07:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:07:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 22:07:25,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:07:25,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620140879] [2023-08-29 22:07:25,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620140879] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 22:07:25,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442926934] [2023-08-29 22:07:25,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 22:07:25,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:07:25,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 22:07:25,649 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 22:07:25,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-08-29 22:07:25,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-29 22:07:25,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 22:07:25,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-29 22:07:25,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:07:25,876 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 7 treesize of output 6 [2023-08-29 22:07:25,946 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:07:25,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 22:07:25,971 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 13 treesize of output 15 [2023-08-29 22:07:26,037 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 24 treesize of output 24 [2023-08-29 22:07:26,084 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 25 [2023-08-29 22:07:26,173 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 48 treesize of output 41 [2023-08-29 22:07:26,202 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 13 treesize of output 15 [2023-08-29 22:07:26,221 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 22:07:26,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... Killed by 15