./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.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_72-funloop_hard_racing.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 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 --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:48:30,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 21:48:30,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 21:48:30,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 21:48:30,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 21:48:30,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 21:48:30,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 21:48:30,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 21:48:30,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 21:48:30,588 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 21:48:30,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 21:48:30,590 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 21:48:30,590 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 21:48:30,592 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 21:48:30,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 21:48:30,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 21:48:30,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 21:48:30,596 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 21:48:30,598 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 21:48:30,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 21:48:30,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 21:48:30,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 21:48:30,613 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 21:48:30,614 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 21:48:30,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 21:48:30,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 21:48:30,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 21:48:30,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 21:48:30,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 21:48:30,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 21:48:30,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 21:48:30,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 21:48:30,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 21:48:30,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 21:48:30,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 21:48:30,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 21:48:30,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 21:48:30,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 21:48:30,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 21:48:30,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 21:48:30,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 21:48:30,628 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:48:30,656 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 21:48:30,656 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 21:48:30,657 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 21:48:30,657 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 21:48:30,658 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 21:48:30,658 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 21:48:30,659 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 21:48:30,659 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 21:48:30,659 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 21:48:30,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 21:48:30,660 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 21:48:30,660 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 21:48:30,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 21:48:30,660 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 21:48:30,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 21:48:30,660 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 21:48:30,661 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 21:48:30,661 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 21:48:30,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 21:48:30,661 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 21:48:30,661 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 21:48:30,661 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 21:48:30,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 21:48:30,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 21:48:30,662 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 21:48:30,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 21:48:30,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 21:48:30,662 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 21:48:30,662 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 21:48:30,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 21:48:30,663 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 21:48:30,663 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 21:48:30,663 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 21:48:30,663 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 21:48:30,663 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 -> 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 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:48:30,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 21:48:30,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 21:48:30,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 21:48:30,917 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 21:48:30,918 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 21:48:30,918 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2023-08-29 21:48:31,917 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 21:48:32,130 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 21:48:32,131 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2023-08-29 21:48:32,148 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73bcd7073/995e90524d0041b383eecc341b63c86f/FLAGad8868946 [2023-08-29 21:48:32,160 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73bcd7073/995e90524d0041b383eecc341b63c86f [2023-08-29 21:48:32,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 21:48:32,163 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 21:48:32,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 21:48:32,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 21:48:32,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 21:48:32,166 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 09:48:32" (1/1) ... [2023-08-29 21:48:32,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2276f6eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:32, skipping insertion in model container [2023-08-29 21:48:32,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 09:48:32" (1/1) ... [2023-08-29 21:48:32,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 21:48:32,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 21:48:32,529 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_72-funloop_hard_racing.i[41323,41336] [2023-08-29 21:48:32,563 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 21:48:32,574 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 21:48:32,593 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_72-funloop_hard_racing.i[41323,41336] [2023-08-29 21:48:32,602 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 21:48:32,655 INFO L208 MainTranslator]: Completed translation [2023-08-29 21:48:32,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:32 WrapperNode [2023-08-29 21:48:32,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 21:48:32,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 21:48:32,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 21:48:32,656 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 21:48:32,660 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:48:32" (1/1) ... [2023-08-29 21:48:32,674 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:48:32" (1/1) ... [2023-08-29 21:48:32,701 INFO L138 Inliner]: procedures = 271, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 250 [2023-08-29 21:48:32,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 21:48:32,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 21:48:32,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 21:48:32,704 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 21:48:32,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:32" (1/1) ... [2023-08-29 21:48:32,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:32" (1/1) ... [2023-08-29 21:48:32,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:32" (1/1) ... [2023-08-29 21:48:32,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:32" (1/1) ... [2023-08-29 21:48:32,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:32" (1/1) ... [2023-08-29 21:48:32,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:32" (1/1) ... [2023-08-29 21:48:32,756 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:32" (1/1) ... [2023-08-29 21:48:32,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:32" (1/1) ... [2023-08-29 21:48:32,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 21:48:32,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 21:48:32,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 21:48:32,759 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 21:48:32,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:32" (1/1) ... [2023-08-29 21:48:32,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 21:48:32,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:48:32,786 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:48:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 21:48:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 21:48:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 21:48:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 21:48:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-29 21:48:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 21:48:32,815 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-29 21:48:32,815 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-29 21:48:32,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 21:48:32,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 21:48:32,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 21:48:32,817 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:48:32,792 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:48:32,926 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 21:48:32,927 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 21:48:33,247 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 21:48:33,253 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 21:48:33,256 INFO L302 CfgBuilder]: Removed 35 assume(true) statements. [2023-08-29 21:48:33,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 09:48:33 BoogieIcfgContainer [2023-08-29 21:48:33,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 21:48:33,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 21:48:33,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 21:48:33,262 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 21:48:33,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 09:48:32" (1/3) ... [2023-08-29 21:48:33,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc38679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 09:48:33, skipping insertion in model container [2023-08-29 21:48:33,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:32" (2/3) ... [2023-08-29 21:48:33,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc38679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 09:48:33, skipping insertion in model container [2023-08-29 21:48:33,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 09:48:33" (3/3) ... [2023-08-29 21:48:33,264 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2023-08-29 21:48:33,275 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 21:48:33,275 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2023-08-29 21:48:33,275 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 21:48:33,346 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-29 21:48:33,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 284 transitions, 576 flow [2023-08-29 21:48:33,458 INFO L130 PetriNetUnfolder]: 73/446 cut-off events. [2023-08-29 21:48:33,458 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 21:48:33,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 446 events. 73/446 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2298 event pairs, 0 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 246. Up to 8 conditions per place. [2023-08-29 21:48:33,464 INFO L82 GeneralOperation]: Start removeDead. Operand has 242 places, 284 transitions, 576 flow [2023-08-29 21:48:33,469 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 242 places, 284 transitions, 576 flow [2023-08-29 21:48:33,471 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 21:48:33,477 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 242 places, 284 transitions, 576 flow [2023-08-29 21:48:33,478 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 242 places, 284 transitions, 576 flow [2023-08-29 21:48:33,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 284 transitions, 576 flow [2023-08-29 21:48:33,522 INFO L130 PetriNetUnfolder]: 73/446 cut-off events. [2023-08-29 21:48:33,522 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 21:48:33,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 446 events. 73/446 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2298 event pairs, 0 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 246. Up to 8 conditions per place. [2023-08-29 21:48:33,533 INFO L119 LiptonReduction]: Number of co-enabled transitions 26544 [2023-08-29 21:48:36,869 INFO L134 LiptonReduction]: Checked pairs total: 53426 [2023-08-29 21:48:36,870 INFO L136 LiptonReduction]: Total number of compositions: 259 [2023-08-29 21:48:36,879 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 21:48:36,883 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;@4fbbd257, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 21:48:36,883 INFO L358 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2023-08-29 21:48:36,885 INFO L130 PetriNetUnfolder]: 1/5 cut-off events. [2023-08-29 21:48:36,885 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 21:48:36,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:48:36,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 21:48:36,886 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:48:36,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:48:36,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1105630, now seen corresponding path program 1 times [2023-08-29 21:48:36,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:48:36,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753903843] [2023-08-29 21:48:36,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:36,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:48:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:37,077 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:48:37,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:48:37,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753903843] [2023-08-29 21:48:37,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753903843] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:48:37,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:48:37,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 21:48:37,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330190911] [2023-08-29 21:48:37,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:48:37,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:48:37,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:48:37,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:48:37,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 21:48:37,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 543 [2023-08-29 21:48:37,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 134 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states 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:48:37,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:48:37,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 543 [2023-08-29 21:48:37,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:48:37,406 INFO L130 PetriNetUnfolder]: 1102/2408 cut-off events. [2023-08-29 21:48:37,406 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 21:48:37,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4486 conditions, 2408 events. 1102/2408 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 17546 event pairs, 940 based on Foata normal form. 184/1699 useless extension candidates. Maximal degree in co-relation 4358. Up to 2070 conditions per place. [2023-08-29 21:48:37,414 INFO L137 encePairwiseOnDemand]: 499/543 looper letters, 74 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2023-08-29 21:48:37,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 94 transitions, 348 flow [2023-08-29 21:48:37,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:48:37,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:48:37,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 829 transitions. [2023-08-29 21:48:37,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5089011663597299 [2023-08-29 21:48:37,429 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 829 transitions. [2023-08-29 21:48:37,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 829 transitions. [2023-08-29 21:48:37,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:48:37,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 829 transitions. [2023-08-29 21:48:37,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 0 states have call successors, (0), 0 states 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:48:37,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 543.0) internal successors, (2172), 4 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states 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:48:37,444 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 543.0) internal successors, (2172), 4 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states 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:48:37,445 INFO L175 Difference]: Start difference. First operand has 99 places, 134 transitions, 276 flow. Second operand 3 states and 829 transitions. [2023-08-29 21:48:37,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 94 transitions, 348 flow [2023-08-29 21:48:37,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 94 transitions, 348 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 21:48:37,451 INFO L231 Difference]: Finished difference. Result has 92 places, 94 transitions, 206 flow [2023-08-29 21:48:37,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=92, PETRI_TRANSITIONS=94} [2023-08-29 21:48:37,455 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -7 predicate places. [2023-08-29 21:48:37,456 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 94 transitions, 206 flow [2023-08-29 21:48:37,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states 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:48:37,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:48:37,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 21:48:37,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 21:48:37,457 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:48:37,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:48:37,458 INFO L85 PathProgramCache]: Analyzing trace with hash 34306258, now seen corresponding path program 1 times [2023-08-29 21:48:37,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:48:37,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480172750] [2023-08-29 21:48:37,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:37,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:48:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:37,557 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:48:37,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:48:37,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480172750] [2023-08-29 21:48:37,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480172750] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:48:37,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503731232] [2023-08-29 21:48:37,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:37,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:48:37,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:48:37,565 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:48:37,573 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:48:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:37,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 21:48:37,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:48:37,662 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:48:37,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:48:37,695 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:48:37,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503731232] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:48:37,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:48:37,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 21:48:37,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567391316] [2023-08-29 21:48:37,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:48:37,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 21:48:37,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:48:37,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 21:48:37,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 21:48:37,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 543 [2023-08-29 21:48:37,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 94 transitions, 206 flow. Second operand has 7 states, 7 states have (on average 237.28571428571428) internal successors, (1661), 7 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states 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:48:37,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:48:37,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 543 [2023-08-29 21:48:37,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:48:37,977 INFO L130 PetriNetUnfolder]: 1102/2411 cut-off events. [2023-08-29 21:48:37,977 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 21:48:37,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4502 conditions, 2411 events. 1102/2411 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 17503 event pairs, 940 based on Foata normal form. 0/1518 useless extension candidates. Maximal degree in co-relation 4490. Up to 2070 conditions per place. [2023-08-29 21:48:37,984 INFO L137 encePairwiseOnDemand]: 540/543 looper letters, 74 selfloop transitions, 5 changer transitions 0/97 dead transitions. [2023-08-29 21:48:37,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 97 transitions, 376 flow [2023-08-29 21:48:37,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 21:48:37,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 21:48:37,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1498 transitions. [2023-08-29 21:48:37,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4597912829957029 [2023-08-29 21:48:37,987 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1498 transitions. [2023-08-29 21:48:37,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1498 transitions. [2023-08-29 21:48:37,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:48:37,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1498 transitions. [2023-08-29 21:48:37,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 249.66666666666666) internal successors, (1498), 6 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states 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:48:37,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 543.0) internal successors, (3801), 7 states have internal predecessors, (3801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:37,995 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 543.0) internal successors, (3801), 7 states have internal predecessors, (3801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:37,995 INFO L175 Difference]: Start difference. First operand has 92 places, 94 transitions, 206 flow. Second operand 6 states and 1498 transitions. [2023-08-29 21:48:37,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 97 transitions, 376 flow [2023-08-29 21:48:37,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 97 transitions, 372 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 21:48:37,999 INFO L231 Difference]: Finished difference. Result has 99 places, 97 transitions, 238 flow [2023-08-29 21:48:37,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=99, PETRI_TRANSITIONS=97} [2023-08-29 21:48:38,000 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 0 predicate places. [2023-08-29 21:48:38,000 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 97 transitions, 238 flow [2023-08-29 21:48:38,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 237.28571428571428) internal successors, (1661), 7 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states 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:48:38,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:48:38,001 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-29 21:48:38,010 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:48:38,208 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:48:38,209 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:48:38,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:48:38,209 INFO L85 PathProgramCache]: Analyzing trace with hash -152978466, now seen corresponding path program 2 times [2023-08-29 21:48:38,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:48:38,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163387649] [2023-08-29 21:48:38,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:38,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:48:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:38,301 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:48:38,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:48:38,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163387649] [2023-08-29 21:48:38,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163387649] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:48:38,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977884764] [2023-08-29 21:48:38,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 21:48:38,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:48:38,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:48:38,305 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:48:38,307 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:48:38,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 21:48:38,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:48:38,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 21:48:38,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:48:38,397 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:48:38,407 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:48:38,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 21:48:38,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977884764] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:48:38,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 21:48:38,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2023-08-29 21:48:38,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045497900] [2023-08-29 21:48:38,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:48:38,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:48:38,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:48:38,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:48:38,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-29 21:48:38,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 543 [2023-08-29 21:48:38,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 97 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 states 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:48:38,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:48:38,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 543 [2023-08-29 21:48:38,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:48:38,686 INFO L130 PetriNetUnfolder]: 1053/2271 cut-off events. [2023-08-29 21:48:38,687 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 21:48:38,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4354 conditions, 2271 events. 1053/2271 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 16982 event pairs, 0 based on Foata normal form. 0/1481 useless extension candidates. Maximal degree in co-relation 4320. Up to 2009 conditions per place. [2023-08-29 21:48:38,694 INFO L137 encePairwiseOnDemand]: 539/543 looper letters, 100 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2023-08-29 21:48:38,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 120 transitions, 488 flow [2023-08-29 21:48:38,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:48:38,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:48:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 808 transitions. [2023-08-29 21:48:38,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4960098219766728 [2023-08-29 21:48:38,696 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 808 transitions. [2023-08-29 21:48:38,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 808 transitions. [2023-08-29 21:48:38,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:48:38,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 808 transitions. [2023-08-29 21:48:38,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 0 states 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:48:38,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 543.0) internal successors, (2172), 4 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states 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:48:38,700 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 543.0) internal successors, (2172), 4 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states 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:48:38,700 INFO L175 Difference]: Start difference. First operand has 99 places, 97 transitions, 238 flow. Second operand 3 states and 808 transitions. [2023-08-29 21:48:38,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 120 transitions, 488 flow [2023-08-29 21:48:38,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 120 transitions, 474 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-29 21:48:38,705 INFO L231 Difference]: Finished difference. Result has 101 places, 97 transitions, 234 flow [2023-08-29 21:48:38,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=101, PETRI_TRANSITIONS=97} [2023-08-29 21:48:38,706 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 2 predicate places. [2023-08-29 21:48:38,706 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 97 transitions, 234 flow [2023-08-29 21:48:38,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 states 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:48:38,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:48:38,707 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-29 21:48:38,715 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:48:38,911 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,SelfDestructingSolverStorable2 [2023-08-29 21:48:38,911 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:48:38,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:48:38,911 INFO L85 PathProgramCache]: Analyzing trace with hash -152978465, now seen corresponding path program 1 times [2023-08-29 21:48:38,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:48:38,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152244826] [2023-08-29 21:48:38,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:38,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:48:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:38,972 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:48:38,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:48:38,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152244826] [2023-08-29 21:48:38,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152244826] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:48:38,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:48:38,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 21:48:38,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671651812] [2023-08-29 21:48:38,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:48:38,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:48:38,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:48:38,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:48:38,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 21:48:39,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 543 [2023-08-29 21:48:39,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 97 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states 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:48:39,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:48:39,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 543 [2023-08-29 21:48:39,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:48:39,226 INFO L130 PetriNetUnfolder]: 1050/2235 cut-off events. [2023-08-29 21:48:39,226 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2023-08-29 21:48:39,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4293 conditions, 2235 events. 1050/2235 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 15923 event pairs, 860 based on Foata normal form. 0/1479 useless extension candidates. Maximal degree in co-relation 4264. Up to 1855 conditions per place. [2023-08-29 21:48:39,233 INFO L137 encePairwiseOnDemand]: 538/543 looper letters, 95 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2023-08-29 21:48:39,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 116 transitions, 468 flow [2023-08-29 21:48:39,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:48:39,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:48:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2023-08-29 21:48:39,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880294659300184 [2023-08-29 21:48:39,235 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 795 transitions. [2023-08-29 21:48:39,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 795 transitions. [2023-08-29 21:48:39,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:48:39,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 795 transitions. [2023-08-29 21:48:39,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:39,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 543.0) internal successors, (2172), 4 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states 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:48:39,240 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 543.0) internal successors, (2172), 4 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states 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:48:39,240 INFO L175 Difference]: Start difference. First operand has 101 places, 97 transitions, 234 flow. Second operand 3 states and 795 transitions. [2023-08-29 21:48:39,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 116 transitions, 468 flow [2023-08-29 21:48:39,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 116 transitions, 464 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 21:48:39,242 INFO L231 Difference]: Finished difference. Result has 99 places, 95 transitions, 232 flow [2023-08-29 21:48:39,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=99, PETRI_TRANSITIONS=95} [2023-08-29 21:48:39,243 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 0 predicate places. [2023-08-29 21:48:39,243 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 95 transitions, 232 flow [2023-08-29 21:48:39,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states 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:48:39,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:48:39,244 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-08-29 21:48:39,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 21:48:39,244 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:48:39,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:48:39,244 INFO L85 PathProgramCache]: Analyzing trace with hash -420381068, now seen corresponding path program 1 times [2023-08-29 21:48:39,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:48:39,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860640578] [2023-08-29 21:48:39,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:39,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:48:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 21:48:39,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:48:39,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860640578] [2023-08-29 21:48:39,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860640578] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:48:39,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007635139] [2023-08-29 21:48:39,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:39,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:48:39,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:48:39,322 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:48:39,325 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:48:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:39,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 21:48:39,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:48:39,400 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 21:48:39,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:48:39,438 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 21:48:39,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007635139] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:48:39,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:48:39,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-29 21:48:39,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248828826] [2023-08-29 21:48:39,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:48:39,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 21:48:39,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:48:39,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 21:48:39,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-29 21:48:39,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 543 [2023-08-29 21:48:39,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 95 transitions, 232 flow. Second operand has 13 states, 13 states have (on average 237.3846153846154) internal successors, (3086), 13 states have internal predecessors, (3086), 0 states have call successors, (0), 0 states 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:48:39,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:48:39,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 543 [2023-08-29 21:48:39,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:48:39,676 INFO L130 PetriNetUnfolder]: 1052/2243 cut-off events. [2023-08-29 21:48:39,676 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2023-08-29 21:48:39,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4342 conditions, 2243 events. 1052/2243 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 15945 event pairs, 900 based on Foata normal form. 6/1514 useless extension candidates. Maximal degree in co-relation 4289. Up to 1944 conditions per place. [2023-08-29 21:48:39,685 INFO L137 encePairwiseOnDemand]: 540/543 looper letters, 72 selfloop transitions, 11 changer transitions 0/101 dead transitions. [2023-08-29 21:48:39,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 101 transitions, 434 flow [2023-08-29 21:48:39,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 21:48:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 21:48:39,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2921 transitions. [2023-08-29 21:48:39,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44828115408225905 [2023-08-29 21:48:39,701 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2921 transitions. [2023-08-29 21:48:39,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2921 transitions. [2023-08-29 21:48:39,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:48:39,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2921 transitions. [2023-08-29 21:48:39,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 243.41666666666666) internal successors, (2921), 12 states have internal predecessors, (2921), 0 states have call successors, (0), 0 states 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:48:39,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 543.0) internal successors, (7059), 13 states have internal predecessors, (7059), 0 states have call successors, (0), 0 states 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:48:39,714 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 543.0) internal successors, (7059), 13 states have internal predecessors, (7059), 0 states have call successors, (0), 0 states 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:48:39,714 INFO L175 Difference]: Start difference. First operand has 99 places, 95 transitions, 232 flow. Second operand 12 states and 2921 transitions. [2023-08-29 21:48:39,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 101 transitions, 434 flow [2023-08-29 21:48:39,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 101 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 21:48:39,717 INFO L231 Difference]: Finished difference. Result has 114 places, 101 transitions, 310 flow [2023-08-29 21:48:39,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=310, PETRI_PLACES=114, PETRI_TRANSITIONS=101} [2023-08-29 21:48:39,717 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 15 predicate places. [2023-08-29 21:48:39,718 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 101 transitions, 310 flow [2023-08-29 21:48:39,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 237.3846153846154) internal successors, (3086), 13 states have internal predecessors, (3086), 0 states have call successors, (0), 0 states 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:48:39,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:48:39,719 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-08-29 21:48:39,730 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:48:39,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:48:39,924 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:48:39,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:48:39,924 INFO L85 PathProgramCache]: Analyzing trace with hash -410340620, now seen corresponding path program 2 times [2023-08-29 21:48:39,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:48:39,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654693583] [2023-08-29 21:48:39,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:39,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:48:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:40,008 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:48:40,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:48:40,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654693583] [2023-08-29 21:48:40,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654693583] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:48:40,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786322412] [2023-08-29 21:48:40,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 21:48:40,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:48:40,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:48:40,013 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:48:40,015 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:48:40,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 21:48:40,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:48:40,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 21:48:40,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:48:40,086 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:48:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:48:40,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 21:48:40,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786322412] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:48:40,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 21:48:40,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-29 21:48:40,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997872303] [2023-08-29 21:48:40,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:48:40,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 21:48:40,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:48:40,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 21:48:40,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-29 21:48:40,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 543 [2023-08-29 21:48:40,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 101 transitions, 310 flow. Second operand has 4 states, 4 states have (on average 236.75) internal successors, (947), 4 states have internal predecessors, (947), 0 states have call successors, (0), 0 states 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:48:40,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:48:40,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 543 [2023-08-29 21:48:40,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:48:40,410 INFO L130 PetriNetUnfolder]: 1030/2189 cut-off events. [2023-08-29 21:48:40,410 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2023-08-29 21:48:40,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4215 conditions, 2189 events. 1030/2189 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 15449 event pairs, 574 based on Foata normal form. 0/1441 useless extension candidates. Maximal degree in co-relation 4138. Up to 1789 conditions per place. [2023-08-29 21:48:40,422 INFO L137 encePairwiseOnDemand]: 538/543 looper letters, 121 selfloop transitions, 4 changer transitions 0/143 dead transitions. [2023-08-29 21:48:40,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 143 transitions, 642 flow [2023-08-29 21:48:40,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 21:48:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 21:48:40,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1056 transitions. [2023-08-29 21:48:40,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861878453038674 [2023-08-29 21:48:40,425 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1056 transitions. [2023-08-29 21:48:40,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1056 transitions. [2023-08-29 21:48:40,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:48:40,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1056 transitions. [2023-08-29 21:48:40,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states 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:48:40,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 543.0) internal successors, (2715), 5 states have internal predecessors, (2715), 0 states have call successors, (0), 0 states 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:48:40,430 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 543.0) internal successors, (2715), 5 states have internal predecessors, (2715), 0 states have call successors, (0), 0 states 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:48:40,430 INFO L175 Difference]: Start difference. First operand has 114 places, 101 transitions, 310 flow. Second operand 4 states and 1056 transitions. [2023-08-29 21:48:40,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 143 transitions, 642 flow [2023-08-29 21:48:40,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 143 transitions, 594 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-29 21:48:40,433 INFO L231 Difference]: Finished difference. Result has 111 places, 100 transitions, 266 flow [2023-08-29 21:48:40,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=266, PETRI_PLACES=111, PETRI_TRANSITIONS=100} [2023-08-29 21:48:40,435 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 12 predicate places. [2023-08-29 21:48:40,435 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 100 transitions, 266 flow [2023-08-29 21:48:40,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 236.75) internal successors, (947), 4 states have internal predecessors, (947), 0 states have call successors, (0), 0 states 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:48:40,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:48:40,438 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:48:40,448 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:48:40,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:48:40,645 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:48:40,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:48:40,645 INFO L85 PathProgramCache]: Analyzing trace with hash 799200132, now seen corresponding path program 1 times [2023-08-29 21:48:40,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:48:40,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448270075] [2023-08-29 21:48:40,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:40,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:48:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:40,822 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:48:40,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:48:40,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448270075] [2023-08-29 21:48:40,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448270075] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:48:40,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:48:40,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 21:48:40,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990832711] [2023-08-29 21:48:40,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:48:40,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 21:48:40,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:48:40,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 21:48:40,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 21:48:41,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 543 [2023-08-29 21:48:41,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 100 transitions, 266 flow. Second operand has 7 states, 7 states have (on average 209.28571428571428) internal successors, (1465), 7 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states 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:48:41,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:48:41,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 543 [2023-08-29 21:48:41,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:48:41,749 INFO L130 PetriNetUnfolder]: 1679/3674 cut-off events. [2023-08-29 21:48:41,749 INFO L131 PetriNetUnfolder]: For 181/181 co-relation queries the response was YES. [2023-08-29 21:48:41,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7066 conditions, 3674 events. 1679/3674 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 28723 event pairs, 825 based on Foata normal form. 118/2707 useless extension candidates. Maximal degree in co-relation 7013. Up to 1603 conditions per place. [2023-08-29 21:48:41,763 INFO L137 encePairwiseOnDemand]: 526/543 looper letters, 238 selfloop transitions, 18 changer transitions 0/273 dead transitions. [2023-08-29 21:48:41,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 273 transitions, 1154 flow [2023-08-29 21:48:41,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 21:48:41,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 21:48:41,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2358 transitions. [2023-08-29 21:48:41,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43425414364640885 [2023-08-29 21:48:41,768 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2358 transitions. [2023-08-29 21:48:41,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2358 transitions. [2023-08-29 21:48:41,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:48:41,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2358 transitions. [2023-08-29 21:48:41,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 235.8) internal successors, (2358), 10 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states 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:48:41,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 543.0) internal successors, (5973), 11 states have internal predecessors, (5973), 0 states have call successors, (0), 0 states 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:48:41,779 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 543.0) internal successors, (5973), 11 states have internal predecessors, (5973), 0 states have call successors, (0), 0 states 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:48:41,779 INFO L175 Difference]: Start difference. First operand has 111 places, 100 transitions, 266 flow. Second operand 10 states and 2358 transitions. [2023-08-29 21:48:41,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 273 transitions, 1154 flow [2023-08-29 21:48:41,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 273 transitions, 1128 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 21:48:41,783 INFO L231 Difference]: Finished difference. Result has 115 places, 108 transitions, 350 flow [2023-08-29 21:48:41,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=350, PETRI_PLACES=115, PETRI_TRANSITIONS=108} [2023-08-29 21:48:41,784 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 16 predicate places. [2023-08-29 21:48:41,784 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 108 transitions, 350 flow [2023-08-29 21:48:41,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 209.28571428571428) internal successors, (1465), 7 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states 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:48:41,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:48:41,785 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:48:41,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 21:48:41,785 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:48:41,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:48:41,785 INFO L85 PathProgramCache]: Analyzing trace with hash -994605132, now seen corresponding path program 1 times [2023-08-29 21:48:41,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:48:41,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286996076] [2023-08-29 21:48:41,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:41,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:48:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:41,877 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:48:41,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:48:41,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286996076] [2023-08-29 21:48:41,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286996076] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:48:41,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:48:41,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 21:48:41,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620704923] [2023-08-29 21:48:41,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:48:41,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 21:48:41,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:48:41,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 21:48:41,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 21:48:42,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 543 [2023-08-29 21:48:42,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 108 transitions, 350 flow. Second operand has 6 states, 6 states have (on average 212.5) internal successors, (1275), 6 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states 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:48:42,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:48:42,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 543 [2023-08-29 21:48:42,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:48:42,397 INFO L130 PetriNetUnfolder]: 1558/3301 cut-off events. [2023-08-29 21:48:42,398 INFO L131 PetriNetUnfolder]: For 739/739 co-relation queries the response was YES. [2023-08-29 21:48:42,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7367 conditions, 3301 events. 1558/3301 cut-off events. For 739/739 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 24629 event pairs, 37 based on Foata normal form. 0/2745 useless extension candidates. Maximal degree in co-relation 7309. Up to 2706 conditions per place. [2023-08-29 21:48:42,409 INFO L137 encePairwiseOnDemand]: 528/543 looper letters, 146 selfloop transitions, 20 changer transitions 0/179 dead transitions. [2023-08-29 21:48:42,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 179 transitions, 870 flow [2023-08-29 21:48:42,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 21:48:42,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 21:48:42,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1206 transitions. [2023-08-29 21:48:42,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44419889502762433 [2023-08-29 21:48:42,411 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1206 transitions. [2023-08-29 21:48:42,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1206 transitions. [2023-08-29 21:48:42,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:48:42,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1206 transitions. [2023-08-29 21:48:42,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 241.2) internal successors, (1206), 5 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states 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:48:42,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 543.0) internal successors, (3258), 6 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states 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:48:42,417 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 543.0) internal successors, (3258), 6 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states 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:48:42,417 INFO L175 Difference]: Start difference. First operand has 115 places, 108 transitions, 350 flow. Second operand 5 states and 1206 transitions. [2023-08-29 21:48:42,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 179 transitions, 870 flow [2023-08-29 21:48:42,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 179 transitions, 869 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 21:48:42,429 INFO L231 Difference]: Finished difference. Result has 121 places, 118 transitions, 483 flow [2023-08-29 21:48:42,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=483, PETRI_PLACES=121, PETRI_TRANSITIONS=118} [2023-08-29 21:48:42,429 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 22 predicate places. [2023-08-29 21:48:42,430 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 118 transitions, 483 flow [2023-08-29 21:48:42,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 212.5) internal successors, (1275), 6 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states 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:48:42,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:48:42,431 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:48:42,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 21:48:42,431 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:48:42,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:48:42,431 INFO L85 PathProgramCache]: Analyzing trace with hash -994604930, now seen corresponding path program 1 times [2023-08-29 21:48:42,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:48:42,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136891314] [2023-08-29 21:48:42,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:42,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:48:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:42,564 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:48:42,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:48:42,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136891314] [2023-08-29 21:48:42,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136891314] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:48:42,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:48:42,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 21:48:42,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235733094] [2023-08-29 21:48:42,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:48:42,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 21:48:42,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:48:42,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 21:48:42,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 21:48:42,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 543 [2023-08-29 21:48:42,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 118 transitions, 483 flow. Second operand has 6 states, 6 states have (on average 220.5) internal successors, (1323), 6 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states 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:48:42,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:48:42,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 543 [2023-08-29 21:48:42,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:48:43,385 INFO L130 PetriNetUnfolder]: 2241/4916 cut-off events. [2023-08-29 21:48:43,385 INFO L131 PetriNetUnfolder]: For 2509/2582 co-relation queries the response was YES. [2023-08-29 21:48:43,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12299 conditions, 4916 events. 2241/4916 cut-off events. For 2509/2582 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 39656 event pairs, 230 based on Foata normal form. 0/4140 useless extension candidates. Maximal degree in co-relation 12237. Up to 2657 conditions per place. [2023-08-29 21:48:43,404 INFO L137 encePairwiseOnDemand]: 529/543 looper letters, 227 selfloop transitions, 39 changer transitions 1/287 dead transitions. [2023-08-29 21:48:43,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 287 transitions, 1640 flow [2023-08-29 21:48:43,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 21:48:43,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 21:48:43,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1745 transitions. [2023-08-29 21:48:43,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4590897132333596 [2023-08-29 21:48:43,408 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1745 transitions. [2023-08-29 21:48:43,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1745 transitions. [2023-08-29 21:48:43,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:48:43,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1745 transitions. [2023-08-29 21:48:43,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 249.28571428571428) internal successors, (1745), 7 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states 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:48:43,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 543.0) internal successors, (4344), 8 states have internal predecessors, (4344), 0 states have call successors, (0), 0 states 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:48:43,414 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 543.0) internal successors, (4344), 8 states have internal predecessors, (4344), 0 states have call successors, (0), 0 states 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:48:43,415 INFO L175 Difference]: Start difference. First operand has 121 places, 118 transitions, 483 flow. Second operand 7 states and 1745 transitions. [2023-08-29 21:48:43,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 287 transitions, 1640 flow [2023-08-29 21:48:43,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 287 transitions, 1640 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 21:48:43,432 INFO L231 Difference]: Finished difference. Result has 133 places, 155 transitions, 902 flow [2023-08-29 21:48:43,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=902, PETRI_PLACES=133, PETRI_TRANSITIONS=155} [2023-08-29 21:48:43,432 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 34 predicate places. [2023-08-29 21:48:43,433 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 155 transitions, 902 flow [2023-08-29 21:48:43,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 220.5) internal successors, (1323), 6 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states 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:48:43,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:48:43,433 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:48:43,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 21:48:43,433 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:48:43,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:48:43,434 INFO L85 PathProgramCache]: Analyzing trace with hash -980779733, now seen corresponding path program 1 times [2023-08-29 21:48:43,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:48:43,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498551731] [2023-08-29 21:48:43,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:43,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:48:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:43,468 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:48:43,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:48:43,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498551731] [2023-08-29 21:48:43,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498551731] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:48:43,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648623325] [2023-08-29 21:48:43,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:43,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:48:43,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:48:43,470 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:48:43,472 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:48:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:43,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 21:48:43,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:48:43,585 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:48:43,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:48:43,597 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:48:43,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648623325] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:48:43,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:48:43,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-29 21:48:43,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389741397] [2023-08-29 21:48:43,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:48:43,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 21:48:43,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:48:43,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 21:48:43,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 21:48:43,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 543 [2023-08-29 21:48:43,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 155 transitions, 902 flow. Second operand has 7 states, 7 states have (on average 238.71428571428572) internal successors, (1671), 7 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states 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:48:43,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:48:43,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 543 [2023-08-29 21:48:43,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:48:43,670 INFO L130 PetriNetUnfolder]: 105/327 cut-off events. [2023-08-29 21:48:43,670 INFO L131 PetriNetUnfolder]: For 461/461 co-relation queries the response was YES. [2023-08-29 21:48:43,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1083 conditions, 327 events. 105/327 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1384 event pairs, 26 based on Foata normal form. 46/362 useless extension candidates. Maximal degree in co-relation 1055. Up to 213 conditions per place. [2023-08-29 21:48:43,671 INFO L137 encePairwiseOnDemand]: 540/543 looper letters, 67 selfloop transitions, 2 changer transitions 2/77 dead transitions. [2023-08-29 21:48:43,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 77 transitions, 569 flow [2023-08-29 21:48:43,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 21:48:43,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 21:48:43,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 988 transitions. [2023-08-29 21:48:43,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4548802946593002 [2023-08-29 21:48:43,673 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 988 transitions. [2023-08-29 21:48:43,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 988 transitions. [2023-08-29 21:48:43,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:48:43,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 988 transitions. [2023-08-29 21:48:43,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states 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:48:43,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 543.0) internal successors, (2715), 5 states have internal predecessors, (2715), 0 states have call successors, (0), 0 states 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:48:43,678 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 543.0) internal successors, (2715), 5 states have internal predecessors, (2715), 0 states have call successors, (0), 0 states 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:48:43,678 INFO L175 Difference]: Start difference. First operand has 133 places, 155 transitions, 902 flow. Second operand 4 states and 988 transitions. [2023-08-29 21:48:43,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 77 transitions, 569 flow [2023-08-29 21:48:43,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 77 transitions, 489 flow, removed 28 selfloop flow, removed 11 redundant places. [2023-08-29 21:48:43,680 INFO L231 Difference]: Finished difference. Result has 70 places, 51 transitions, 241 flow [2023-08-29 21:48:43,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=241, PETRI_PLACES=70, PETRI_TRANSITIONS=51} [2023-08-29 21:48:43,682 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -29 predicate places. [2023-08-29 21:48:43,682 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 51 transitions, 241 flow [2023-08-29 21:48:43,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 238.71428571428572) internal successors, (1671), 7 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states 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:48:43,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:48:43,682 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:48:43,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-29 21:48:43,887 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,SelfDestructingSolverStorable9 [2023-08-29 21:48:43,887 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:48:43,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:48:43,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1970517683, now seen corresponding path program 1 times [2023-08-29 21:48:43,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:48:43,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463142883] [2023-08-29 21:48:43,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:43,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:48:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:44,033 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:48:44,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:48:44,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463142883] [2023-08-29 21:48:44,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463142883] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:48:44,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613596216] [2023-08-29 21:48:44,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:44,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:48:44,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:48:44,035 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:48:44,036 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:48:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:44,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-29 21:48:44,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:48:44,117 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:48:44,165 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:48:44,166 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:48:44,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:48:44,218 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:48:44,229 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:48:44,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:48:48,277 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_334 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_334) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-29 21:48:50,288 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_334 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_334) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-29 21:48:50,409 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-29 21:48:50,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613596216] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:48:50,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:48:50,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2023-08-29 21:48:50,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212322389] [2023-08-29 21:48:50,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:48:50,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 21:48:50,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:48:50,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 21:48:50,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=82, Unknown=3, NotChecked=38, Total=156 [2023-08-29 21:48:50,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 543 [2023-08-29 21:48:50,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 51 transitions, 241 flow. Second operand has 13 states, 13 states have (on average 166.3846153846154) internal successors, (2163), 13 states have internal predecessors, (2163), 0 states have call successors, (0), 0 states 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:48:50,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:48:50,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 543 [2023-08-29 21:48:50,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:48:50,653 INFO L130 PetriNetUnfolder]: 105/312 cut-off events. [2023-08-29 21:48:50,653 INFO L131 PetriNetUnfolder]: For 309/315 co-relation queries the response was YES. [2023-08-29 21:48:50,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 312 events. 105/312 cut-off events. For 309/315 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1210 event pairs, 16 based on Foata normal form. 2/300 useless extension candidates. Maximal degree in co-relation 910. Up to 131 conditions per place. [2023-08-29 21:48:50,654 INFO L137 encePairwiseOnDemand]: 536/543 looper letters, 56 selfloop transitions, 8 changer transitions 0/68 dead transitions. [2023-08-29 21:48:50,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 68 transitions, 436 flow [2023-08-29 21:48:50,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 21:48:50,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 21:48:50,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1031 transitions. [2023-08-29 21:48:50,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3164518109269491 [2023-08-29 21:48:50,657 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1031 transitions. [2023-08-29 21:48:50,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1031 transitions. [2023-08-29 21:48:50,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:48:50,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1031 transitions. [2023-08-29 21:48:50,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 171.83333333333334) internal successors, (1031), 6 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states 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:48:50,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 543.0) internal successors, (3801), 7 states have internal predecessors, (3801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:50,662 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 543.0) internal successors, (3801), 7 states have internal predecessors, (3801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:50,662 INFO L175 Difference]: Start difference. First operand has 70 places, 51 transitions, 241 flow. Second operand 6 states and 1031 transitions. [2023-08-29 21:48:50,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 68 transitions, 436 flow [2023-08-29 21:48:50,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 68 transitions, 428 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 21:48:50,664 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 257 flow [2023-08-29 21:48:50,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=257, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2023-08-29 21:48:50,664 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -27 predicate places. [2023-08-29 21:48:50,664 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 257 flow [2023-08-29 21:48:50,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 166.3846153846154) internal successors, (2163), 13 states have internal predecessors, (2163), 0 states have call successors, (0), 0 states 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:48:50,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:48:50,665 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:48:50,670 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:48:50,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:48:50,870 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:48:50,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:48:50,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1303397320, now seen corresponding path program 1 times [2023-08-29 21:48:50,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:48:50,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750851757] [2023-08-29 21:48:50,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:50,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:48:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:51,074 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:48:51,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:48:51,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750851757] [2023-08-29 21:48:51,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750851757] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:48:51,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459210188] [2023-08-29 21:48:51,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:51,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:48:51,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:48:51,076 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:48:51,078 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:48:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:51,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-29 21:48:51,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:48:51,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:48:51,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-08-29 21:48:51,345 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:48:51,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:48:51,605 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:48:51,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459210188] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:48:51,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:48:51,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 17 [2023-08-29 21:48:51,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366326091] [2023-08-29 21:48:51,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:48:51,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-29 21:48:51,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:48:51,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-29 21:48:51,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2023-08-29 21:48:52,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 543 [2023-08-29 21:48:52,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 51 transitions, 257 flow. Second operand has 19 states, 19 states have (on average 203.21052631578948) internal successors, (3861), 19 states have internal predecessors, (3861), 0 states have call successors, (0), 0 states 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:48:52,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:48:52,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 543 [2023-08-29 21:48:52,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:48:53,387 INFO L130 PetriNetUnfolder]: 262/763 cut-off events. [2023-08-29 21:48:53,387 INFO L131 PetriNetUnfolder]: For 655/657 co-relation queries the response was YES. [2023-08-29 21:48:53,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2224 conditions, 763 events. 262/763 cut-off events. For 655/657 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3536 event pairs, 44 based on Foata normal form. 54/784 useless extension candidates. Maximal degree in co-relation 2201. Up to 136 conditions per place. [2023-08-29 21:48:53,390 INFO L137 encePairwiseOnDemand]: 532/543 looper letters, 126 selfloop transitions, 21 changer transitions 0/151 dead transitions. [2023-08-29 21:48:53,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 151 transitions, 982 flow [2023-08-29 21:48:53,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 21:48:53,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 21:48:53,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2521 transitions. [2023-08-29 21:48:53,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3868937998772253 [2023-08-29 21:48:53,395 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2521 transitions. [2023-08-29 21:48:53,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2521 transitions. [2023-08-29 21:48:53,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:48:53,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2521 transitions. [2023-08-29 21:48:53,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 210.08333333333334) internal successors, (2521), 12 states have internal predecessors, (2521), 0 states have call successors, (0), 0 states 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:48:53,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 543.0) internal successors, (7059), 13 states have internal predecessors, (7059), 0 states have call successors, (0), 0 states 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:48:53,405 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 543.0) internal successors, (7059), 13 states have internal predecessors, (7059), 0 states have call successors, (0), 0 states 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:48:53,405 INFO L175 Difference]: Start difference. First operand has 72 places, 51 transitions, 257 flow. Second operand 12 states and 2521 transitions. [2023-08-29 21:48:53,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 151 transitions, 982 flow [2023-08-29 21:48:53,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 151 transitions, 943 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 21:48:53,408 INFO L231 Difference]: Finished difference. Result has 82 places, 64 transitions, 408 flow [2023-08-29 21:48:53,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=408, PETRI_PLACES=82, PETRI_TRANSITIONS=64} [2023-08-29 21:48:53,409 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -17 predicate places. [2023-08-29 21:48:53,409 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 64 transitions, 408 flow [2023-08-29 21:48:53,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 203.21052631578948) internal successors, (3861), 19 states have internal predecessors, (3861), 0 states have call successors, (0), 0 states 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:48:53,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:48:53,410 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] [2023-08-29 21:48:53,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-29 21:48:53,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:48:53,615 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:48:53,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:48:53,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1207439431, now seen corresponding path program 1 times [2023-08-29 21:48:53,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:48:53,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706046138] [2023-08-29 21:48:53,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:53,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:48:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:53,971 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:48:53,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:48:53,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706046138] [2023-08-29 21:48:53,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706046138] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:48:53,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044188995] [2023-08-29 21:48:53,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:53,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:48:53,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:48:53,972 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 21:48:53,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-29 21:48:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:54,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-29 21:48:54,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:48:54,079 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:48:54,120 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:48:54,120 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:48:54,136 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:48:54,199 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 18 treesize of output 13 [2023-08-29 21:48:54,243 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 21 treesize of output 16 [2023-08-29 21:48:58,255 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:48:58,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:49:07,558 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_87| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_87|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_87| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-29 21:49:09,574 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_87| Int) (v_ArrVal_505 Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_505)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_87|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_87| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-29 21:49:23,683 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_87| Int) (v_ArrVal_505 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_87| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88| 28)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_501) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88| v_ArrVal_505) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_87|) 0))) is different from false [2023-08-29 21:49:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-29 21:49:23,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044188995] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:49:23,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:49:23,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2023-08-29 21:49:23,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989405973] [2023-08-29 21:49:23,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:49:23,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-29 21:49:23,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:49:23,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-29 21:49:23,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=250, Unknown=16, NotChecked=108, Total=462 [2023-08-29 21:49:25,851 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 [0] [2023-08-29 21:49:26,960 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 [0] [2023-08-29 21:49:29,033 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 [0] [2023-08-29 21:49:32,010 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 [0] [2023-08-29 21:49:35,944 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 [0] [2023-08-29 21:49:38,021 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 [0] [2023-08-29 21:49:38,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 543 [2023-08-29 21:49:38,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 64 transitions, 408 flow. Second operand has 22 states, 22 states have (on average 160.54545454545453) internal successors, (3532), 22 states have internal predecessors, (3532), 0 states have call successors, (0), 0 states 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:49:38,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:49:38,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 543 [2023-08-29 21:49:38,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:49:40,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:49:41,237 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 [0] [2023-08-29 21:49:43,309 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 [0] [2023-08-29 21:49:44,334 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 [0] [2023-08-29 21:49:47,317 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 [0] [2023-08-29 21:49:49,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:49:51,657 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 [0] [2023-08-29 21:49:52,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:49:53,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:49:58,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:50:04,798 INFO L130 PetriNetUnfolder]: 374/1109 cut-off events. [2023-08-29 21:50:04,799 INFO L131 PetriNetUnfolder]: For 1398/1400 co-relation queries the response was YES. [2023-08-29 21:50:04,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3444 conditions, 1109 events. 374/1109 cut-off events. For 1398/1400 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5809 event pairs, 28 based on Foata normal form. 12/1078 useless extension candidates. Maximal degree in co-relation 3417. Up to 351 conditions per place. [2023-08-29 21:50:04,803 INFO L137 encePairwiseOnDemand]: 534/543 looper letters, 94 selfloop transitions, 41 changer transitions 0/139 dead transitions. [2023-08-29 21:50:04,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 139 transitions, 1107 flow [2023-08-29 21:50:04,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 21:50:04,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 21:50:04,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1817 transitions. [2023-08-29 21:50:04,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3042022434287628 [2023-08-29 21:50:04,807 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1817 transitions. [2023-08-29 21:50:04,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1817 transitions. [2023-08-29 21:50:04,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:50:04,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1817 transitions. [2023-08-29 21:50:04,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 165.1818181818182) internal successors, (1817), 11 states have internal predecessors, (1817), 0 states have call successors, (0), 0 states 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:50:04,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 543.0) internal successors, (6516), 12 states have internal predecessors, (6516), 0 states have call successors, (0), 0 states 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:50:04,815 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 543.0) internal successors, (6516), 12 states have internal predecessors, (6516), 0 states have call successors, (0), 0 states 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:50:04,815 INFO L175 Difference]: Start difference. First operand has 82 places, 64 transitions, 408 flow. Second operand 11 states and 1817 transitions. [2023-08-29 21:50:04,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 139 transitions, 1107 flow [2023-08-29 21:50:04,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 139 transitions, 1021 flow, removed 32 selfloop flow, removed 6 redundant places. [2023-08-29 21:50:04,820 INFO L231 Difference]: Finished difference. Result has 92 places, 96 transitions, 772 flow [2023-08-29 21:50:04,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=772, PETRI_PLACES=92, PETRI_TRANSITIONS=96} [2023-08-29 21:50:04,821 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -7 predicate places. [2023-08-29 21:50:04,821 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 96 transitions, 772 flow [2023-08-29 21:50:04,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 160.54545454545453) internal successors, (3532), 22 states have internal predecessors, (3532), 0 states have call successors, (0), 0 states 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:50:04,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:50:04,822 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:50:04,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-29 21:50:05,031 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,SelfDestructingSolverStorable12 [2023-08-29 21:50:05,033 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:50:05,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:50:05,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1436166320, now seen corresponding path program 1 times [2023-08-29 21:50:05,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:50:05,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065772363] [2023-08-29 21:50:05,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:50:05,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:50:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:50:05,360 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:50:05,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:50:05,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065772363] [2023-08-29 21:50:05,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065772363] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:50:05,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299739414] [2023-08-29 21:50:05,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:50:05,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:50:05,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:50:05,361 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:50:05,363 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:50:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:50:05,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-29 21:50:05,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:50:05,471 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:50:05,521 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:50:05,521 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:50:05,538 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:50:05,607 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 18 treesize of output 13 [2023-08-29 21:50:05,655 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 21 treesize of output 16 [2023-08-29 21:50:05,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 16 treesize of output 18 [2023-08-29 21:50:08,725 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:50:08,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:50:18,278 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91|) 0))) is different from false [2023-08-29 21:50:20,183 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_606 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_606) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91|) 0))) is different from false [2023-08-29 21:50:22,200 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_606 (Array Int Int)) (v_ArrVal_604 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91| Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_604)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_606) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-29 21:50:22,250 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| Int) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_604 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| 28)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_604)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_606) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91|) 0))) is different from false [2023-08-29 21:50:22,271 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_601 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| Int) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_604 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| 28)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_601))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_604))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_606) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91|) 0))) is different from false [2023-08-29 21:50:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-08-29 21:50:22,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299739414] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:50:22,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:50:22,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2023-08-29 21:50:22,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594446992] [2023-08-29 21:50:22,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:50:22,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-29 21:50:22,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:50:22,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-29 21:50:22,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=236, Unknown=12, NotChecked=180, Total=506 [2023-08-29 21:50:22,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 543 [2023-08-29 21:50:22,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 96 transitions, 772 flow. Second operand has 23 states, 23 states have (on average 160.69565217391303) internal successors, (3696), 23 states have internal predecessors, (3696), 0 states have call successors, (0), 0 states 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:50:22,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:50:22,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 543 [2023-08-29 21:50:22,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:50:24,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:50:25,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:50:27,800 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 [0] [2023-08-29 21:50:29,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:50:31,947 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 [0] [2023-08-29 21:50:32,992 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 [0] [2023-08-29 21:50:35,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:50:37,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:50:38,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:50:39,733 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 [0] [2023-08-29 21:50:43,943 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 [0] [2023-08-29 21:50:54,715 INFO L130 PetriNetUnfolder]: 377/1168 cut-off events. [2023-08-29 21:50:54,715 INFO L131 PetriNetUnfolder]: For 2598/2600 co-relation queries the response was YES. [2023-08-29 21:50:54,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4103 conditions, 1168 events. 377/1168 cut-off events. For 2598/2600 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 6306 event pairs, 60 based on Foata normal form. 4/1126 useless extension candidates. Maximal degree in co-relation 4071. Up to 269 conditions per place. [2023-08-29 21:50:54,721 INFO L137 encePairwiseOnDemand]: 534/543 looper letters, 103 selfloop transitions, 46 changer transitions 0/153 dead transitions. [2023-08-29 21:50:54,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 153 transitions, 1417 flow [2023-08-29 21:50:54,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 21:50:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 21:50:54,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1817 transitions. [2023-08-29 21:50:54,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3042022434287628 [2023-08-29 21:50:54,725 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1817 transitions. [2023-08-29 21:50:54,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1817 transitions. [2023-08-29 21:50:54,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:50:54,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1817 transitions. [2023-08-29 21:50:54,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 165.1818181818182) internal successors, (1817), 11 states have internal predecessors, (1817), 0 states have call successors, (0), 0 states 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:50:54,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 543.0) internal successors, (6516), 12 states have internal predecessors, (6516), 0 states have call successors, (0), 0 states 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:50:54,732 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 543.0) internal successors, (6516), 12 states have internal predecessors, (6516), 0 states have call successors, (0), 0 states 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:50:54,732 INFO L175 Difference]: Start difference. First operand has 92 places, 96 transitions, 772 flow. Second operand 11 states and 1817 transitions. [2023-08-29 21:50:54,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 153 transitions, 1417 flow [2023-08-29 21:50:54,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 153 transitions, 1326 flow, removed 43 selfloop flow, removed 2 redundant places. [2023-08-29 21:50:54,740 INFO L231 Difference]: Finished difference. Result has 105 places, 108 transitions, 986 flow [2023-08-29 21:50:54,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=986, PETRI_PLACES=105, PETRI_TRANSITIONS=108} [2023-08-29 21:50:54,741 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 6 predicate places. [2023-08-29 21:50:54,741 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 108 transitions, 986 flow [2023-08-29 21:50:54,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 160.69565217391303) internal successors, (3696), 23 states have internal predecessors, (3696), 0 states have call successors, (0), 0 states 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:50:54,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:50:54,742 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2023-08-29 21:50:54,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-29 21:50:54,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-29 21:50:54,949 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:50:54,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:50:54,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1649503316, now seen corresponding path program 2 times [2023-08-29 21:50:54,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:50:54,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620669153] [2023-08-29 21:50:54,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:50:54,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:50:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:50:55,333 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:50:55,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:50:55,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620669153] [2023-08-29 21:50:55,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620669153] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:50:55,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038755787] [2023-08-29 21:50:55,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 21:50:55,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:50:55,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:50:55,334 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:50:55,336 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:50:55,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 21:50:55,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:50:55,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-29 21:50:55,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:50:55,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:50:55,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-08-29 21:50:55,795 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:50:55,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:50:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:50:56,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038755787] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:50:56,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:50:56,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 27 [2023-08-29 21:50:56,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383718680] [2023-08-29 21:50:56,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:50:56,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-29 21:50:56,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:50:56,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-29 21:50:56,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2023-08-29 21:50:58,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 543 [2023-08-29 21:50:58,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 108 transitions, 986 flow. Second operand has 29 states, 29 states have (on average 204.0) internal successors, (5916), 29 states have internal predecessors, (5916), 0 states have call successors, (0), 0 states 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:50:58,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:50:58,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 543 [2023-08-29 21:50:58,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:50:59,419 INFO L130 PetriNetUnfolder]: 464/1428 cut-off events. [2023-08-29 21:50:59,419 INFO L131 PetriNetUnfolder]: For 3796/3798 co-relation queries the response was YES. [2023-08-29 21:50:59,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5120 conditions, 1428 events. 464/1428 cut-off events. For 3796/3798 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7917 event pairs, 67 based on Foata normal form. 44/1415 useless extension candidates. Maximal degree in co-relation 5083. Up to 252 conditions per place. [2023-08-29 21:50:59,424 INFO L137 encePairwiseOnDemand]: 536/543 looper letters, 216 selfloop transitions, 39 changer transitions 0/259 dead transitions. [2023-08-29 21:50:59,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 259 transitions, 2554 flow [2023-08-29 21:50:59,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-29 21:50:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-29 21:50:59,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2731 transitions. [2023-08-29 21:50:59,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38688199461680123 [2023-08-29 21:50:59,441 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2731 transitions. [2023-08-29 21:50:59,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2731 transitions. [2023-08-29 21:50:59,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:50:59,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2731 transitions. [2023-08-29 21:50:59,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 210.07692307692307) internal successors, (2731), 13 states have internal predecessors, (2731), 0 states have call successors, (0), 0 states 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:50:59,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 543.0) internal successors, (7602), 14 states have internal predecessors, (7602), 0 states have call successors, (0), 0 states 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:50:59,452 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 543.0) internal successors, (7602), 14 states have internal predecessors, (7602), 0 states have call successors, (0), 0 states 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:50:59,452 INFO L175 Difference]: Start difference. First operand has 105 places, 108 transitions, 986 flow. Second operand 13 states and 2731 transitions. [2023-08-29 21:50:59,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 259 transitions, 2554 flow [2023-08-29 21:50:59,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 259 transitions, 2428 flow, removed 18 selfloop flow, removed 9 redundant places. [2023-08-29 21:50:59,466 INFO L231 Difference]: Finished difference. Result has 107 places, 126 transitions, 1212 flow [2023-08-29 21:50:59,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1212, PETRI_PLACES=107, PETRI_TRANSITIONS=126} [2023-08-29 21:50:59,466 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 8 predicate places. [2023-08-29 21:50:59,467 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 126 transitions, 1212 flow [2023-08-29 21:50:59,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 204.0) internal successors, (5916), 29 states have internal predecessors, (5916), 0 states have call successors, (0), 0 states 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:50:59,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:50:59,468 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:50:59,473 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:50:59,673 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,SelfDestructingSolverStorable14 [2023-08-29 21:50:59,673 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:50:59,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:50:59,674 INFO L85 PathProgramCache]: Analyzing trace with hash -252420002, now seen corresponding path program 2 times [2023-08-29 21:50:59,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:50:59,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724094973] [2023-08-29 21:50:59,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:50:59,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:50:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:51:00,357 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:51:00,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:51:00,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724094973] [2023-08-29 21:51:00,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724094973] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:51:00,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410558340] [2023-08-29 21:51:00,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 21:51:00,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:51:00,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:51:00,359 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:51:00,361 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:51:00,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 21:51:00,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:51:00,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 54 conjunts are in the unsatisfiable core [2023-08-29 21:51:00,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:51:00,477 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:51:00,517 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:51:00,517 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:51:00,531 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:51:00,593 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 24 treesize of output 17 [2023-08-29 21:51:00,642 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 21:51:00,711 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 18 treesize of output 13 [2023-08-29 21:51:00,755 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 21 treesize of output 16 [2023-08-29 21:51:10,294 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 21:51:10,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:51:26,249 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101|) 0))) is different from false [2023-08-29 21:51:28,265 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_861 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_861)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-29 21:51:50,441 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_861 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102|)) (= (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102| v_ArrVal_861) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101|) 0))) is different from false [2023-08-29 21:51:52,449 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_861 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102| Int)) (or (= (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102| v_ArrVal_861) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102|)))) is different from false [2023-08-29 21:51:54,466 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_861 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102|)) (= (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102| v_ArrVal_861) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101|) 0))) is different from false [2023-08-29 21:52:16,613 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_861 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_853) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102| v_ArrVal_861) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102|)))) is different from false [2023-08-29 21:52:16,722 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 13 not checked. [2023-08-29 21:52:16,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410558340] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:52:16,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:52:16,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 10] total 30 [2023-08-29 21:52:16,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378827555] [2023-08-29 21:52:16,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:52:16,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-29 21:52:16,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:52:16,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-29 21:52:16,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=501, Unknown=29, NotChecked=318, Total=992 [2023-08-29 21:52:17,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:17,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 543 [2023-08-29 21:52:17,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 126 transitions, 1212 flow. Second operand has 32 states, 32 states have (on average 156.78125) internal successors, (5017), 32 states have internal predecessors, (5017), 0 states have call successors, (0), 0 states 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:52:17,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:52:17,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 543 [2023-08-29 21:52:17,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:52:19,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:20,338 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 [0] [2023-08-29 21:52:21,583 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 [0] [2023-08-29 21:52:28,117 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 [0] [2023-08-29 21:52:29,246 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 [0] [2023-08-29 21:52:30,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:31,401 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 [0] [2023-08-29 21:52:32,627 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 [0] [2023-08-29 21:52:33,794 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 [0] [2023-08-29 21:52:37,365 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 [0] [2023-08-29 21:52:38,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:41,825 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 [0] [2023-08-29 21:52:42,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:44,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:45,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:46,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:47,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:52,264 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 [0] [2023-08-29 21:52:53,427 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 [0] [2023-08-29 21:53:01,600 WARN L222 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 67 DAG size of output: 46 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:53:30,035 WARN L222 SmtUtils]: Spent 10.10s on a formula simplification. DAG size of input: 64 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:53:30,277 INFO L130 PetriNetUnfolder]: 516/1650 cut-off events. [2023-08-29 21:53:30,277 INFO L131 PetriNetUnfolder]: For 3771/3773 co-relation queries the response was YES. [2023-08-29 21:53:30,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5773 conditions, 1650 events. 516/1650 cut-off events. For 3771/3773 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 9936 event pairs, 11 based on Foata normal form. 12/1587 useless extension candidates. Maximal degree in co-relation 5738. Up to 335 conditions per place. [2023-08-29 21:53:30,285 INFO L137 encePairwiseOnDemand]: 530/543 looper letters, 91 selfloop transitions, 95 changer transitions 15/205 dead transitions. [2023-08-29 21:53:30,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 205 transitions, 2100 flow [2023-08-29 21:53:30,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-29 21:53:30,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-29 21:53:30,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2549 transitions. [2023-08-29 21:53:30,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29339318600368325 [2023-08-29 21:53:30,288 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2549 transitions. [2023-08-29 21:53:30,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2549 transitions. [2023-08-29 21:53:30,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:53:30,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2549 transitions. [2023-08-29 21:53:30,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 159.3125) internal successors, (2549), 16 states have internal predecessors, (2549), 0 states have call successors, (0), 0 states 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:30,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 543.0) internal successors, (9231), 17 states have internal predecessors, (9231), 0 states have call successors, (0), 0 states 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:30,295 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 543.0) internal successors, (9231), 17 states have internal predecessors, (9231), 0 states have call successors, (0), 0 states 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:30,295 INFO L175 Difference]: Start difference. First operand has 107 places, 126 transitions, 1212 flow. Second operand 16 states and 2549 transitions. [2023-08-29 21:53:30,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 205 transitions, 2100 flow [2023-08-29 21:53:30,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 205 transitions, 2056 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-29 21:53:30,310 INFO L231 Difference]: Finished difference. Result has 122 places, 157 transitions, 1773 flow [2023-08-29 21:53:30,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1773, PETRI_PLACES=122, PETRI_TRANSITIONS=157} [2023-08-29 21:53:30,311 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 23 predicate places. [2023-08-29 21:53:30,311 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 157 transitions, 1773 flow [2023-08-29 21:53:30,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 156.78125) internal successors, (5017), 32 states have internal predecessors, (5017), 0 states have call successors, (0), 0 states 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:30,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:53:30,312 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:53:30,321 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:53:30,517 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,SelfDestructingSolverStorable15 [2023-08-29 21:53:30,518 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:53:30,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:53:30,518 INFO L85 PathProgramCache]: Analyzing trace with hash 501022041, now seen corresponding path program 2 times [2023-08-29 21:53:30,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:53:30,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914144400] [2023-08-29 21:53:30,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:30,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:53:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:53:31,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:53:31,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914144400] [2023-08-29 21:53:31,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914144400] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:53:31,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222815698] [2023-08-29 21:53:31,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 21:53:31,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:53:31,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:53:31,266 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:53:31,296 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:53:31,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 21:53:31,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:53:31,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-29 21:53:31,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:53:31,407 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:53:31,450 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:53:31,451 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:53:31,458 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:53:31,539 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 18 treesize of output 13 [2023-08-29 21:53:31,598 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 21 treesize of output 16 [2023-08-29 21:53:37,624 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 21 treesize of output 16 [2023-08-29 21:53:43,104 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 24 treesize of output 19 [2023-08-29 21:54:11,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-29 21:54:15,623 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:54:15,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:54:15,633 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_998 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_998) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-29 21:54:15,644 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_998 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_998) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)))) is different from false [2023-08-29 21:54:17,654 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_998 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_998) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107|) 0))) is different from false [2023-08-29 21:54:19,674 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_998 (Array Int Int)) (v_ArrVal_997 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_997)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_998) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107|) 0))) is different from false [2023-08-29 21:54:19,727 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| Int) (v_ArrVal_998 (Array Int Int)) (v_ArrVal_997 Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| v_ArrVal_997)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_998) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107|) 0)))) is different from false [2023-08-29 21:54:19,743 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_81| Int)) (or (< |v_t_funThread1of1ForFork0_~i~0#1_81| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| Int) (v_ArrVal_998 (Array Int Int)) (v_ArrVal_997 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_81| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| v_ArrVal_997)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_998) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107|) 0)))))) is different from false [2023-08-29 21:54:19,800 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| Int) (v_ArrVal_992 Int) (v_ArrVal_998 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_81| Int) (v_ArrVal_997 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_81| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108|) (< |v_t_funThread1of1ForFork0_~i~0#1_81| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_992)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| v_ArrVal_997))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_998) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-08-29 21:54:19,926 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| Int) (v_ArrVal_992 Int) (v_ArrVal_998 (Array Int Int)) (v_ArrVal_997 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| v_ArrVal_992) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| v_ArrVal_997)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_998) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107|) 0))) is different from false [2023-08-29 21:54:19,959 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| Int) (v_ArrVal_992 Int) (v_ArrVal_998 (Array Int Int)) (v_ArrVal_989 (Array Int Int)) (v_ArrVal_997 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109|)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_989))) (store .cse0 |c_~#cache~0.base| (store (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| v_ArrVal_992) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| v_ArrVal_997))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_998) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107|) 0))) is different from false [2023-08-29 21:54:20,144 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 18 not checked. [2023-08-29 21:54:20,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222815698] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:54:20,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:54:20,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 30 [2023-08-29 21:54:20,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123623570] [2023-08-29 21:54:20,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:54:20,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-29 21:54:20,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:54:20,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-29 21:54:20,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=393, Unknown=34, NotChecked=450, Total=992 [2023-08-29 21:54:20,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 543 [2023-08-29 21:54:20,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 157 transitions, 1773 flow. Second operand has 32 states, 32 states have (on average 160.84375) internal successors, (5147), 32 states have internal predecessors, (5147), 0 states have call successors, (0), 0 states 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:20,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:54:20,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 543 [2023-08-29 21:54:20,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:54:21,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:54:23,589 WARN L539 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] [2023-08-29 21:54:25,596 WARN L539 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] [2023-08-29 21:54:34,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:54:36,992 WARN L539 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 21:54:39,000 WARN L539 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 21:54:45,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:54:47,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 [0, 1] [2023-08-29 21:54:49,796 WARN L539 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 21:54:51,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:54:53,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 [0, 1] [2023-08-29 21:54:55,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 [0, 1] [2023-08-29 21:54:56,429 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 [0, 1] [2023-08-29 21:54:58,438 WARN L539 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 21:55:00,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 [0, 1] [2023-08-29 21:55:01,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:55:03,955 WARN L539 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 21:55:05,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:55:07,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:55:09,254 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 [0, 1] [2023-08-29 21:55:11,257 WARN L539 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 21:55:12,584 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 [0, 1] [2023-08-29 21:55:26,457 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 [0] [2023-08-29 21:55:28,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:30,477 WARN L539 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] [2023-08-29 21:55:32,481 WARN L539 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] [2023-08-29 21:55:33,557 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 [0] [2023-08-29 21:55:35,559 WARN L539 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] [2023-08-29 21:55:36,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:37,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:39,867 WARN L539 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] [2023-08-29 21:55:41,873 WARN L539 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] [2023-08-29 21:55:43,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:44,946 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 [0] [2023-08-29 21:55:46,951 WARN L539 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] [2023-08-29 21:55:48,071 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 [0] [2023-08-29 21:55:49,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:51,271 WARN L539 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] [2023-08-29 21:55:53,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:55,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:56,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:58,425 WARN L539 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] [2023-08-29 21:55:59,607 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 [0] [2023-08-29 21:56:00,830 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 [0] [2023-08-29 21:56:02,834 WARN L539 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] [2023-08-29 21:56:04,839 WARN L539 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] [2023-08-29 21:56:06,843 WARN L539 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] [2023-08-29 21:56:07,928 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 [0] [2023-08-29 21:56:09,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:11,061 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 [0] [2023-08-29 21:56:19,563 WARN L222 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 52 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:56:28,441 WARN L222 SmtUtils]: Spent 6.83s on a formula simplification. DAG size of input: 75 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:56:41,189 WARN L222 SmtUtils]: Spent 6.72s on a formula simplification. DAG size of input: 51 DAG size of output: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:57:00,719 WARN L222 SmtUtils]: Spent 6.60s on a formula simplification. DAG size of input: 57 DAG size of output: 42 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:57:27,706 INFO L130 PetriNetUnfolder]: 687/2231 cut-off events. [2023-08-29 21:57:27,706 INFO L131 PetriNetUnfolder]: For 10312/10324 co-relation queries the response was YES. [2023-08-29 21:57:27,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10274 conditions, 2231 events. 687/2231 cut-off events. For 10312/10324 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 13912 event pairs, 64 based on Foata normal form. 19/2250 useless extension candidates. Maximal degree in co-relation 10232. Up to 436 conditions per place. [2023-08-29 21:57:27,716 INFO L137 encePairwiseOnDemand]: 532/543 looper letters, 240 selfloop transitions, 124 changer transitions 0/368 dead transitions. [2023-08-29 21:57:27,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 368 transitions, 4685 flow [2023-08-29 21:57:27,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-29 21:57:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-29 21:57:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3285 transitions. [2023-08-29 21:57:27,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30248618784530384 [2023-08-29 21:57:27,720 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3285 transitions. [2023-08-29 21:57:27,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3285 transitions. [2023-08-29 21:57:27,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:57:27,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3285 transitions. [2023-08-29 21:57:27,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 164.25) internal successors, (3285), 20 states have internal predecessors, (3285), 0 states have call successors, (0), 0 states 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:27,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 543.0) internal successors, (11403), 21 states have internal predecessors, (11403), 0 states have call successors, (0), 0 states 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:27,729 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 543.0) internal successors, (11403), 21 states have internal predecessors, (11403), 0 states have call successors, (0), 0 states 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:27,729 INFO L175 Difference]: Start difference. First operand has 122 places, 157 transitions, 1773 flow. Second operand 20 states and 3285 transitions. [2023-08-29 21:57:27,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 368 transitions, 4685 flow [2023-08-29 21:57:27,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 368 transitions, 4450 flow, removed 76 selfloop flow, removed 9 redundant places. [2023-08-29 21:57:27,767 INFO L231 Difference]: Finished difference. Result has 144 places, 236 transitions, 3137 flow [2023-08-29 21:57:27,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=1646, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3137, PETRI_PLACES=144, PETRI_TRANSITIONS=236} [2023-08-29 21:57:27,768 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 45 predicate places. [2023-08-29 21:57:27,768 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 236 transitions, 3137 flow [2023-08-29 21:57:27,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 160.84375) internal successors, (5147), 32 states have internal predecessors, (5147), 0 states have call successors, (0), 0 states 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:27,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:57:27,769 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:57:27,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-29 21:57:27,973 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,SelfDestructingSolverStorable16 [2023-08-29 21:57:27,974 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:57:27,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:57:27,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1681203837, now seen corresponding path program 3 times [2023-08-29 21:57:27,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:57:27,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606798055] [2023-08-29 21:57:27,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:57:27,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:57:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:57:36,137 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:57:36,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:57:36,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606798055] [2023-08-29 21:57:36,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606798055] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:57:36,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039554595] [2023-08-29 21:57:36,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 21:57:36,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:57:36,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:57:36,139 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:36,141 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:36,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-29 21:57:36,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:57:36,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 74 conjunts are in the unsatisfiable core [2023-08-29 21:57:36,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:57:36,830 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:36,954 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-08-29 21:57:36,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-08-29 21:57:36,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-29 21:57:37,145 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 18 treesize of output 13 [2023-08-29 21:57:37,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-29 21:57:37,268 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 21 treesize of output 16 [2023-08-29 21:57:43,338 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 21 treesize of output 16 [2023-08-29 21:57:47,293 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 24 treesize of output 19 [2023-08-29 21:58:17,589 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 24 treesize of output 19 [2023-08-29 21:58:26,748 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 27 treesize of output 22 [2023-08-29 21:59:11,327 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 27 treesize of output 22 [2023-08-29 21:59:27,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-08-29 22:00:22,527 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 22:00:22,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 22:00:50,655 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-29 22:00:52,671 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| Int) (v_ArrVal_1207 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1207)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115|) 0))) is different from false [2023-08-29 22:00:54,720 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| Int) (v_ArrVal_1207 Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116|) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| v_ArrVal_1207) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115|) 0)))) is different from false [2023-08-29 22:01:40,112 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1202 Int) (|v_t_funThread1of1ForFork0_~i~0#1_89| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| Int) (v_ArrVal_1207 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_89| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| (+ .cse0 28 |c_~#cache~0.offset|)) (= 0 (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1202)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| v_ArrVal_1207) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115|)) (< |v_t_funThread1of1ForFork0_~i~0#1_89| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116|)))) is different from false [2023-08-29 22:01:42,221 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| Int) (v_ArrVal_1202 Int) (|v_t_funThread1of1ForFork0_~i~0#1_89| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| Int) (v_ArrVal_1207 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_89| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_89| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| v_ArrVal_1202) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| v_ArrVal_1207) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116|) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117|)))) is different from false [2023-08-29 22:01:44,245 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| Int) (v_ArrVal_1202 Int) (|v_t_funThread1of1ForFork0_~i~0#1_89| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| Int) (v_ArrVal_1207 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_89| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< .cse0 (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| (+ .cse1 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_89| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (select (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| v_ArrVal_1202) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| v_ArrVal_1207) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115|) 0) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116|))))) is different from false [2023-08-29 22:01:45,289 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| Int) (v_ArrVal_1199 Int) (v_ArrVal_1202 Int) (|v_t_funThread1of1ForFork0_~i~0#1_89| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| Int) (v_ArrVal_1207 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_89| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< .cse0 (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| (+ .cse1 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_89| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (select (store (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1199)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| v_ArrVal_1202) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| v_ArrVal_1207) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115|) 0) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116|))))) is different from false [2023-08-29 22:01:47,448 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_1199 Int) (v_ArrVal_1202 Int) (|v_t_funThread1of1ForFork0_~i~0#1_89| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| Int) (v_ArrVal_1207 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_89| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< .cse0 (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| (+ .cse1 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_89| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (select (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| v_ArrVal_1199) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| v_ArrVal_1202) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| v_ArrVal_1207) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115|) 0) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116|) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|))))) is different from false [2023-08-29 22:01:49,479 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_1199 Int) (v_ArrVal_1202 Int) (|v_t_funThread1of1ForFork0_~i~0#1_89| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| Int) (v_ArrVal_1207 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_89| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< .cse0 (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| (+ .cse1 28 |c_~#cache~0.offset|)) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|)) (= (select (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| v_ArrVal_1199) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| v_ArrVal_1202) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| v_ArrVal_1207) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115|) 0) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116|) (< |v_t_funThread1of1ForFork0_~i~0#1_89| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2023-08-29 22:01:51,557 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1194 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_1199 Int) (v_ArrVal_1202 Int) (|v_t_funThread1of1ForFork0_~i~0#1_89| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| Int) (v_ArrVal_1207 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_89| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< .cse0 (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| (+ .cse1 28 |c_~#cache~0.offset|)) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116|) (= (select (store (store (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1194)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| v_ArrVal_1199) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| v_ArrVal_1202) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| v_ArrVal_1207) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_89| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2023-08-29 22:01:51,643 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1194 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_1199 Int) (v_ArrVal_1202 Int) (|v_t_funThread1of1ForFork0_~i~0#1_89| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| Int) (v_ArrVal_1193 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| Int) (v_ArrVal_1207 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_89| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< .cse0 (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| (+ .cse1 28 |c_~#cache~0.offset|)) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116|) (< |v_t_funThread1of1ForFork0_~i~0#1_89| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (select (store (store (store (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1193))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1194))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| v_ArrVal_1199) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| v_ArrVal_1202) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| v_ArrVal_1207) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115|) 0))))) is different from false [2023-08-29 22:01:51,706 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1194 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_1199 Int) (v_ArrVal_1202 Int) (|v_t_funThread1of1ForFork0_~i~0#1_89| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| Int) (v_ArrVal_1191 Int) (v_ArrVal_1193 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| Int) (v_ArrVal_1207 Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_89| 28))) (let ((.cse0 (+ .cse2 |c_~#cache~0.offset|))) (or (< .cse0 (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117|)) (= (select (store (store (store (select (let ((.cse1 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1191)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1193))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1194))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| v_ArrVal_1199) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| v_ArrVal_1202) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| v_ArrVal_1207) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| (+ .cse2 28 |c_~#cache~0.offset|)) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116|) (< |v_t_funThread1of1ForFork0_~i~0#1_89| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2023-08-29 22:01:51,851 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1194 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_119| Int) (v_ArrVal_1199 Int) (v_ArrVal_1202 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| Int) (v_ArrVal_1191 Int) (v_ArrVal_1193 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| Int) (v_ArrVal_1207 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| (+ 112 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_119|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| (+ 84 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|)) (= (select (store (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_119| v_ArrVal_1191)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1193) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_119| v_ArrVal_1194) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| v_ArrVal_1199) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| v_ArrVal_1202) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| v_ArrVal_1207) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115|) 0))) is different from false [2023-08-29 22:01:51,925 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| Int) (v_ArrVal_1191 Int) (v_ArrVal_1193 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| Int) (v_ArrVal_1194 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_1190 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_119| Int) (v_ArrVal_1199 Int) (v_ArrVal_1202 Int) (v_ArrVal_1207 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117|)) (= (select (store (store (store (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1190))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_119| v_ArrVal_1191))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1193) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_119| v_ArrVal_1194) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| v_ArrVal_1199) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| v_ArrVal_1202) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| v_ArrVal_1207) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| (+ 112 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_119|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| (+ 84 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|)))) is different from false [2023-08-29 22:01:52,362 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 87 not checked. [2023-08-29 22:01:52,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039554595] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 22:01:52,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 22:01:52,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 18] total 53 [2023-08-29 22:01:52,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361045008] [2023-08-29 22:01:52,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 22:01:52,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-08-29 22:01:52,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:01:52,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-08-29 22:01:52,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=1255, Unknown=128, NotChecked=1274, Total=2970 [2023-08-29 22:01:52,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 543 [2023-08-29 22:01:52,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 236 transitions, 3137 flow. Second operand has 55 states, 55 states have (on average 159.96363636363637) internal successors, (8798), 55 states have internal predecessors, (8798), 0 states have call successors, (0), 0 states 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:01:52,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:01:52,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 543 [2023-08-29 22:01:52,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:01:54,387 WARN L539 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] [2023-08-29 22:01:56,523 WARN L539 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] [2023-08-29 22:01:57,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 22:01:59,829 WARN L539 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] [2023-08-29 22:02:01,833 WARN L539 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] [2023-08-29 22:02:03,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 22:02:05,867 WARN L539 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] [2023-08-29 22:02:07,878 WARN L539 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] [2023-08-29 22:02:09,908 WARN L539 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] [2023-08-29 22:02:11,113 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 [0] [2023-08-29 22:02:13,124 WARN L539 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] [2023-08-29 22:02:15,129 WARN L539 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] [2023-08-29 22:02:17,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 22:02:19,172 WARN L539 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] [2023-08-29 22:02:21,184 WARN L539 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] [2023-08-29 22:02:23,227 WARN L539 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] [2023-08-29 22:02:24,636 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 [0] [2023-08-29 22:02:26,648 WARN L539 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] [2023-08-29 22:02:28,654 WARN L539 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] [2023-08-29 22:02:30,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 22:02:32,689 WARN L539 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] [2023-08-29 22:02:48,512 WARN L539 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] [2023-08-29 22:02:50,543 WARN L539 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] [2023-08-29 22:02:51,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 22:02:53,956 WARN L539 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] [2023-08-29 22:02:55,961 WARN L539 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] [2023-08-29 22:02:57,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Killed by 15