./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_86-lists_racing.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_86-lists_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 db5eab03de8fef3e653289c5dcf0b220be6d8b09a4df3c07d6d5a066426e755a --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 04:21:35,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 04:21:35,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 04:21:35,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 04:21:35,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 04:21:35,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 04:21:35,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 04:21:35,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 04:21:35,097 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 04:21:35,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 04:21:35,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 04:21:35,109 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 04:21:35,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 04:21:35,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 04:21:35,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 04:21:35,118 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 04:21:35,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 04:21:35,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 04:21:35,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 04:21:35,125 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 04:21:35,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 04:21:35,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 04:21:35,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 04:21:35,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 04:21:35,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 04:21:35,136 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 04:21:35,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 04:21:35,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 04:21:35,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 04:21:35,139 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 04:21:35,140 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 04:21:35,150 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 04:21:35,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 04:21:35,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 04:21:35,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 04:21:35,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 04:21:35,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 04:21:35,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 04:21:35,155 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 04:21:35,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 04:21:35,156 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 04:21:35,158 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 04:21:35,193 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 04:21:35,194 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 04:21:35,195 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 04:21:35,195 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 04:21:35,196 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 04:21:35,196 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 04:21:35,196 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 04:21:35,197 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 04:21:35,197 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 04:21:35,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 04:21:35,198 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 04:21:35,198 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 04:21:35,198 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 04:21:35,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 04:21:35,199 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 04:21:35,199 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 04:21:35,199 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 04:21:35,199 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 04:21:35,199 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 04:21:35,200 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 04:21:35,200 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 04:21:35,200 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 04:21:35,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 04:21:35,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 04:21:35,201 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 04:21:35,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 04:21:35,201 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 04:21:35,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 04:21:35,201 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 04:21:35,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 04:21:35,202 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 04:21:35,202 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 04:21:35,202 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 04:21:35,202 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 04:21:35,203 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 -> db5eab03de8fef3e653289c5dcf0b220be6d8b09a4df3c07d6d5a066426e755a Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 04:21:35,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 04:21:35,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 04:21:35,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 04:21:35,523 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 04:21:35,523 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 04:21:35,524 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_86-lists_racing.i [2023-08-30 04:21:36,693 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 04:21:37,003 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 04:21:37,004 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_86-lists_racing.i [2023-08-30 04:21:37,021 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7119c298/8e4f1b52779545ad80cdbcd4d3b54c9a/FLAG577029287 [2023-08-30 04:21:37,034 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7119c298/8e4f1b52779545ad80cdbcd4d3b54c9a [2023-08-30 04:21:37,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 04:21:37,037 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 04:21:37,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 04:21:37,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 04:21:37,042 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 04:21:37,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:21:37" (1/1) ... [2023-08-30 04:21:37,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7defe883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:21:37, skipping insertion in model container [2023-08-30 04:21:37,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:21:37" (1/1) ... [2023-08-30 04:21:37,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 04:21:37,100 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 04:21:37,483 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_86-lists_racing.i[47038,47051] [2023-08-30 04:21:37,544 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 04:21:37,644 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 04:21:37,679 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_86-lists_racing.i[47038,47051] [2023-08-30 04:21:37,699 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 04:21:37,753 INFO L208 MainTranslator]: Completed translation [2023-08-30 04:21:37,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:21:37 WrapperNode [2023-08-30 04:21:37,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 04:21:37,755 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 04:21:37,755 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 04:21:37,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 04:21:37,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:21:37" (1/1) ... [2023-08-30 04:21:37,797 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:21:37" (1/1) ... [2023-08-30 04:21:37,834 INFO L138 Inliner]: procedures = 278, calls = 60, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 232 [2023-08-30 04:21:37,835 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 04:21:37,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 04:21:37,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 04:21:37,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 04:21:37,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:21:37" (1/1) ... [2023-08-30 04:21:37,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:21:37" (1/1) ... [2023-08-30 04:21:37,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:21:37" (1/1) ... [2023-08-30 04:21:37,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:21:37" (1/1) ... [2023-08-30 04:21:37,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:21:37" (1/1) ... [2023-08-30 04:21:37,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:21:37" (1/1) ... [2023-08-30 04:21:37,905 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:21:37" (1/1) ... [2023-08-30 04:21:37,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:21:37" (1/1) ... [2023-08-30 04:21:37,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 04:21:37,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 04:21:37,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 04:21:37,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 04:21:37,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:21:37" (1/1) ... [2023-08-30 04:21:37,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 04:21:37,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 04:21:37,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 04:21:37,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 04:21:37,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 04:21:37,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-08-30 04:21:37,982 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2023-08-30 04:21:37,982 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2023-08-30 04:21:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 04:21:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 04:21:37,983 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2023-08-30 04:21:37,983 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2023-08-30 04:21:37,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 04:21:37,984 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-30 04:21:37,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-30 04:21:37,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 04:21:37,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-08-30 04:21:37,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 04:21:37,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 04:21:37,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 04:21:37,986 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 04:21:38,202 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 04:21:38,204 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 04:21:38,568 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 04:21:38,576 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 04:21:38,576 INFO L302 CfgBuilder]: Removed 16 assume(true) statements. [2023-08-30 04:21:38,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:21:38 BoogieIcfgContainer [2023-08-30 04:21:38,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 04:21:38,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 04:21:38,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 04:21:38,584 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 04:21:38,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:21:37" (1/3) ... [2023-08-30 04:21:38,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6d6271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:21:38, skipping insertion in model container [2023-08-30 04:21:38,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:21:37" (2/3) ... [2023-08-30 04:21:38,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6d6271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:21:38, skipping insertion in model container [2023-08-30 04:21:38,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:21:38" (3/3) ... [2023-08-30 04:21:38,587 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_86-lists_racing.i [2023-08-30 04:21:38,602 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 04:21:38,602 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2023-08-30 04:21:38,603 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 04:21:38,699 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-30 04:21:38,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 279 transitions, 580 flow [2023-08-30 04:21:38,936 INFO L130 PetriNetUnfolder]: 54/526 cut-off events. [2023-08-30 04:21:38,937 INFO L131 PetriNetUnfolder]: For 8/16 co-relation queries the response was YES. [2023-08-30 04:21:38,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 526 events. 54/526 cut-off events. For 8/16 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2427 event pairs, 0 based on Foata normal form. 0/380 useless extension candidates. Maximal degree in co-relation 258. Up to 8 conditions per place. [2023-08-30 04:21:38,950 INFO L82 GeneralOperation]: Start removeDead. Operand has 259 places, 279 transitions, 580 flow [2023-08-30 04:21:38,963 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 259 places, 279 transitions, 580 flow [2023-08-30 04:21:38,967 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 04:21:38,985 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 259 places, 279 transitions, 580 flow [2023-08-30 04:21:38,996 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 259 places, 279 transitions, 580 flow [2023-08-30 04:21:38,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 279 transitions, 580 flow [2023-08-30 04:21:39,074 INFO L130 PetriNetUnfolder]: 54/526 cut-off events. [2023-08-30 04:21:39,075 INFO L131 PetriNetUnfolder]: For 8/16 co-relation queries the response was YES. [2023-08-30 04:21:39,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 526 events. 54/526 cut-off events. For 8/16 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2427 event pairs, 0 based on Foata normal form. 0/380 useless extension candidates. Maximal degree in co-relation 258. Up to 8 conditions per place. [2023-08-30 04:21:39,108 INFO L119 LiptonReduction]: Number of co-enabled transitions 25622 [2023-08-30 04:21:48,237 INFO L134 LiptonReduction]: Checked pairs total: 63228 [2023-08-30 04:21:48,237 INFO L136 LiptonReduction]: Total number of compositions: 251 [2023-08-30 04:21:48,251 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 04:21:48,257 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;@315c1b1c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 04:21:48,257 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2023-08-30 04:21:48,260 INFO L130 PetriNetUnfolder]: 1/3 cut-off events. [2023-08-30 04:21:48,260 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 04:21:48,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:21:48,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 04:21:48,262 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 04:21:48,266 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:21:48,266 INFO L85 PathProgramCache]: Analyzing trace with hash 35221, now seen corresponding path program 1 times [2023-08-30 04:21:48,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:21:48,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450134039] [2023-08-30 04:21:48,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:21:48,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:21:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:21:48,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:21:48,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:21:48,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450134039] [2023-08-30 04:21:48,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450134039] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 04:21:48,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 04:21:48,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 04:21:48,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456509128] [2023-08-30 04:21:48,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 04:21:48,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 04:21:48,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:21:48,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 04:21:48,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 04:21:48,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 530 [2023-08-30 04:21:48,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 114 transitions, 250 flow. Second operand has 2 states, 2 states have (on average 256.0) internal successors, (512), 2 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:21:48,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:21:48,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 530 [2023-08-30 04:21:48,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:21:51,501 INFO L130 PetriNetUnfolder]: 18691/32140 cut-off events. [2023-08-30 04:21:51,502 INFO L131 PetriNetUnfolder]: For 157/157 co-relation queries the response was YES. [2023-08-30 04:21:51,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60864 conditions, 32140 events. 18691/32140 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 1049. Compared 256600 event pairs, 17940 based on Foata normal form. 1250/16708 useless extension candidates. Maximal degree in co-relation 58044. Up to 28580 conditions per place. [2023-08-30 04:21:51,724 INFO L137 encePairwiseOnDemand]: 515/530 looper letters, 81 selfloop transitions, 0 changer transitions 0/99 dead transitions. [2023-08-30 04:21:51,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 99 transitions, 382 flow [2023-08-30 04:21:51,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 04:21:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 04:21:51,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 606 transitions. [2023-08-30 04:21:51,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5716981132075472 [2023-08-30 04:21:51,742 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 606 transitions. [2023-08-30 04:21:51,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 606 transitions. [2023-08-30 04:21:51,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:21:51,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 606 transitions. [2023-08-30 04:21:51,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 303.0) internal successors, (606), 2 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:21:51,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 530.0) internal successors, (1590), 3 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:21:51,761 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 530.0) internal successors, (1590), 3 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:21:51,763 INFO L175 Difference]: Start difference. First operand has 101 places, 114 transitions, 250 flow. Second operand 2 states and 606 transitions. [2023-08-30 04:21:51,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 99 transitions, 382 flow [2023-08-30 04:21:51,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 99 transitions, 382 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 04:21:51,780 INFO L231 Difference]: Finished difference. Result has 98 places, 99 transitions, 220 flow [2023-08-30 04:21:51,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=220, PETRI_PLACES=98, PETRI_TRANSITIONS=99} [2023-08-30 04:21:51,786 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -3 predicate places. [2023-08-30 04:21:51,787 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 99 transitions, 220 flow [2023-08-30 04:21:51,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 256.0) internal successors, (512), 2 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:21:51,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:21:51,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 04:21:51,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 04:21:51,789 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 04:21:51,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:21:51,799 INFO L85 PathProgramCache]: Analyzing trace with hash 35230, now seen corresponding path program 1 times [2023-08-30 04:21:51,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:21:51,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142891263] [2023-08-30 04:21:51,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:21:51,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:21:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:21:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:21:52,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:21:52,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142891263] [2023-08-30 04:21:52,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142891263] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 04:21:52,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 04:21:52,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 04:21:52,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621081857] [2023-08-30 04:21:52,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 04:21:52,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 04:21:52,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:21:52,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 04:21:52,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 04:21:52,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 530 [2023-08-30 04:21:52,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 99 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:21:52,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:21:52,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 530 [2023-08-30 04:21:52,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:21:54,735 INFO L130 PetriNetUnfolder]: 17366/29233 cut-off events. [2023-08-30 04:21:54,736 INFO L131 PetriNetUnfolder]: For 152/152 co-relation queries the response was YES. [2023-08-30 04:21:54,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56097 conditions, 29233 events. 17366/29233 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 1072. Compared 231557 event pairs, 11890 based on Foata normal form. 0/14374 useless extension candidates. Maximal degree in co-relation 56092. Up to 18802 conditions per place. [2023-08-30 04:21:54,917 INFO L137 encePairwiseOnDemand]: 525/530 looper letters, 122 selfloop transitions, 2 changer transitions 0/142 dead transitions. [2023-08-30 04:21:54,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 142 transitions, 554 flow [2023-08-30 04:21:54,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 04:21:54,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 04:21:54,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 877 transitions. [2023-08-30 04:21:54,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5515723270440251 [2023-08-30 04:21:54,922 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 877 transitions. [2023-08-30 04:21:54,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 877 transitions. [2023-08-30 04:21:54,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:21:54,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 877 transitions. [2023-08-30 04:21:54,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:21:54,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 530.0) internal successors, (2120), 4 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:21:54,931 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 530.0) internal successors, (2120), 4 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:21:54,932 INFO L175 Difference]: Start difference. First operand has 98 places, 99 transitions, 220 flow. Second operand 3 states and 877 transitions. [2023-08-30 04:21:54,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 142 transitions, 554 flow [2023-08-30 04:21:54,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 142 transitions, 554 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 04:21:54,944 INFO L231 Difference]: Finished difference. Result has 100 places, 98 transitions, 228 flow [2023-08-30 04:21:54,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=100, PETRI_TRANSITIONS=98} [2023-08-30 04:21:54,945 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -1 predicate places. [2023-08-30 04:21:54,946 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 98 transitions, 228 flow [2023-08-30 04:21:54,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:21:54,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:21:54,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 04:21:54,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 04:21:54,947 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 04:21:54,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:21:54,950 INFO L85 PathProgramCache]: Analyzing trace with hash 35231, now seen corresponding path program 1 times [2023-08-30 04:21:54,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:21:54,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996758055] [2023-08-30 04:21:54,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:21:54,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:21:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:21:55,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:21:55,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:21:55,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996758055] [2023-08-30 04:21:55,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996758055] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 04:21:55,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 04:21:55,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 04:21:55,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530947911] [2023-08-30 04:21:55,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 04:21:55,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 04:21:55,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:21:55,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 04:21:55,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 04:21:55,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 530 [2023-08-30 04:21:55,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 98 transitions, 228 flow. Second operand has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:21:55,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:21:55,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 530 [2023-08-30 04:21:55,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:21:57,295 INFO L130 PetriNetUnfolder]: 17456/30109 cut-off events. [2023-08-30 04:21:57,295 INFO L131 PetriNetUnfolder]: For 878/878 co-relation queries the response was YES. [2023-08-30 04:21:57,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58242 conditions, 30109 events. 17456/30109 cut-off events. For 878/878 co-relation queries the response was YES. Maximal size of possible extension queue 1027. Compared 240120 event pairs, 16735 based on Foata normal form. 0/15597 useless extension candidates. Maximal degree in co-relation 58235. Up to 26725 conditions per place. [2023-08-30 04:21:57,458 INFO L137 encePairwiseOnDemand]: 526/530 looper letters, 79 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2023-08-30 04:21:57,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 99 transitions, 392 flow [2023-08-30 04:21:57,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 04:21:57,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 04:21:57,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 821 transitions. [2023-08-30 04:21:57,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5163522012578616 [2023-08-30 04:21:57,461 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 821 transitions. [2023-08-30 04:21:57,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 821 transitions. [2023-08-30 04:21:57,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:21:57,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 821 transitions. [2023-08-30 04:21:57,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 273.6666666666667) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:21:57,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 530.0) internal successors, (2120), 4 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:21:57,468 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 530.0) internal successors, (2120), 4 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:21:57,468 INFO L175 Difference]: Start difference. First operand has 100 places, 98 transitions, 228 flow. Second operand 3 states and 821 transitions. [2023-08-30 04:21:57,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 99 transitions, 392 flow [2023-08-30 04:21:57,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 99 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 04:21:57,480 INFO L231 Difference]: Finished difference. Result has 101 places, 99 transitions, 238 flow [2023-08-30 04:21:57,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=101, PETRI_TRANSITIONS=99} [2023-08-30 04:21:57,481 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, 0 predicate places. [2023-08-30 04:21:57,482 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 99 transitions, 238 flow [2023-08-30 04:21:57,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:21:57,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:21:57,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 04:21:57,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 04:21:57,483 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 04:21:57,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:21:57,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1093168, now seen corresponding path program 1 times [2023-08-30 04:21:57,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:21:57,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671590314] [2023-08-30 04:21:57,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:21:57,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:21:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:21:57,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:21:57,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:21:57,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671590314] [2023-08-30 04:21:57,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671590314] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 04:21:57,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012055755] [2023-08-30 04:21:57,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:21:57,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 04:21:57,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 04:21:57,755 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 04:21:57,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-30 04:21:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:21:57,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-30 04:21:57,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 04:21:57,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:21:57,983 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-30 04:21:58,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:21:58,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 04:22:02,177 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:22:02,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 64 [2023-08-30 04:22:08,304 WARN L222 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 04:22:08,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:22:08,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012055755] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 04:22:08,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 04:22:08,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2023-08-30 04:22:08,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642899547] [2023-08-30 04:22:08,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 04:22:08,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 04:22:08,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:22:08,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 04:22:08,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-08-30 04:22:09,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 530 [2023-08-30 04:22:09,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 99 transitions, 238 flow. Second operand has 8 states, 8 states have (on average 243.125) internal successors, (1945), 8 states have internal predecessors, (1945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:22:09,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:22:09,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 530 [2023-08-30 04:22:09,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:22:15,050 INFO L130 PetriNetUnfolder]: 42852/72873 cut-off events. [2023-08-30 04:22:15,050 INFO L131 PetriNetUnfolder]: For 644/644 co-relation queries the response was YES. [2023-08-30 04:22:15,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140418 conditions, 72873 events. 42852/72873 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 2463. Compared 652589 event pairs, 35276 based on Foata normal form. 0/34914 useless extension candidates. Maximal degree in co-relation 140410. Up to 27745 conditions per place. [2023-08-30 04:22:15,440 INFO L137 encePairwiseOnDemand]: 525/530 looper letters, 219 selfloop transitions, 7 changer transitions 0/244 dead transitions. [2023-08-30 04:22:15,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 244 transitions, 1028 flow [2023-08-30 04:22:15,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 04:22:15,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 04:22:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1682 transitions. [2023-08-30 04:22:15,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5289308176100629 [2023-08-30 04:22:15,445 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1682 transitions. [2023-08-30 04:22:15,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1682 transitions. [2023-08-30 04:22:15,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:22:15,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1682 transitions. [2023-08-30 04:22:15,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 280.3333333333333) internal successors, (1682), 6 states have internal predecessors, (1682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:22:15,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 530.0) internal successors, (3710), 7 states have internal predecessors, (3710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:22:15,457 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 530.0) internal successors, (3710), 7 states have internal predecessors, (3710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:22:15,457 INFO L175 Difference]: Start difference. First operand has 101 places, 99 transitions, 238 flow. Second operand 6 states and 1682 transitions. [2023-08-30 04:22:15,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 244 transitions, 1028 flow [2023-08-30 04:22:15,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 244 transitions, 1024 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 04:22:15,466 INFO L231 Difference]: Finished difference. Result has 108 places, 104 transitions, 286 flow [2023-08-30 04:22:15,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=286, PETRI_PLACES=108, PETRI_TRANSITIONS=104} [2023-08-30 04:22:15,467 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, 7 predicate places. [2023-08-30 04:22:15,468 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 104 transitions, 286 flow [2023-08-30 04:22:15,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 243.125) internal successors, (1945), 8 states have internal predecessors, (1945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:22:15,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:22:15,469 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2023-08-30 04:22:15,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-30 04:22:15,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 04:22:15,676 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 04:22:15,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:22:15,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1050564881, now seen corresponding path program 1 times [2023-08-30 04:22:15,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:22:15,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855348271] [2023-08-30 04:22:15,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:22:15,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:22:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:22:15,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 04:22:15,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:22:15,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855348271] [2023-08-30 04:22:15,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855348271] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 04:22:15,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 04:22:15,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 04:22:15,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659685927] [2023-08-30 04:22:15,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 04:22:15,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 04:22:15,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:22:15,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 04:22:15,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 04:22:15,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 530 [2023-08-30 04:22:15,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 104 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:22:15,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:22:15,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 530 [2023-08-30 04:22:15,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:22:20,250 INFO L130 PetriNetUnfolder]: 39927/67851 cut-off events. [2023-08-30 04:22:20,251 INFO L131 PetriNetUnfolder]: For 2158/2158 co-relation queries the response was YES. [2023-08-30 04:22:20,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133507 conditions, 67851 events. 39927/67851 cut-off events. For 2158/2158 co-relation queries the response was YES. Maximal size of possible extension queue 2295. Compared 601418 event pairs, 32453 based on Foata normal form. 0/34604 useless extension candidates. Maximal degree in co-relation 133496. Up to 51942 conditions per place. [2023-08-30 04:22:20,600 INFO L137 encePairwiseOnDemand]: 526/530 looper letters, 124 selfloop transitions, 4 changer transitions 0/146 dead transitions. [2023-08-30 04:22:20,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 146 transitions, 626 flow [2023-08-30 04:22:20,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 04:22:20,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 04:22:20,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 862 transitions. [2023-08-30 04:22:20,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5421383647798742 [2023-08-30 04:22:20,603 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 862 transitions. [2023-08-30 04:22:20,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 862 transitions. [2023-08-30 04:22:20,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:22:20,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 862 transitions. [2023-08-30 04:22:20,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:22:20,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 530.0) internal successors, (2120), 4 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:22:20,610 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 530.0) internal successors, (2120), 4 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:22:20,610 INFO L175 Difference]: Start difference. First operand has 108 places, 104 transitions, 286 flow. Second operand 3 states and 862 transitions. [2023-08-30 04:22:20,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 146 transitions, 626 flow [2023-08-30 04:22:20,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 146 transitions, 620 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 04:22:20,618 INFO L231 Difference]: Finished difference. Result has 107 places, 102 transitions, 284 flow [2023-08-30 04:22:20,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=107, PETRI_TRANSITIONS=102} [2023-08-30 04:22:20,619 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, 6 predicate places. [2023-08-30 04:22:20,619 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 284 flow [2023-08-30 04:22:20,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:22:20,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:22:20,620 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2023-08-30 04:22:20,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 04:22:20,620 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 04:22:20,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:22:20,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1050564882, now seen corresponding path program 1 times [2023-08-30 04:22:20,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:22:20,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549693832] [2023-08-30 04:22:20,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:22:20,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:22:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:22:20,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:22:20,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:22:20,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549693832] [2023-08-30 04:22:20,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549693832] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 04:22:20,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784771921] [2023-08-30 04:22:20,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:22:20,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 04:22:20,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 04:22:20,709 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 04:22:20,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-30 04:22:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:22:20,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 04:22:20,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 04:22:20,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:22:20,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 04:22:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:22:20,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784771921] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 04:22:20,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 04:22:20,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-08-30 04:22:20,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676303022] [2023-08-30 04:22:20,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 04:22:20,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 04:22:20,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:22:20,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 04:22:20,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-08-30 04:22:20,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 530 [2023-08-30 04:22:20,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 284 flow. Second operand has 9 states, 9 states have (on average 251.22222222222223) internal successors, (2261), 9 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:22:20,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:22:20,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 530 [2023-08-30 04:22:20,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:22:22,860 INFO L130 PetriNetUnfolder]: 16482/28442 cut-off events. [2023-08-30 04:22:22,860 INFO L131 PetriNetUnfolder]: For 1909/1909 co-relation queries the response was YES. [2023-08-30 04:22:22,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55641 conditions, 28442 events. 16482/28442 cut-off events. For 1909/1909 co-relation queries the response was YES. Maximal size of possible extension queue 970. Compared 224738 event pairs, 15794 based on Foata normal form. 4/15009 useless extension candidates. Maximal degree in co-relation 55629. Up to 25239 conditions per place. [2023-08-30 04:22:23,059 INFO L137 encePairwiseOnDemand]: 526/530 looper letters, 78 selfloop transitions, 8 changer transitions 0/104 dead transitions. [2023-08-30 04:22:23,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 104 transitions, 472 flow [2023-08-30 04:22:23,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 04:22:23,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 04:22:23,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2090 transitions. [2023-08-30 04:22:23,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49292452830188677 [2023-08-30 04:22:23,065 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2090 transitions. [2023-08-30 04:22:23,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2090 transitions. [2023-08-30 04:22:23,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:22:23,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2090 transitions. [2023-08-30 04:22:23,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 261.25) internal successors, (2090), 8 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:22:23,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 530.0) internal successors, (4770), 9 states have internal predecessors, (4770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:22:23,078 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 530.0) internal successors, (4770), 9 states have internal predecessors, (4770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:22:23,078 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 284 flow. Second operand 8 states and 2090 transitions. [2023-08-30 04:22:23,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 104 transitions, 472 flow [2023-08-30 04:22:23,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 104 transitions, 458 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-30 04:22:23,089 INFO L231 Difference]: Finished difference. Result has 117 places, 103 transitions, 316 flow [2023-08-30 04:22:23,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=316, PETRI_PLACES=117, PETRI_TRANSITIONS=103} [2023-08-30 04:22:23,092 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, 16 predicate places. [2023-08-30 04:22:23,092 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 103 transitions, 316 flow [2023-08-30 04:22:23,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 251.22222222222223) internal successors, (2261), 9 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:22:23,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:22:23,093 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1] [2023-08-30 04:22:23,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-30 04:22:23,299 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,SelfDestructingSolverStorable5 [2023-08-30 04:22:23,299 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 04:22:23,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:22:23,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1792170529, now seen corresponding path program 2 times [2023-08-30 04:22:23,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:22:23,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640524932] [2023-08-30 04:22:23,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:22:23,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:22:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:22:24,073 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:22:24,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:22:24,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640524932] [2023-08-30 04:22:24,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640524932] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 04:22:24,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067675225] [2023-08-30 04:22:24,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 04:22:24,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 04:22:24,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 04:22:24,076 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 04:22:24,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-30 04:22:24,241 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 04:22:24,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 04:22:24,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 51 conjunts are in the unsatisfiable core [2023-08-30 04:22:24,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 04:22:24,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:22:24,327 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-30 04:22:24,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:22:24,370 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-30 04:22:24,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:22:24,418 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-30 04:22:24,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:22:24,473 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-30 04:22:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:22:24,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 04:22:28,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:22:28,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 64 [2023-08-30 04:22:32,833 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:22:32,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 70 [2023-08-30 04:22:35,068 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:22:35,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 76 [2023-08-30 04:22:39,277 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:22:39,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 82 [2023-08-30 04:22:43,459 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:22:43,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067675225] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 04:22:43,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 04:22:43,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2023-08-30 04:22:43,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252201846] [2023-08-30 04:22:43,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 04:22:43,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-30 04:22:43,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:22:43,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-30 04:22:43,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-08-30 04:22:49,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:22:53,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 530 [2023-08-30 04:22:53,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 103 transitions, 316 flow. Second operand has 17 states, 17 states have (on average 236.05882352941177) internal successors, (4013), 17 states have internal predecessors, (4013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:22:53,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:22:53,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 530 [2023-08-30 04:22:53,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:22:59,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:23:01,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:23:02,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:23:03,899 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 [1] [2023-08-30 04:23:05,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:23:06,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:23:07,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:23:18,414 INFO L130 PetriNetUnfolder]: 63407/107180 cut-off events. [2023-08-30 04:23:18,414 INFO L131 PetriNetUnfolder]: For 1146/1146 co-relation queries the response was YES. [2023-08-30 04:23:18,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207184 conditions, 107180 events. 63407/107180 cut-off events. For 1146/1146 co-relation queries the response was YES. Maximal size of possible extension queue 3412. Compared 1001074 event pairs, 48076 based on Foata normal form. 6/52191 useless extension candidates. Maximal degree in co-relation 207168. Up to 27284 conditions per place. [2023-08-30 04:23:19,114 INFO L137 encePairwiseOnDemand]: 523/530 looper letters, 361 selfloop transitions, 19 changer transitions 0/398 dead transitions. [2023-08-30 04:23:19,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 398 transitions, 1804 flow [2023-08-30 04:23:19,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-30 04:23:19,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-30 04:23:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3911 transitions. [2023-08-30 04:23:19,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4919496855345912 [2023-08-30 04:23:19,123 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3911 transitions. [2023-08-30 04:23:19,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3911 transitions. [2023-08-30 04:23:19,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:23:19,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3911 transitions. [2023-08-30 04:23:19,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 260.73333333333335) internal successors, (3911), 15 states have internal predecessors, (3911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:23:19,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 530.0) internal successors, (8480), 16 states have internal predecessors, (8480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:23:19,139 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 530.0) internal successors, (8480), 16 states have internal predecessors, (8480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:23:19,139 INFO L175 Difference]: Start difference. First operand has 117 places, 103 transitions, 316 flow. Second operand 15 states and 3911 transitions. [2023-08-30 04:23:19,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 398 transitions, 1804 flow [2023-08-30 04:23:19,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 398 transitions, 1763 flow, removed 12 selfloop flow, removed 8 redundant places. [2023-08-30 04:23:19,145 INFO L231 Difference]: Finished difference. Result has 128 places, 114 transitions, 400 flow [2023-08-30 04:23:19,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=400, PETRI_PLACES=128, PETRI_TRANSITIONS=114} [2023-08-30 04:23:19,146 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, 27 predicate places. [2023-08-30 04:23:19,146 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 114 transitions, 400 flow [2023-08-30 04:23:19,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 236.05882352941177) internal successors, (4013), 17 states have internal predecessors, (4013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:23:19,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:23:19,148 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1] [2023-08-30 04:23:19,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-30 04:23:19,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 04:23:19,361 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 04:23:19,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:23:19,361 INFO L85 PathProgramCache]: Analyzing trace with hash 187225298, now seen corresponding path program 2 times [2023-08-30 04:23:19,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:23:19,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146251047] [2023-08-30 04:23:19,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:23:19,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:23:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:23:19,573 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:23:19,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:23:19,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146251047] [2023-08-30 04:23:19,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146251047] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 04:23:19,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213913399] [2023-08-30 04:23:19,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 04:23:19,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 04:23:19,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 04:23:19,575 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 04:23:19,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-30 04:23:19,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 04:23:19,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 04:23:19,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 04:23:19,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 04:23:19,721 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-30 04:23:19,733 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-08-30 04:23:19,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 04:23:19,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213913399] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 04:23:19,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 04:23:19,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 10 [2023-08-30 04:23:19,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748425664] [2023-08-30 04:23:19,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 04:23:19,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 04:23:19,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:23:19,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 04:23:19,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-08-30 04:23:19,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 530 [2023-08-30 04:23:19,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 114 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:23:19,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:23:19,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 530 [2023-08-30 04:23:19,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:23:27,453 INFO L130 PetriNetUnfolder]: 62737/105368 cut-off events. [2023-08-30 04:23:27,453 INFO L131 PetriNetUnfolder]: For 5795/5795 co-relation queries the response was YES. [2023-08-30 04:23:27,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209589 conditions, 105368 events. 62737/105368 cut-off events. For 5795/5795 co-relation queries the response was YES. Maximal size of possible extension queue 3060. Compared 960085 event pairs, 56559 based on Foata normal form. 5/54497 useless extension candidates. Maximal degree in co-relation 209570. Up to 94930 conditions per place. [2023-08-30 04:23:28,073 INFO L137 encePairwiseOnDemand]: 525/530 looper letters, 95 selfloop transitions, 5 changer transitions 0/118 dead transitions. [2023-08-30 04:23:28,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 118 transitions, 613 flow [2023-08-30 04:23:28,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 04:23:28,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 04:23:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 827 transitions. [2023-08-30 04:23:28,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.520125786163522 [2023-08-30 04:23:28,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 827 transitions. [2023-08-30 04:23:28,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 827 transitions. [2023-08-30 04:23:28,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:23:28,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 827 transitions. [2023-08-30 04:23:28,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:23:28,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 530.0) internal successors, (2120), 4 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:23:28,087 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 530.0) internal successors, (2120), 4 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:23:28,087 INFO L175 Difference]: Start difference. First operand has 128 places, 114 transitions, 400 flow. Second operand 3 states and 827 transitions. [2023-08-30 04:23:28,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 118 transitions, 613 flow [2023-08-30 04:23:28,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 118 transitions, 574 flow, removed 13 selfloop flow, removed 6 redundant places. [2023-08-30 04:23:28,094 INFO L231 Difference]: Finished difference. Result has 125 places, 117 transitions, 401 flow [2023-08-30 04:23:28,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=401, PETRI_PLACES=125, PETRI_TRANSITIONS=117} [2023-08-30 04:23:28,096 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, 24 predicate places. [2023-08-30 04:23:28,096 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 117 transitions, 401 flow [2023-08-30 04:23:28,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:23:28,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:23:28,097 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1] [2023-08-30 04:23:28,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-30 04:23:28,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 04:23:28,298 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 04:23:28,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:23:28,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1479338945, now seen corresponding path program 3 times [2023-08-30 04:23:28,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:23:28,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286786004] [2023-08-30 04:23:28,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:23:28,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:23:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:23:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:23:30,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:23:30,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286786004] [2023-08-30 04:23:30,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286786004] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 04:23:30,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932176547] [2023-08-30 04:23:30,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 04:23:30,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 04:23:30,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 04:23:30,409 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 04:23:30,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-30 04:23:41,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-08-30 04:23:41,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 04:23:41,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 820 conjuncts, 118 conjunts are in the unsatisfiable core [2023-08-30 04:23:41,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 04:23:41,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:23:41,250 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-30 04:23:41,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:23:41,295 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-30 04:23:41,312 INFO L321 Elim1Store]: treesize reduction 24, result has 14.3 percent of original size [2023-08-30 04:23:41,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 16 [2023-08-30 04:23:41,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:23:41,353 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-30 04:23:41,370 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 04:23:41,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-30 04:23:41,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:23:41,422 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-30 04:23:41,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:23:41,456 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-30 04:23:41,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:23:41,501 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-30 04:23:41,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:23:41,537 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-30 04:23:41,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:23:41,578 INFO L321 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2023-08-30 04:23:41,578 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 1 case distinctions, treesize of input 12 treesize of output 14 [2023-08-30 04:23:41,619 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-30 04:23:41,640 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-08-30 04:23:41,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 34 [2023-08-30 04:23:41,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:23:41,826 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2023-08-30 04:23:41,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 56 [2023-08-30 04:23:41,841 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 04:23:41,841 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-30 04:23:41,880 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:23:41,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 04:23:41,965 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-30 04:23:41,965 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 13 treesize of output 12 [2023-08-30 04:23:42,058 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-30 04:23:42,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2023-08-30 04:23:42,483 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-30 04:23:42,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-08-30 04:23:42,672 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-30 04:23:42,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-08-30 04:23:42,915 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-30 04:23:42,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-08-30 04:23:45,758 INFO L321 Elim1Store]: treesize reduction 31, result has 36.7 percent of original size [2023-08-30 04:23:45,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 86 [2023-08-30 04:23:49,726 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:23:49,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932176547] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 04:23:49,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 04:23:49,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-30 04:23:49,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587203078] [2023-08-30 04:23:49,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 04:23:49,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-30 04:23:49,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:23:49,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-30 04:23:49,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=939, Unknown=2, NotChecked=0, Total=1190 [2023-08-30 04:23:51,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:23:53,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:23:56,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:23:58,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:24:00,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:24:02,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:24:04,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:24:07,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:24:09,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:24:12,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:24:15,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:24:17,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:24:19,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:24:21,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:24:23,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:24:25,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:24:27,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:24:29,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:24:34,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:24:36,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:24:40,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:24:42,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:24:45,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:24:47,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:24:50,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:24:52,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:24:55,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:24:57,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:25:00,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:25:02,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:25:04,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:25:06,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:25:09,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:25:11,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:25:13,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:25:16,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:25:18,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:25:21,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:25:23,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:25:25,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:25:29,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:25:32,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:25:34,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:25:37,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:25:39,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:25:41,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:25:43,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:25:46,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:25:48,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 [1] [2023-08-30 04:25:52,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:25:54,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:25:56,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:25:58,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:26:00,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:26:02,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:26:04,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:26:07,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:26:09,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:26:11,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:26:13,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:26:16,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:26:18,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:26:20,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:26:22,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:26:25,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:26:27,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:26:29,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:26:31,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:26:34,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:26:36,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:26:38,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:26:40,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:26:42,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:26:44,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:26:46,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:26:47,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 530 [2023-08-30 04:26:47,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 117 transitions, 401 flow. Second operand has 35 states, 35 states have (on average 180.02857142857144) internal successors, (6301), 35 states have internal predecessors, (6301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:26:47,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:26:47,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 530 [2023-08-30 04:26:47,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:26:56,859 WARN L222 SmtUtils]: Spent 5.82s on a formula simplification. DAG size of input: 260 DAG size of output: 246 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 04:27:09,053 WARN L222 SmtUtils]: Spent 9.31s on a formula simplification. DAG size of input: 230 DAG size of output: 218 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 04:27:11,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:27:13,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:27:15,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 [1] [2023-08-30 04:27:17,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:27:20,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:27:22,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:27:24,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:27:35,439 WARN L222 SmtUtils]: Spent 6.31s on a formula simplification. DAG size of input: 76 DAG size of output: 75 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 04:27:47,618 WARN L222 SmtUtils]: Spent 7.47s on a formula simplification. DAG size of input: 193 DAG size of output: 183 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 04:27:49,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:27:51,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 [1] [2023-08-30 04:27:53,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:27:55,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:27:58,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:28:00,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:28:20,180 WARN L222 SmtUtils]: Spent 12.86s on a formula simplification. DAG size of input: 164 DAG size of output: 156 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 04:28:22,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:28:24,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:28:25,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:28:27,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:28:30,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:28:47,260 WARN L222 SmtUtils]: Spent 10.32s on a formula simplification. DAG size of input: 95 DAG size of output: 93 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 04:29:05,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:29:07,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:29:10,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:29:33,187 WARN L222 SmtUtils]: Spent 9.27s on a formula simplification. DAG size of input: 117 DAG size of output: 113 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 04:29:35,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:29:37,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:29:41,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:29:45,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:29:59,126 WARN L222 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 60 DAG size of output: 58 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 04:30:13,781 WARN L222 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 43 DAG size of output: 41 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 04:30:38,103 INFO L130 PetriNetUnfolder]: 92362/148388 cut-off events. [2023-08-30 04:30:38,103 INFO L131 PetriNetUnfolder]: For 15089/15089 co-relation queries the response was YES. [2023-08-30 04:30:38,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304051 conditions, 148388 events. 92362/148388 cut-off events. For 15089/15089 co-relation queries the response was YES. Maximal size of possible extension queue 3723. Compared 1310955 event pairs, 69070 based on Foata normal form. 17/75168 useless extension candidates. Maximal degree in co-relation 304030. Up to 32958 conditions per place. [2023-08-30 04:30:39,077 INFO L137 encePairwiseOnDemand]: 524/530 looper letters, 555 selfloop transitions, 37 changer transitions 0/604 dead transitions. [2023-08-30 04:30:39,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 604 transitions, 2999 flow [2023-08-30 04:30:39,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-30 04:30:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-30 04:30:39,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 5431 transitions. [2023-08-30 04:30:39,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3795248078266946 [2023-08-30 04:30:39,086 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 5431 transitions. [2023-08-30 04:30:39,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 5431 transitions. [2023-08-30 04:30:39,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:30:39,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 5431 transitions. [2023-08-30 04:30:39,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 201.14814814814815) internal successors, (5431), 27 states have internal predecessors, (5431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:30:39,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 530.0) internal successors, (14840), 28 states have internal predecessors, (14840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:30:39,123 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 530.0) internal successors, (14840), 28 states have internal predecessors, (14840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:30:39,123 INFO L175 Difference]: Start difference. First operand has 125 places, 117 transitions, 401 flow. Second operand 27 states and 5431 transitions. [2023-08-30 04:30:39,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 604 transitions, 2999 flow [2023-08-30 04:30:39,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 604 transitions, 2899 flow, removed 38 selfloop flow, removed 2 redundant places. [2023-08-30 04:30:39,355 INFO L231 Difference]: Finished difference. Result has 157 places, 133 transitions, 680 flow [2023-08-30 04:30:39,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=680, PETRI_PLACES=157, PETRI_TRANSITIONS=133} [2023-08-30 04:30:39,356 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, 56 predicate places. [2023-08-30 04:30:39,357 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 133 transitions, 680 flow [2023-08-30 04:30:39,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 180.02857142857144) internal successors, (6301), 35 states have internal predecessors, (6301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:30:39,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:30:39,358 INFO L208 CegarLoopForPetriNet]: trace histogram [11, 1, 1, 1, 1, 1, 1] [2023-08-30 04:30:39,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-30 04:30:39,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 04:30:39,560 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 04:30:39,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:30:39,561 INFO L85 PathProgramCache]: Analyzing trace with hash 110153793, now seen corresponding path program 1 times [2023-08-30 04:30:39,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:30:39,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947352075] [2023-08-30 04:30:39,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:30:39,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:30:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:30:39,981 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 04:30:39,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:30:39,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947352075] [2023-08-30 04:30:39,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947352075] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 04:30:39,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335698804] [2023-08-30 04:30:39,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:30:39,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 04:30:39,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 04:30:39,985 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 04:30:40,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-30 04:30:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:30:40,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-30 04:30:40,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 04:30:40,335 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 04:30:40,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 04:30:40,574 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 04:30:40,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335698804] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 04:30:40,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 04:30:40,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2023-08-30 04:30:40,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793881478] [2023-08-30 04:30:40,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 04:30:40,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-30 04:30:40,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:30:40,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-30 04:30:40,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2023-08-30 04:30:40,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 530 [2023-08-30 04:30:40,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 133 transitions, 680 flow. Second operand has 27 states, 27 states have (on average 251.1851851851852) internal successors, (6782), 27 states have internal predecessors, (6782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:30:40,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:30:40,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 530 [2023-08-30 04:30:40,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:30:43,413 INFO L130 PetriNetUnfolder]: 16330/27607 cut-off events. [2023-08-30 04:30:43,413 INFO L131 PetriNetUnfolder]: For 3761/3761 co-relation queries the response was YES. [2023-08-30 04:30:43,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55229 conditions, 27607 events. 16330/27607 cut-off events. For 3761/3761 co-relation queries the response was YES. Maximal size of possible extension queue 836. Compared 209479 event pairs, 15667 based on Foata normal form. 13/14880 useless extension candidates. Maximal degree in co-relation 55198. Up to 24942 conditions per place. [2023-08-30 04:30:43,596 INFO L137 encePairwiseOnDemand]: 526/530 looper letters, 80 selfloop transitions, 26 changer transitions 0/124 dead transitions. [2023-08-30 04:30:43,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 124 transitions, 778 flow [2023-08-30 04:30:43,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-30 04:30:43,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-30 04:30:43,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 6617 transitions. [2023-08-30 04:30:43,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.480188679245283 [2023-08-30 04:30:43,605 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 6617 transitions. [2023-08-30 04:30:43,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 6617 transitions. [2023-08-30 04:30:43,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:30:43,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 6617 transitions. [2023-08-30 04:30:43,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 254.5) internal successors, (6617), 26 states have internal predecessors, (6617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:30:43,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 530.0) internal successors, (14310), 27 states have internal predecessors, (14310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:30:43,631 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 530.0) internal successors, (14310), 27 states have internal predecessors, (14310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:30:43,632 INFO L175 Difference]: Start difference. First operand has 157 places, 133 transitions, 680 flow. Second operand 26 states and 6617 transitions. [2023-08-30 04:30:43,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 124 transitions, 778 flow [2023-08-30 04:30:43,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 124 transitions, 611 flow, removed 66 selfloop flow, removed 16 redundant places. [2023-08-30 04:30:43,644 INFO L231 Difference]: Finished difference. Result has 172 places, 123 transitions, 476 flow [2023-08-30 04:30:43,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=476, PETRI_PLACES=172, PETRI_TRANSITIONS=123} [2023-08-30 04:30:43,645 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, 71 predicate places. [2023-08-30 04:30:43,645 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 123 transitions, 476 flow [2023-08-30 04:30:43,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 251.1851851851852) internal successors, (6782), 27 states have internal predecessors, (6782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:30:43,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:30:43,647 INFO L208 CegarLoopForPetriNet]: trace histogram [22, 1, 1] [2023-08-30 04:30:43,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-30 04:30:43,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 04:30:43,854 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 04:30:43,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:30:43,855 INFO L85 PathProgramCache]: Analyzing trace with hash 798431487, now seen corresponding path program 4 times [2023-08-30 04:30:43,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:30:43,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147600431] [2023-08-30 04:30:43,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:30:43,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:30:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:30:50,231 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:30:50,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:30:50,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147600431] [2023-08-30 04:30:50,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147600431] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 04:30:50,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771970478] [2023-08-30 04:30:50,232 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 04:30:50,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 04:30:50,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 04:30:50,233 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 04:30:50,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-30 04:30:50,647 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 04:30:50,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 04:30:50,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 1648 conjuncts, 215 conjunts are in the unsatisfiable core [2023-08-30 04:30:50,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 04:30:50,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:30:50,729 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-30 04:30:50,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:30:50,779 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-30 04:30:50,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:30:50,844 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-30 04:30:50,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:30:50,907 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-30 04:30:50,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:30:50,959 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-30 04:30:51,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:30:51,031 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-30 04:30:51,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:30:51,092 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-30 04:30:51,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:30:51,148 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-30 04:30:51,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:30:51,199 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-30 04:30:51,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:30:51,260 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-30 04:30:51,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:30:51,323 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-30 04:30:51,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:30:51,383 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-30 04:30:51,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:30:51,441 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-30 04:30:51,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:30:51,508 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-30 04:30:51,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:30:51,575 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-30 04:30:51,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:30:51,634 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-30 04:30:51,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:30:51,702 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-30 04:30:51,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:30:51,781 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-30 04:30:51,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:30:51,857 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-30 04:30:51,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:30:51,927 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-30 04:30:52,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:30:52,004 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-30 04:30:52,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:30:52,081 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-30 04:30:52,138 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:30:52,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 04:30:56,263 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:30:56,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 64 [2023-08-30 04:31:00,503 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:31:00,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 70 [2023-08-30 04:31:06,689 WARN L222 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 04:31:06,792 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:31:06,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 76 [2023-08-30 04:31:15,212 WARN L222 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 43 DAG size of output: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 04:31:15,251 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:31:15,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 82 [2023-08-30 04:31:19,510 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:31:19,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 88 [2023-08-30 04:31:25,962 WARN L222 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 51 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 04:31:26,015 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:31:26,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 94 [2023-08-30 04:31:30,347 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:31:30,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 100 [2023-08-30 04:31:30,871 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:31:30,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 106 [2023-08-30 04:31:34,385 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:31:34,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 112 [2023-08-30 04:31:35,038 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:31:35,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 118 [2023-08-30 04:31:37,598 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:31:37,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 124 [2023-08-30 04:31:38,203 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:31:38,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 130 [2023-08-30 04:31:39,314 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:31:39,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 136 [2023-08-30 04:31:47,442 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:31:47,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 142 [2023-08-30 04:31:52,225 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:31:52,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 148 [2023-08-30 04:31:55,124 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:31:55,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 154 [2023-08-30 04:32:06,903 WARN L222 SmtUtils]: Spent 10.08s on a formula simplification. DAG size of input: 95 DAG size of output: 92 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 04:32:07,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:32:07,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 160 [2023-08-30 04:32:15,427 WARN L222 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 99 DAG size of output: 96 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 04:32:15,594 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:32:15,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 166 [2023-08-30 04:32:22,522 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:32:22,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 172 [2023-08-30 04:32:28,073 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:32:28,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 178 [2023-08-30 04:32:36,386 WARN L222 SmtUtils]: Spent 6.08s on a formula simplification. DAG size of input: 111 DAG size of output: 108 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 04:32:36,567 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:32:36,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 184 [2023-08-30 04:32:44,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:32:44,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 172 treesize of output 190 [2023-08-30 04:32:51,427 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-08-30 04:32:51,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-30 04:32:51,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 04:32:51,629 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Probably an infinite loop! at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtils.preprocessDualFiniteJunction(QuantifierPushUtils.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:323) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-08-30 04:32:51,633 INFO L158 Benchmark]: Toolchain (without parser) took 674595.29ms. Allocated memory was 75.5MB in the beginning and 14.1GB in the end (delta: 14.0GB). Free memory was 51.0MB in the beginning and 4.0GB in the end (delta: -4.0GB). Peak memory consumption was 10.0GB. Max. memory is 16.1GB. [2023-08-30 04:32:51,633 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 60.8MB. Free memory is still 39.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 04:32:51,633 INFO L158 Benchmark]: CACSL2BoogieTranslator took 715.82ms. Allocated memory is still 75.5MB. Free memory was 50.8MB in the beginning and 32.0MB in the end (delta: 18.8MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2023-08-30 04:32:51,633 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.37ms. Allocated memory is still 75.5MB. Free memory was 32.0MB in the beginning and 53.9MB in the end (delta: -22.0MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2023-08-30 04:32:51,634 INFO L158 Benchmark]: Boogie Preprocessor took 68.92ms. Allocated memory is still 75.5MB. Free memory was 53.9MB in the beginning and 51.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 04:32:51,634 INFO L158 Benchmark]: RCFGBuilder took 668.20ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 51.8MB in the beginning and 63.8MB in the end (delta: -11.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-08-30 04:32:51,634 INFO L158 Benchmark]: TraceAbstraction took 673051.34ms. Allocated memory was 92.3MB in the beginning and 14.1GB in the end (delta: 14.0GB). Free memory was 62.8MB in the beginning and 4.0GB in the end (delta: -4.0GB). Peak memory consumption was 10.0GB. Max. memory is 16.1GB. [2023-08-30 04:32:51,635 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 60.8MB. Free memory is still 39.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 715.82ms. Allocated memory is still 75.5MB. Free memory was 50.8MB in the beginning and 32.0MB in the end (delta: 18.8MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.37ms. Allocated memory is still 75.5MB. Free memory was 32.0MB in the beginning and 53.9MB in the end (delta: -22.0MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.92ms. Allocated memory is still 75.5MB. Free memory was 53.9MB in the beginning and 51.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 668.20ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 51.8MB in the beginning and 63.8MB in the end (delta: -11.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 673051.34ms. Allocated memory was 92.3MB in the beginning and 14.1GB in the end (delta: 14.0GB). Free memory was 62.8MB in the beginning and 4.0GB in the end (delta: -4.0GB). Peak memory consumption was 10.0GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.2s, 259 PlacesBefore, 101 PlacesAfterwards, 279 TransitionsBefore, 114 TransitionsAfterwards, 25622 CoEnabledTransitionPairs, 6 FixpointIterations, 65 TrivialSequentialCompositions, 158 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 19 ConcurrentYvCompositions, 7 ChoiceCompositions, 251 TotalNumberOfCompositions, 63228 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 31961, independent: 31344, independent conditional: 0, independent unconditional: 31344, dependent: 617, dependent conditional: 0, dependent unconditional: 617, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12457, independent: 12322, independent conditional: 0, independent unconditional: 12322, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 31961, independent: 19022, independent conditional: 0, independent unconditional: 19022, dependent: 482, dependent conditional: 0, dependent unconditional: 482, unknown: 12457, unknown conditional: 0, unknown unconditional: 12457] , Statistics on independence cache: Total cache size (in pairs): 1523, Positive cache size: 1459, Positive conditional cache size: 0, Positive unconditional cache size: 1459, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: AssertionError: Probably an infinite loop! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Probably an infinite loop!: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtils.preprocessDualFiniteJunction(QuantifierPushUtils.java:124) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-08-30 04:32:51,850 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-30 04:32:51,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_86-lists_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 db5eab03de8fef3e653289c5dcf0b220be6d8b09a4df3c07d6d5a066426e755a --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 04:32:54,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 04:32:54,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 04:32:54,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 04:32:54,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 04:32:54,375 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 04:32:54,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 04:32:54,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 04:32:54,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 04:32:54,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 04:32:54,388 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 04:32:54,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 04:32:54,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 04:32:54,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 04:32:54,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 04:32:54,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 04:32:54,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 04:32:54,400 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 04:32:54,401 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 04:32:54,406 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 04:32:54,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 04:32:54,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 04:32:54,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 04:32:54,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 04:32:54,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 04:32:54,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 04:32:54,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 04:32:54,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 04:32:54,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 04:32:54,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 04:32:54,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 04:32:54,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 04:32:54,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 04:32:54,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 04:32:54,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 04:32:54,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 04:32:54,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 04:32:54,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 04:32:54,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 04:32:54,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 04:32:54,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 04:32:54,430 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 04:32:54,462 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 04:32:54,463 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 04:32:54,464 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 04:32:54,464 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 04:32:54,465 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 04:32:54,465 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 04:32:54,466 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 04:32:54,466 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 04:32:54,466 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 04:32:54,466 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 04:32:54,467 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 04:32:54,468 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 04:32:54,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 04:32:54,468 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 04:32:54,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 04:32:54,468 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 04:32:54,469 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 04:32:54,469 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 04:32:54,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 04:32:54,469 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 04:32:54,469 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 04:32:54,470 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 04:32:54,470 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 04:32:54,470 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 04:32:54,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 04:32:54,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 04:32:54,471 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 04:32:54,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 04:32:54,471 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 04:32:54,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 04:32:54,472 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 04:32:54,472 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 04:32:54,472 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 04:32:54,473 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 04:32:54,473 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 04:32:54,473 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 04:32:54,473 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 04:32:54,474 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 -> db5eab03de8fef3e653289c5dcf0b220be6d8b09a4df3c07d6d5a066426e755a Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 04:32:54,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 04:32:54,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 04:32:54,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 04:32:54,840 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 04:32:54,841 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 04:32:54,842 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_86-lists_racing.i [2023-08-30 04:32:55,950 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 04:32:56,209 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 04:32:56,209 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_86-lists_racing.i [2023-08-30 04:32:56,225 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fde88275/93f434f5fd3f457baec232bdda8d1185/FLAG94ca1b63f [2023-08-30 04:32:56,237 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fde88275/93f434f5fd3f457baec232bdda8d1185 [2023-08-30 04:32:56,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 04:32:56,240 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 04:32:56,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 04:32:56,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 04:32:56,244 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 04:32:56,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:32:56" (1/1) ... [2023-08-30 04:32:56,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aebb1d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:32:56, skipping insertion in model container [2023-08-30 04:32:56,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:32:56" (1/1) ... [2023-08-30 04:32:56,251 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 04:32:56,302 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 04:32:56,687 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_86-lists_racing.i[47038,47051] [2023-08-30 04:32:56,738 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 04:32:56,812 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 04:32:56,852 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_86-lists_racing.i[47038,47051] [2023-08-30 04:32:56,872 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 04:32:56,936 INFO L208 MainTranslator]: Completed translation [2023-08-30 04:32:56,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:32:56 WrapperNode [2023-08-30 04:32:56,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 04:32:56,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 04:32:56,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 04:32:56,938 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 04:32:56,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:32:56" (1/1) ... [2023-08-30 04:32:56,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:32:56" (1/1) ... [2023-08-30 04:32:57,004 INFO L138 Inliner]: procedures = 282, calls = 60, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 228 [2023-08-30 04:32:57,005 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 04:32:57,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 04:32:57,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 04:32:57,007 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 04:32:57,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:32:56" (1/1) ... [2023-08-30 04:32:57,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:32:56" (1/1) ... [2023-08-30 04:32:57,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:32:56" (1/1) ... [2023-08-30 04:32:57,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:32:56" (1/1) ... [2023-08-30 04:32:57,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:32:56" (1/1) ... [2023-08-30 04:32:57,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:32:56" (1/1) ... [2023-08-30 04:32:57,076 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:32:56" (1/1) ... [2023-08-30 04:32:57,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:32:56" (1/1) ... [2023-08-30 04:32:57,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 04:32:57,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 04:32:57,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 04:32:57,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 04:32:57,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:32:56" (1/1) ... [2023-08-30 04:32:57,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 04:32:57,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 04:32:57,130 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 04:32:57,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 04:32:57,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-30 04:32:57,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 04:32:57,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-08-30 04:32:57,173 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2023-08-30 04:32:57,173 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2023-08-30 04:32:57,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 04:32:57,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 04:32:57,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 04:32:57,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-30 04:32:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2023-08-30 04:32:57,174 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2023-08-30 04:32:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-30 04:32:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-30 04:32:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 04:32:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-08-30 04:32:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 04:32:57,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 04:32:57,176 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 04:32:57,419 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 04:32:57,421 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 04:32:58,099 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 04:32:58,107 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 04:32:58,108 INFO L302 CfgBuilder]: Removed 16 assume(true) statements. [2023-08-30 04:32:58,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:32:58 BoogieIcfgContainer [2023-08-30 04:32:58,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 04:32:58,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 04:32:58,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 04:32:58,127 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 04:32:58,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:32:56" (1/3) ... [2023-08-30 04:32:58,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@744d3e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:32:58, skipping insertion in model container [2023-08-30 04:32:58,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:32:56" (2/3) ... [2023-08-30 04:32:58,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@744d3e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:32:58, skipping insertion in model container [2023-08-30 04:32:58,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:32:58" (3/3) ... [2023-08-30 04:32:58,130 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_86-lists_racing.i [2023-08-30 04:32:58,146 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 04:32:58,146 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2023-08-30 04:32:58,146 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 04:32:58,271 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-30 04:32:58,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 255 places, 275 transitions, 572 flow [2023-08-30 04:32:58,506 INFO L130 PetriNetUnfolder]: 54/518 cut-off events. [2023-08-30 04:32:58,507 INFO L131 PetriNetUnfolder]: For 8/16 co-relation queries the response was YES. [2023-08-30 04:32:58,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 518 events. 54/518 cut-off events. For 8/16 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2426 event pairs, 0 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 255. Up to 8 conditions per place. [2023-08-30 04:32:58,525 INFO L82 GeneralOperation]: Start removeDead. Operand has 255 places, 275 transitions, 572 flow [2023-08-30 04:32:58,540 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 255 places, 275 transitions, 572 flow [2023-08-30 04:32:58,544 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 04:32:58,554 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 255 places, 275 transitions, 572 flow [2023-08-30 04:32:58,556 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 255 places, 275 transitions, 572 flow [2023-08-30 04:32:58,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 255 places, 275 transitions, 572 flow [2023-08-30 04:32:58,633 INFO L130 PetriNetUnfolder]: 54/518 cut-off events. [2023-08-30 04:32:58,634 INFO L131 PetriNetUnfolder]: For 8/16 co-relation queries the response was YES. [2023-08-30 04:32:58,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 518 events. 54/518 cut-off events. For 8/16 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2426 event pairs, 0 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 255. Up to 8 conditions per place. [2023-08-30 04:32:58,653 INFO L119 LiptonReduction]: Number of co-enabled transitions 24560 [2023-08-30 04:33:42,082 INFO L134 LiptonReduction]: Checked pairs total: 63932 [2023-08-30 04:33:42,082 INFO L136 LiptonReduction]: Total number of compositions: 238 [2023-08-30 04:33:42,096 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 04:33:42,102 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;@2ff722af, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 04:33:42,102 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2023-08-30 04:33:42,106 INFO L130 PetriNetUnfolder]: 1/3 cut-off events. [2023-08-30 04:33:42,107 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 04:33:42,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:33:42,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 04:33:42,108 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 04:33:42,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:33:42,113 INFO L85 PathProgramCache]: Analyzing trace with hash 34298, now seen corresponding path program 1 times [2023-08-30 04:33:42,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 04:33:42,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58729779] [2023-08-30 04:33:42,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:33:42,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 04:33:42,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 04:33:42,126 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 04:33:42,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-30 04:33:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:33:42,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 04:33:42,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 04:33:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:33:42,251 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 04:33:42,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 04:33:42,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58729779] [2023-08-30 04:33:42,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [58729779] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 04:33:42,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 04:33:42,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 04:33:42,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334254958] [2023-08-30 04:33:42,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 04:33:42,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 04:33:42,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 04:33:42,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 04:33:42,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 04:33:42,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 513 [2023-08-30 04:33:42,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 114 transitions, 250 flow. Second operand has 2 states, 2 states have (on average 252.0) internal successors, (504), 2 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:33:42,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:33:42,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 513 [2023-08-30 04:33:42,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:33:45,293 INFO L130 PetriNetUnfolder]: 15447/27838 cut-off events. [2023-08-30 04:33:45,295 INFO L131 PetriNetUnfolder]: For 136/136 co-relation queries the response was YES. [2023-08-30 04:33:45,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51642 conditions, 27838 events. 15447/27838 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 904. Compared 232199 event pairs, 14776 based on Foata normal form. 870/14796 useless extension candidates. Maximal degree in co-relation 48952. Up to 23664 conditions per place. [2023-08-30 04:33:45,481 INFO L137 encePairwiseOnDemand]: 498/513 looper letters, 77 selfloop transitions, 0 changer transitions 0/99 dead transitions. [2023-08-30 04:33:45,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 99 transitions, 374 flow [2023-08-30 04:33:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 04:33:45,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 04:33:45,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 594 transitions. [2023-08-30 04:33:45,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2023-08-30 04:33:45,499 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 594 transitions. [2023-08-30 04:33:45,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 594 transitions. [2023-08-30 04:33:45,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:33:45,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 594 transitions. [2023-08-30 04:33:45,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 297.0) internal successors, (594), 2 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:33:45,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:33:45,521 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:33:45,523 INFO L175 Difference]: Start difference. First operand has 101 places, 114 transitions, 250 flow. Second operand 2 states and 594 transitions. [2023-08-30 04:33:45,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 99 transitions, 374 flow [2023-08-30 04:33:45,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 99 transitions, 374 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 04:33:45,542 INFO L231 Difference]: Finished difference. Result has 98 places, 99 transitions, 220 flow [2023-08-30 04:33:45,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=513, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=220, PETRI_PLACES=98, PETRI_TRANSITIONS=99} [2023-08-30 04:33:45,549 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -3 predicate places. [2023-08-30 04:33:45,550 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 99 transitions, 220 flow [2023-08-30 04:33:45,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 252.0) internal successors, (504), 2 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:33:45,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:33:45,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 04:33:45,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-30 04:33:45,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 04:33:45,761 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 04:33:45,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:33:45,762 INFO L85 PathProgramCache]: Analyzing trace with hash 34306, now seen corresponding path program 1 times [2023-08-30 04:33:45,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 04:33:45,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182302158] [2023-08-30 04:33:45,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:33:45,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 04:33:45,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 04:33:45,767 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 04:33:45,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-30 04:33:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:33:45,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 04:33:45,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 04:33:45,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:33:45,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 04:33:45,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 04:33:45,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182302158] [2023-08-30 04:33:45,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182302158] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 04:33:45,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 04:33:45,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 04:33:45,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529364370] [2023-08-30 04:33:45,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 04:33:45,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 04:33:45,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 04:33:45,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 04:33:45,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 04:33:46,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 513 [2023-08-30 04:33:46,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 99 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:33:46,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:33:46,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 513 [2023-08-30 04:33:46,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:33:48,490 INFO L130 PetriNetUnfolder]: 14236/24855 cut-off events. [2023-08-30 04:33:48,490 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2023-08-30 04:33:48,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46952 conditions, 24855 events. 14236/24855 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 875. Compared 202152 event pairs, 9710 based on Foata normal form. 0/12863 useless extension candidates. Maximal degree in co-relation 46947. Up to 15418 conditions per place. [2023-08-30 04:33:48,631 INFO L137 encePairwiseOnDemand]: 508/513 looper letters, 114 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2023-08-30 04:33:48,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 138 transitions, 530 flow [2023-08-30 04:33:48,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 04:33:48,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 04:33:48,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2023-08-30 04:33:48,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5568551007147499 [2023-08-30 04:33:48,635 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 857 transitions. [2023-08-30 04:33:48,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 857 transitions. [2023-08-30 04:33:48,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:33:48,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 857 transitions. [2023-08-30 04:33:48,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:33:48,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 513.0) internal successors, (2052), 4 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:33:48,643 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 513.0) internal successors, (2052), 4 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:33:48,644 INFO L175 Difference]: Start difference. First operand has 98 places, 99 transitions, 220 flow. Second operand 3 states and 857 transitions. [2023-08-30 04:33:48,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 138 transitions, 530 flow [2023-08-30 04:33:48,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 138 transitions, 530 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 04:33:48,653 INFO L231 Difference]: Finished difference. Result has 100 places, 98 transitions, 228 flow [2023-08-30 04:33:48,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=513, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=100, PETRI_TRANSITIONS=98} [2023-08-30 04:33:48,656 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -1 predicate places. [2023-08-30 04:33:48,656 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 98 transitions, 228 flow [2023-08-30 04:33:48,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:33:48,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:33:48,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 04:33:48,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-30 04:33:48,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 04:33:48,868 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 04:33:48,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:33:48,869 INFO L85 PathProgramCache]: Analyzing trace with hash 34308, now seen corresponding path program 1 times [2023-08-30 04:33:48,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 04:33:48,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857591426] [2023-08-30 04:33:48,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:33:48,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 04:33:48,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 04:33:48,871 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 04:33:48,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-30 04:33:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:33:48,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 04:33:48,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 04:33:49,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:33:49,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 04:33:49,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 04:33:49,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857591426] [2023-08-30 04:33:49,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857591426] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 04:33:49,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 04:33:49,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 04:33:49,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630083921] [2023-08-30 04:33:49,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 04:33:49,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 04:33:49,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 04:33:49,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 04:33:49,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 04:33:49,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 513 [2023-08-30 04:33:49,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 98 transitions, 228 flow. Second operand has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:33:49,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:33:49,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 513 [2023-08-30 04:33:49,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:33:51,468 INFO L130 PetriNetUnfolder]: 14316/25888 cut-off events. [2023-08-30 04:33:51,468 INFO L131 PetriNetUnfolder]: For 742/742 co-relation queries the response was YES. [2023-08-30 04:33:51,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49054 conditions, 25888 events. 14316/25888 cut-off events. For 742/742 co-relation queries the response was YES. Maximal size of possible extension queue 880. Compared 215103 event pairs, 13675 based on Foata normal form. 0/13950 useless extension candidates. Maximal degree in co-relation 49047. Up to 21965 conditions per place. [2023-08-30 04:33:51,620 INFO L137 encePairwiseOnDemand]: 509/513 looper letters, 75 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2023-08-30 04:33:51,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 99 transitions, 384 flow [2023-08-30 04:33:51,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 04:33:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 04:33:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 805 transitions. [2023-08-30 04:33:51,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5230669265756985 [2023-08-30 04:33:51,624 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 805 transitions. [2023-08-30 04:33:51,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 805 transitions. [2023-08-30 04:33:51,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:33:51,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 805 transitions. [2023-08-30 04:33:51,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 268.3333333333333) internal successors, (805), 3 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:33:51,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 513.0) internal successors, (2052), 4 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:33:51,631 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 513.0) internal successors, (2052), 4 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:33:51,632 INFO L175 Difference]: Start difference. First operand has 100 places, 98 transitions, 228 flow. Second operand 3 states and 805 transitions. [2023-08-30 04:33:51,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 99 transitions, 384 flow [2023-08-30 04:33:51,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 99 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 04:33:51,643 INFO L231 Difference]: Finished difference. Result has 101 places, 99 transitions, 238 flow [2023-08-30 04:33:51,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=513, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=101, PETRI_TRANSITIONS=99} [2023-08-30 04:33:51,645 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, 0 predicate places. [2023-08-30 04:33:51,645 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 99 transitions, 238 flow [2023-08-30 04:33:51,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:33:51,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:33:51,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 04:33:51,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-30 04:33:51,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 04:33:51,863 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 04:33:51,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:33:51,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1064562, now seen corresponding path program 1 times [2023-08-30 04:33:51,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 04:33:51,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579957502] [2023-08-30 04:33:51,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:33:51,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 04:33:51,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 04:33:51,867 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 04:33:51,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-30 04:33:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:33:52,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-30 04:33:52,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 04:33:52,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 04:33:52,110 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-30 04:33:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:33:52,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 04:33:54,354 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 04:33:54,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 77 [2023-08-30 04:33:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:33:55,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 04:33:55,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579957502] [2023-08-30 04:33:55,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579957502] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 04:33:55,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 04:33:55,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2023-08-30 04:33:55,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195286564] [2023-08-30 04:33:55,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 04:33:55,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 04:33:55,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 04:33:55,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 04:33:55,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-30 04:33:58,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:34:02,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:34:03,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:34:06,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:34:08,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:34:10,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:34:15,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:34:18,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:34:20,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:34:22,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:34:26,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:34:29,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:34:31,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:34:31,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 513 [2023-08-30 04:34:31,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 99 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:34:31,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:34:31,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 513 [2023-08-30 04:34:31,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:34:44,496 WARN L222 SmtUtils]: Spent 12.26s on a formula simplification. DAG size of input: 44 DAG size of output: 38 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 04:34:47,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:34:49,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:34:52,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:34:56,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:34:58,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:35:02,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:35:04,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 04:35:07,570 INFO L130 PetriNetUnfolder]: 35094/62311 cut-off events. [2023-08-30 04:35:07,570 INFO L131 PetriNetUnfolder]: For 565/565 co-relation queries the response was YES. [2023-08-30 04:35:07,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117837 conditions, 62311 events. 35094/62311 cut-off events. For 565/565 co-relation queries the response was YES. Maximal size of possible extension queue 2044. Compared 579231 event pairs, 28768 based on Foata normal form. 0/31390 useless extension candidates. Maximal degree in co-relation 117829. Up to 22805 conditions per place. [2023-08-30 04:35:07,842 INFO L137 encePairwiseOnDemand]: 508/513 looper letters, 207 selfloop transitions, 7 changer transitions 0/236 dead transitions. [2023-08-30 04:35:07,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 236 transitions, 988 flow [2023-08-30 04:35:07,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 04:35:07,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 04:35:07,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1610 transitions. [2023-08-30 04:35:07,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5230669265756985 [2023-08-30 04:35:07,847 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1610 transitions. [2023-08-30 04:35:07,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1610 transitions. [2023-08-30 04:35:07,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:35:07,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1610 transitions. [2023-08-30 04:35:07,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 268.3333333333333) internal successors, (1610), 6 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:35:07,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 513.0) internal successors, (3591), 7 states have internal predecessors, (3591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:35:07,861 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 513.0) internal successors, (3591), 7 states have internal predecessors, (3591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:35:07,862 INFO L175 Difference]: Start difference. First operand has 101 places, 99 transitions, 238 flow. Second operand 6 states and 1610 transitions. [2023-08-30 04:35:07,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 236 transitions, 988 flow [2023-08-30 04:35:07,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 236 transitions, 984 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 04:35:07,876 INFO L231 Difference]: Finished difference. Result has 108 places, 104 transitions, 286 flow [2023-08-30 04:35:07,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=513, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=286, PETRI_PLACES=108, PETRI_TRANSITIONS=104} [2023-08-30 04:35:07,878 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, 7 predicate places. [2023-08-30 04:35:07,878 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 104 transitions, 286 flow [2023-08-30 04:35:07,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:35:07,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:35:07,879 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2023-08-30 04:35:07,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-30 04:35:08,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 04:35:08,098 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-08-30 04:35:08,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:35:08,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1023074955, now seen corresponding path program 1 times [2023-08-30 04:35:08,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 04:35:08,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299729915] [2023-08-30 04:35:08,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:35:08,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 04:35:08,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 04:35:08,101 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 04:35:08,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-30 04:35:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:35:08,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 04:35:08,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 04:35:08,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:35:08,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 04:35:08,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:35:08,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 04:35:08,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299729915] [2023-08-30 04:35:08,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299729915] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 04:35:08,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 04:35:08,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-08-30 04:35:08,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482482748] [2023-08-30 04:35:08,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 04:35:08,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 04:35:08,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 04:35:08,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 04:35:08,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-08-30 04:35:08,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 513 [2023-08-30 04:35:08,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 104 transitions, 286 flow. Second operand has 8 states, 8 states have (on average 247.125) internal successors, (1977), 8 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:35:08,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:35:08,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 513 [2023-08-30 04:35:08,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15