./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_94-alloc_region_racing.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_94-alloc_region_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 7faac9952fd378b53dcd8f21391daa9cc75834f7be2a5ad0c70d96fc8524bd08 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 22:13:38,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 22:13:38,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 22:13:38,648 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 22:13:38,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 22:13:38,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 22:13:38,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 22:13:38,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 22:13:38,654 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 22:13:38,655 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 22:13:38,656 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 22:13:38,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 22:13:38,657 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 22:13:38,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 22:13:38,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 22:13:38,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 22:13:38,661 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 22:13:38,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 22:13:38,663 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 22:13:38,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 22:13:38,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 22:13:38,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 22:13:38,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 22:13:38,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 22:13:38,671 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 22:13:38,671 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 22:13:38,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 22:13:38,672 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 22:13:38,673 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 22:13:38,673 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 22:13:38,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 22:13:38,674 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 22:13:38,675 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 22:13:38,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 22:13:38,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 22:13:38,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 22:13:38,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 22:13:38,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 22:13:38,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 22:13:38,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 22:13:38,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 22:13:38,681 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 22:13:38,700 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 22:13:38,701 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 22:13:38,701 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 22:13:38,701 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 22:13:38,702 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 22:13:38,702 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 22:13:38,703 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 22:13:38,703 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 22:13:38,703 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 22:13:38,704 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 22:13:38,704 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 22:13:38,704 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 22:13:38,704 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 22:13:38,705 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 22:13:38,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 22:13:38,705 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 22:13:38,705 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 22:13:38,706 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 22:13:38,706 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 22:13:38,706 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 22:13:38,706 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 22:13:38,707 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 22:13:38,707 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 22:13:38,707 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 22:13:38,707 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 22:13:38,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 22:13:38,708 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 22:13:38,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 22:13:38,708 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 22:13:38,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 22:13:38,709 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 22:13:38,709 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 22:13:38,709 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 22:13:38,709 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 22:13:38,710 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 -> 7faac9952fd378b53dcd8f21391daa9cc75834f7be2a5ad0c70d96fc8524bd08 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 22:13:39,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 22:13:39,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 22:13:39,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 22:13:39,023 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 22:13:39,023 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 22:13:39,024 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_94-alloc_region_racing.i [2023-08-29 22:13:40,145 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 22:13:40,419 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 22:13:40,420 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_94-alloc_region_racing.i [2023-08-29 22:13:40,441 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/347320b80/8a9e999ee563496fba605fa56a0bd5e8/FLAGf3293620a [2023-08-29 22:13:40,454 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/347320b80/8a9e999ee563496fba605fa56a0bd5e8 [2023-08-29 22:13:40,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 22:13:40,457 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 22:13:40,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 22:13:40,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 22:13:40,460 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 22:13:40,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 10:13:40" (1/1) ... [2023-08-29 22:13:40,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d0d23d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:40, skipping insertion in model container [2023-08-29 22:13:40,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 10:13:40" (1/1) ... [2023-08-29 22:13:40,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 22:13:40,508 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 22:13:41,075 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_94-alloc_region_racing.i[58135,58148] [2023-08-29 22:13:41,112 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 22:13:41,127 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 22:13:41,191 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_94-alloc_region_racing.i[58135,58148] [2023-08-29 22:13:41,199 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 22:13:41,305 INFO L208 MainTranslator]: Completed translation [2023-08-29 22:13:41,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:41 WrapperNode [2023-08-29 22:13:41,306 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 22:13:41,307 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 22:13:41,307 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 22:13:41,307 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 22:13:41,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:41" (1/1) ... [2023-08-29 22:13:41,337 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:41" (1/1) ... [2023-08-29 22:13:41,367 INFO L138 Inliner]: procedures = 377, calls = 72, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 238 [2023-08-29 22:13:41,371 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 22:13:41,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 22:13:41,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 22:13:41,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 22:13:41,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:41" (1/1) ... [2023-08-29 22:13:41,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:41" (1/1) ... [2023-08-29 22:13:41,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:41" (1/1) ... [2023-08-29 22:13:41,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:41" (1/1) ... [2023-08-29 22:13:41,408 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:41" (1/1) ... [2023-08-29 22:13:41,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:41" (1/1) ... [2023-08-29 22:13:41,414 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:41" (1/1) ... [2023-08-29 22:13:41,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:41" (1/1) ... [2023-08-29 22:13:41,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 22:13:41,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 22:13:41,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 22:13:41,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 22:13:41,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:41" (1/1) ... [2023-08-29 22:13:41,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 22:13:41,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 22:13:41,472 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 22:13:41,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 22:13:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 22:13:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-08-29 22:13:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 22:13:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-08-29 22:13:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 22:13:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 22:13:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-29 22:13:41,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-29 22:13:41,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 22:13:41,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-08-29 22:13:41,502 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-29 22:13:41,502 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-29 22:13:41,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 22:13:41,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 22:13:41,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 22:13:41,504 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 22:13:41,659 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 22:13:41,664 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 22:13:42,153 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 22:13:42,161 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 22:13:42,162 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-29 22:13:42,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:13:42 BoogieIcfgContainer [2023-08-29 22:13:42,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 22:13:42,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 22:13:42,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 22:13:42,168 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 22:13:42,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 10:13:40" (1/3) ... [2023-08-29 22:13:42,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de99821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 10:13:42, skipping insertion in model container [2023-08-29 22:13:42,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:41" (2/3) ... [2023-08-29 22:13:42,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de99821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 10:13:42, skipping insertion in model container [2023-08-29 22:13:42,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:13:42" (3/3) ... [2023-08-29 22:13:42,171 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_94-alloc_region_racing.i [2023-08-29 22:13:42,186 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 22:13:42,186 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2023-08-29 22:13:42,186 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 22:13:42,279 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-29 22:13:42,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 302 transitions, 612 flow [2023-08-29 22:13:42,460 INFO L130 PetriNetUnfolder]: 45/438 cut-off events. [2023-08-29 22:13:42,460 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 22:13:42,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 438 events. 45/438 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1674 event pairs, 0 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 239. Up to 8 conditions per place. [2023-08-29 22:13:42,470 INFO L82 GeneralOperation]: Start removeDead. Operand has 276 places, 302 transitions, 612 flow [2023-08-29 22:13:42,480 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 276 places, 302 transitions, 612 flow [2023-08-29 22:13:42,484 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 22:13:42,491 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 276 places, 302 transitions, 612 flow [2023-08-29 22:13:42,494 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 276 places, 302 transitions, 612 flow [2023-08-29 22:13:42,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 302 transitions, 612 flow [2023-08-29 22:13:42,560 INFO L130 PetriNetUnfolder]: 45/438 cut-off events. [2023-08-29 22:13:42,560 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 22:13:42,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 438 events. 45/438 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1674 event pairs, 0 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 239. Up to 8 conditions per place. [2023-08-29 22:13:42,575 INFO L119 LiptonReduction]: Number of co-enabled transitions 27832 [2023-08-29 22:13:56,093 INFO L134 LiptonReduction]: Checked pairs total: 104044 [2023-08-29 22:13:56,094 INFO L136 LiptonReduction]: Total number of compositions: 244 [2023-08-29 22:13:56,106 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 22:13:56,110 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;@29ceba35, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 22:13:56,111 INFO L358 AbstractCegarLoop]: Starting to check reachability of 82 error locations. [2023-08-29 22:13:56,112 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 22:13:56,112 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 22:13:56,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:13:56,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 22:13:56,113 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:13:56,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:13:56,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1091, now seen corresponding path program 1 times [2023-08-29 22:13:56,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:13:56,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911562119] [2023-08-29 22:13:56,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:13:56,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:13:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:13:56,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:13:56,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:13:56,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911562119] [2023-08-29 22:13:56,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911562119] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:13:56,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:13:56,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 22:13:56,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077776377] [2023-08-29 22:13:56,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:13:56,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 22:13:56,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:13:56,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 22:13:56,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 22:13:56,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 546 [2023-08-29 22:13:56,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 148 transitions, 304 flow. Second operand has 2 states, 2 states have (on average 273.5) internal successors, (547), 2 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:13:56,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:13:56,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 546 [2023-08-29 22:13:56,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:13:56,720 INFO L130 PetriNetUnfolder]: 1475/3650 cut-off events. [2023-08-29 22:13:56,721 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 22:13:56,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6540 conditions, 3650 events. 1475/3650 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 27873 event pairs, 1364 based on Foata normal form. 312/2331 useless extension candidates. Maximal degree in co-relation 6413. Up to 2884 conditions per place. [2023-08-29 22:13:56,737 INFO L137 encePairwiseOnDemand]: 517/546 looper letters, 80 selfloop transitions, 0 changer transitions 0/119 dead transitions. [2023-08-29 22:13:56,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 119 transitions, 406 flow [2023-08-29 22:13:56,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 22:13:56,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 22:13:56,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 655 transitions. [2023-08-29 22:13:56,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5998168498168498 [2023-08-29 22:13:56,756 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 655 transitions. [2023-08-29 22:13:56,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 655 transitions. [2023-08-29 22:13:56,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:13:56,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 655 transitions. [2023-08-29 22:13:56,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 327.5) internal successors, (655), 2 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:13:56,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 546.0) internal successors, (1638), 3 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:13:56,773 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 546.0) internal successors, (1638), 3 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:13:56,775 INFO L175 Difference]: Start difference. First operand has 126 places, 148 transitions, 304 flow. Second operand 2 states and 655 transitions. [2023-08-29 22:13:56,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 119 transitions, 406 flow [2023-08-29 22:13:56,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 119 transitions, 406 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 22:13:56,781 INFO L231 Difference]: Finished difference. Result has 119 places, 119 transitions, 246 flow [2023-08-29 22:13:56,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=546, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=246, PETRI_PLACES=119, PETRI_TRANSITIONS=119} [2023-08-29 22:13:56,787 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -7 predicate places. [2023-08-29 22:13:56,787 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 119 transitions, 246 flow [2023-08-29 22:13:56,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 273.5) internal successors, (547), 2 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:13:56,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:13:56,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 22:13:56,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 22:13:56,788 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:13:56,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:13:56,790 INFO L85 PathProgramCache]: Analyzing trace with hash 35018, now seen corresponding path program 1 times [2023-08-29 22:13:56,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:13:56,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065137754] [2023-08-29 22:13:56,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:13:56,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:13:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:13:57,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:13:57,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:13:57,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065137754] [2023-08-29 22:13:57,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065137754] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:13:57,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:13:57,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 22:13:57,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024814602] [2023-08-29 22:13:57,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:13:57,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 22:13:57,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:13:57,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 22:13:57,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 22:13:57,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 546 [2023-08-29 22:13:57,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:13:57,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:13:57,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 546 [2023-08-29 22:13:57,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:13:57,660 INFO L130 PetriNetUnfolder]: 1469/3635 cut-off events. [2023-08-29 22:13:57,660 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 22:13:57,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6490 conditions, 3635 events. 1469/3635 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 28015 event pairs, 1333 based on Foata normal form. 0/2014 useless extension candidates. Maximal degree in co-relation 6486. Up to 2843 conditions per place. [2023-08-29 22:13:57,675 INFO L137 encePairwiseOnDemand]: 541/546 looper letters, 81 selfloop transitions, 3 changer transitions 0/123 dead transitions. [2023-08-29 22:13:57,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 123 transitions, 422 flow [2023-08-29 22:13:57,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 22:13:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 22:13:57,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 881 transitions. [2023-08-29 22:13:57,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5378510378510378 [2023-08-29 22:13:57,679 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 881 transitions. [2023-08-29 22:13:57,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 881 transitions. [2023-08-29 22:13:57,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:13:57,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 881 transitions. [2023-08-29 22:13:57,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:13:57,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 546.0) internal successors, (2184), 4 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:13:57,685 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 546.0) internal successors, (2184), 4 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:13:57,686 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 246 flow. Second operand 3 states and 881 transitions. [2023-08-29 22:13:57,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 123 transitions, 422 flow [2023-08-29 22:13:57,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 123 transitions, 422 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 22:13:57,689 INFO L231 Difference]: Finished difference. Result has 122 places, 121 transitions, 267 flow [2023-08-29 22:13:57,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=546, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=267, PETRI_PLACES=122, PETRI_TRANSITIONS=121} [2023-08-29 22:13:57,690 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -4 predicate places. [2023-08-29 22:13:57,691 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 121 transitions, 267 flow [2023-08-29 22:13:57,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:13:57,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:13:57,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 22:13:57,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 22:13:57,692 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:13:57,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:13:57,692 INFO L85 PathProgramCache]: Analyzing trace with hash 35019, now seen corresponding path program 1 times [2023-08-29 22:13:57,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:13:57,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476651950] [2023-08-29 22:13:57,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:13:57,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:13:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:13:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:13:57,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:13:57,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476651950] [2023-08-29 22:13:57,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476651950] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:13:57,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:13:57,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 22:13:57,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502578330] [2023-08-29 22:13:57,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:13:57,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 22:13:57,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:13:57,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 22:13:57,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 22:13:57,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 546 [2023-08-29 22:13:57,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 121 transitions, 267 flow. Second operand has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:13:57,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:13:57,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 546 [2023-08-29 22:13:57,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:13:58,277 INFO L130 PetriNetUnfolder]: 1403/3488 cut-off events. [2023-08-29 22:13:58,278 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2023-08-29 22:13:58,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6362 conditions, 3488 events. 1403/3488 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 26691 event pairs, 1200 based on Foata normal form. 0/2005 useless extension candidates. Maximal degree in co-relation 6356. Up to 2590 conditions per place. [2023-08-29 22:13:58,293 INFO L137 encePairwiseOnDemand]: 542/546 looper letters, 109 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2023-08-29 22:13:58,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 150 transitions, 549 flow [2023-08-29 22:13:58,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 22:13:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 22:13:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 906 transitions. [2023-08-29 22:13:58,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5531135531135531 [2023-08-29 22:13:58,297 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 906 transitions. [2023-08-29 22:13:58,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 906 transitions. [2023-08-29 22:13:58,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:13:58,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 906 transitions. [2023-08-29 22:13:58,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 302.0) internal successors, (906), 3 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:13:58,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 546.0) internal successors, (2184), 4 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:13:58,318 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 546.0) internal successors, (2184), 4 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:13:58,318 INFO L175 Difference]: Start difference. First operand has 122 places, 121 transitions, 267 flow. Second operand 3 states and 906 transitions. [2023-08-29 22:13:58,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 150 transitions, 549 flow [2023-08-29 22:13:58,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 150 transitions, 546 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 22:13:58,325 INFO L231 Difference]: Finished difference. Result has 121 places, 119 transitions, 264 flow [2023-08-29 22:13:58,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=546, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=121, PETRI_TRANSITIONS=119} [2023-08-29 22:13:58,326 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -5 predicate places. [2023-08-29 22:13:58,326 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 119 transitions, 264 flow [2023-08-29 22:13:58,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:13:58,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:13:58,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 22:13:58,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 22:13:58,328 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:13:58,328 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:13:58,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1044104546, now seen corresponding path program 1 times [2023-08-29 22:13:58,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:13:58,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686361051] [2023-08-29 22:13:58,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:13:58,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:13:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:13:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:13:58,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:13:58,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686361051] [2023-08-29 22:13:58,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686361051] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:13:58,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:13:58,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 22:13:58,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333607881] [2023-08-29 22:13:58,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:13:58,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 22:13:58,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:13:58,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 22:13:58,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 22:13:58,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 546 [2023-08-29 22:13:58,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 119 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 272.6666666666667) internal successors, (818), 3 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:13:58,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:13:58,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 546 [2023-08-29 22:13:58,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:13:59,066 INFO L130 PetriNetUnfolder]: 1357/3373 cut-off events. [2023-08-29 22:13:59,066 INFO L131 PetriNetUnfolder]: For 102/102 co-relation queries the response was YES. [2023-08-29 22:13:59,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6185 conditions, 3373 events. 1357/3373 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 25775 event pairs, 1189 based on Foata normal form. 0/1993 useless extension candidates. Maximal degree in co-relation 6179. Up to 2586 conditions per place. [2023-08-29 22:13:59,082 INFO L137 encePairwiseOnDemand]: 544/546 looper letters, 119 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2023-08-29 22:13:59,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 160 transitions, 594 flow [2023-08-29 22:13:59,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 22:13:59,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 22:13:59,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 934 transitions. [2023-08-29 22:13:59,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5702075702075702 [2023-08-29 22:13:59,086 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 934 transitions. [2023-08-29 22:13:59,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 934 transitions. [2023-08-29 22:13:59,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:13:59,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 934 transitions. [2023-08-29 22:13:59,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:13:59,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 546.0) internal successors, (2184), 4 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:13:59,093 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 546.0) internal successors, (2184), 4 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:13:59,093 INFO L175 Difference]: Start difference. First operand has 121 places, 119 transitions, 264 flow. Second operand 3 states and 934 transitions. [2023-08-29 22:13:59,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 160 transitions, 594 flow [2023-08-29 22:13:59,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 160 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 22:13:59,097 INFO L231 Difference]: Finished difference. Result has 120 places, 118 transitions, 262 flow [2023-08-29 22:13:59,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=546, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=120, PETRI_TRANSITIONS=118} [2023-08-29 22:13:59,098 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -6 predicate places. [2023-08-29 22:13:59,098 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 118 transitions, 262 flow [2023-08-29 22:13:59,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 272.6666666666667) internal successors, (818), 3 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:13:59,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:13:59,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 22:13:59,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 22:13:59,099 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:13:59,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:13:59,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1044104547, now seen corresponding path program 1 times [2023-08-29 22:13:59,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:13:59,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142824063] [2023-08-29 22:13:59,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:13:59,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:13:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:13:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:13:59,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:13:59,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142824063] [2023-08-29 22:13:59,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142824063] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:13:59,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:13:59,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 22:13:59,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438811596] [2023-08-29 22:13:59,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:13:59,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 22:13:59,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:13:59,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 22:13:59,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 22:13:59,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 546 [2023-08-29 22:13:59,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 118 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 272.6666666666667) internal successors, (818), 3 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:13:59,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:13:59,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 546 [2023-08-29 22:13:59,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:13:59,704 INFO L130 PetriNetUnfolder]: 1345/3371 cut-off events. [2023-08-29 22:13:59,704 INFO L131 PetriNetUnfolder]: For 178/178 co-relation queries the response was YES. [2023-08-29 22:13:59,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6192 conditions, 3371 events. 1345/3371 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 26013 event pairs, 813 based on Foata normal form. 0/2007 useless extension candidates. Maximal degree in co-relation 6186. Up to 2471 conditions per place. [2023-08-29 22:13:59,717 INFO L137 encePairwiseOnDemand]: 542/546 looper letters, 145 selfloop transitions, 4 changer transitions 0/188 dead transitions. [2023-08-29 22:13:59,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 188 transitions, 704 flow [2023-08-29 22:13:59,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 22:13:59,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 22:13:59,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2023-08-29 22:13:59,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2023-08-29 22:13:59,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 962 transitions. [2023-08-29 22:13:59,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 962 transitions. [2023-08-29 22:13:59,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:13:59,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 962 transitions. [2023-08-29 22:13:59,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:13:59,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 546.0) internal successors, (2184), 4 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:13:59,727 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 546.0) internal successors, (2184), 4 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:13:59,727 INFO L175 Difference]: Start difference. First operand has 120 places, 118 transitions, 262 flow. Second operand 3 states and 962 transitions. [2023-08-29 22:13:59,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 188 transitions, 704 flow [2023-08-29 22:13:59,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 188 transitions, 702 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 22:13:59,731 INFO L231 Difference]: Finished difference. Result has 123 places, 120 transitions, 286 flow [2023-08-29 22:13:59,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=546, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=123, PETRI_TRANSITIONS=120} [2023-08-29 22:13:59,732 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -3 predicate places. [2023-08-29 22:13:59,732 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 120 transitions, 286 flow [2023-08-29 22:13:59,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 272.6666666666667) internal successors, (818), 3 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:13:59,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:13:59,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 22:13:59,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 22:13:59,733 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:13:59,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:13:59,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1044104943, now seen corresponding path program 1 times [2023-08-29 22:13:59,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:13:59,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193046676] [2023-08-29 22:13:59,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:13:59,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:13:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:13:59,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:13:59,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:13:59,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193046676] [2023-08-29 22:13:59,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193046676] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 22:13:59,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670474626] [2023-08-29 22:13:59,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:13:59,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:13:59,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 22:13:59,823 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 22:13:59,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-29 22:13:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:13:59,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-29 22:13:59,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:14:00,040 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 22:14:00,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-08-29 22:14:00,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:14:00,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 22:14:00,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:14:00,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670474626] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 22:14:00,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 22:14:00,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2023-08-29 22:14:00,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755127590] [2023-08-29 22:14:00,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 22:14:00,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 22:14:00,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:14:00,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 22:14:00,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-08-29 22:14:00,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 546 [2023-08-29 22:14:00,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 120 transitions, 286 flow. Second operand has 7 states, 7 states have (on average 263.7142857142857) internal successors, (1846), 7 states have internal predecessors, (1846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:00,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:14:00,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 546 [2023-08-29 22:14:00,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:14:01,090 INFO L130 PetriNetUnfolder]: 1275/3181 cut-off events. [2023-08-29 22:14:01,091 INFO L131 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2023-08-29 22:14:01,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5863 conditions, 3181 events. 1275/3181 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 24440 event pairs, 865 based on Foata normal form. 1/1932 useless extension candidates. Maximal degree in co-relation 5856. Up to 2344 conditions per place. [2023-08-29 22:14:01,103 INFO L137 encePairwiseOnDemand]: 541/546 looper letters, 131 selfloop transitions, 6 changer transitions 0/176 dead transitions. [2023-08-29 22:14:01,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 176 transitions, 672 flow [2023-08-29 22:14:01,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 22:14:01,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 22:14:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1711 transitions. [2023-08-29 22:14:01,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5222832722832723 [2023-08-29 22:14:01,108 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1711 transitions. [2023-08-29 22:14:01,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1711 transitions. [2023-08-29 22:14:01,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:14:01,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1711 transitions. [2023-08-29 22:14:01,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 285.1666666666667) internal successors, (1711), 6 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:01,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 546.0) internal successors, (3822), 7 states have internal predecessors, (3822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:01,119 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 546.0) internal successors, (3822), 7 states have internal predecessors, (3822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:01,119 INFO L175 Difference]: Start difference. First operand has 123 places, 120 transitions, 286 flow. Second operand 6 states and 1711 transitions. [2023-08-29 22:14:01,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 176 transitions, 672 flow [2023-08-29 22:14:01,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 176 transitions, 664 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 22:14:01,123 INFO L231 Difference]: Finished difference. Result has 125 places, 118 transitions, 282 flow [2023-08-29 22:14:01,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=546, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=282, PETRI_PLACES=125, PETRI_TRANSITIONS=118} [2023-08-29 22:14:01,124 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -1 predicate places. [2023-08-29 22:14:01,124 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 118 transitions, 282 flow [2023-08-29 22:14:01,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 263.7142857142857) internal successors, (1846), 7 states have internal predecessors, (1846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:01,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:14:01,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 22:14:01,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-29 22:14:01,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-29 22:14:01,332 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:14:01,332 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:14:01,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1992496737, now seen corresponding path program 1 times [2023-08-29 22:14:01,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:14:01,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618133235] [2023-08-29 22:14:01,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:14:01,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:14:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:14:01,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:14:01,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:14:01,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618133235] [2023-08-29 22:14:01,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618133235] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:14:01,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:14:01,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 22:14:01,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45373051] [2023-08-29 22:14:01,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:14:01,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 22:14:01,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:14:01,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 22:14:01,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 22:14:01,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 546 [2023-08-29 22:14:01,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 118 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 268.0) internal successors, (804), 3 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:01,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:14:01,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 546 [2023-08-29 22:14:01,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:14:01,963 INFO L130 PetriNetUnfolder]: 1297/3280 cut-off events. [2023-08-29 22:14:01,963 INFO L131 PetriNetUnfolder]: For 224/224 co-relation queries the response was YES. [2023-08-29 22:14:01,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6072 conditions, 3280 events. 1297/3280 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 25649 event pairs, 812 based on Foata normal form. 0/1996 useless extension candidates. Maximal degree in co-relation 6065. Up to 2409 conditions per place. [2023-08-29 22:14:01,976 INFO L137 encePairwiseOnDemand]: 542/546 looper letters, 145 selfloop transitions, 4 changer transitions 0/187 dead transitions. [2023-08-29 22:14:01,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 187 transitions, 728 flow [2023-08-29 22:14:01,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 22:14:01,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 22:14:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 945 transitions. [2023-08-29 22:14:01,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2023-08-29 22:14:01,980 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 945 transitions. [2023-08-29 22:14:01,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 945 transitions. [2023-08-29 22:14:01,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:14:01,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 945 transitions. [2023-08-29 22:14:01,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:01,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 546.0) internal successors, (2184), 4 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:01,987 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 546.0) internal successors, (2184), 4 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:01,987 INFO L175 Difference]: Start difference. First operand has 125 places, 118 transitions, 282 flow. Second operand 3 states and 945 transitions. [2023-08-29 22:14:01,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 187 transitions, 728 flow [2023-08-29 22:14:01,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 187 transitions, 709 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-29 22:14:01,992 INFO L231 Difference]: Finished difference. Result has 126 places, 120 transitions, 296 flow [2023-08-29 22:14:01,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=546, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=126, PETRI_TRANSITIONS=120} [2023-08-29 22:14:01,993 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, 0 predicate places. [2023-08-29 22:14:01,993 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 120 transitions, 296 flow [2023-08-29 22:14:01,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 268.0) internal successors, (804), 3 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:01,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:14:01,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 22:14:01,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 22:14:01,994 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:14:01,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:14:01,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1992496736, now seen corresponding path program 1 times [2023-08-29 22:14:01,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:14:01,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924814064] [2023-08-29 22:14:01,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:14:01,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:14:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:14:02,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:14:02,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:14:02,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924814064] [2023-08-29 22:14:02,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924814064] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:14:02,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:14:02,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 22:14:02,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684536239] [2023-08-29 22:14:02,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:14:02,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 22:14:02,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:14:02,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 22:14:02,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 22:14:02,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 546 [2023-08-29 22:14:02,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 120 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 269.5) internal successors, (1078), 4 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:02,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:14:02,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 546 [2023-08-29 22:14:02,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:14:02,687 INFO L130 PetriNetUnfolder]: 1298/3275 cut-off events. [2023-08-29 22:14:02,687 INFO L131 PetriNetUnfolder]: For 434/435 co-relation queries the response was YES. [2023-08-29 22:14:02,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6162 conditions, 3275 events. 1298/3275 cut-off events. For 434/435 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 25658 event pairs, 862 based on Foata normal form. 44/2035 useless extension candidates. Maximal degree in co-relation 6155. Up to 2522 conditions per place. [2023-08-29 22:14:02,701 INFO L137 encePairwiseOnDemand]: 542/546 looper letters, 118 selfloop transitions, 5 changer transitions 0/161 dead transitions. [2023-08-29 22:14:02,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 161 transitions, 627 flow [2023-08-29 22:14:02,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 22:14:02,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 22:14:02,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1193 transitions. [2023-08-29 22:14:02,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5462454212454212 [2023-08-29 22:14:02,704 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1193 transitions. [2023-08-29 22:14:02,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1193 transitions. [2023-08-29 22:14:02,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:14:02,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1193 transitions. [2023-08-29 22:14:02,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 298.25) internal successors, (1193), 4 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:02,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 546.0) internal successors, (2730), 5 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:02,711 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 546.0) internal successors, (2730), 5 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:02,711 INFO L175 Difference]: Start difference. First operand has 126 places, 120 transitions, 296 flow. Second operand 4 states and 1193 transitions. [2023-08-29 22:14:02,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 161 transitions, 627 flow [2023-08-29 22:14:02,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 161 transitions, 619 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 22:14:02,715 INFO L231 Difference]: Finished difference. Result has 126 places, 119 transitions, 296 flow [2023-08-29 22:14:02,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=546, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=296, PETRI_PLACES=126, PETRI_TRANSITIONS=119} [2023-08-29 22:14:02,718 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, 0 predicate places. [2023-08-29 22:14:02,718 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 119 transitions, 296 flow [2023-08-29 22:14:02,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 269.5) internal successors, (1078), 4 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:02,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:14:02,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:14:02,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 22:14:02,719 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:14:02,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:14:02,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1637449813, now seen corresponding path program 1 times [2023-08-29 22:14:02,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:14:02,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674932337] [2023-08-29 22:14:02,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:14:02,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:14:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:14:02,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:14:02,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:14:02,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674932337] [2023-08-29 22:14:02,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674932337] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 22:14:02,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742690675] [2023-08-29 22:14:02,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:14:02,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:14:02,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 22:14:02,787 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 22:14:02,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-29 22:14:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:14:02,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 22:14:02,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:14:02,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:14:02,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 22:14:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:14:02,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742690675] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 22:14:02,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 22:14:02,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 22:14:02,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762763142] [2023-08-29 22:14:02,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 22:14:02,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 22:14:02,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:14:02,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 22:14:02,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 22:14:02,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 546 [2023-08-29 22:14:02,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 119 transitions, 296 flow. Second operand has 7 states, 7 states have (on average 270.42857142857144) internal successors, (1893), 7 states have internal predecessors, (1893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:02,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:14:02,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 546 [2023-08-29 22:14:02,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:14:03,053 INFO L130 PetriNetUnfolder]: 59/193 cut-off events. [2023-08-29 22:14:03,053 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2023-08-29 22:14:03,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 193 events. 59/193 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 829 event pairs, 0 based on Foata normal form. 29/181 useless extension candidates. Maximal degree in co-relation 430. Up to 118 conditions per place. [2023-08-29 22:14:03,054 INFO L137 encePairwiseOnDemand]: 543/546 looper letters, 51 selfloop transitions, 3 changer transitions 11/78 dead transitions. [2023-08-29 22:14:03,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 78 transitions, 324 flow [2023-08-29 22:14:03,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 22:14:03,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 22:14:03,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1136 transitions. [2023-08-29 22:14:03,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5201465201465202 [2023-08-29 22:14:03,057 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1136 transitions. [2023-08-29 22:14:03,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1136 transitions. [2023-08-29 22:14:03,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:14:03,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1136 transitions. [2023-08-29 22:14:03,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:03,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 546.0) internal successors, (2730), 5 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:03,064 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 546.0) internal successors, (2730), 5 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:03,064 INFO L175 Difference]: Start difference. First operand has 126 places, 119 transitions, 296 flow. Second operand 4 states and 1136 transitions. [2023-08-29 22:14:03,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 78 transitions, 324 flow [2023-08-29 22:14:03,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 78 transitions, 302 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-29 22:14:03,066 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 109 flow [2023-08-29 22:14:03,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=546, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2023-08-29 22:14:03,067 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -67 predicate places. [2023-08-29 22:14:03,067 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 109 flow [2023-08-29 22:14:03,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 270.42857142857144) internal successors, (1893), 7 states have internal predecessors, (1893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:03,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:14:03,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:14:03,077 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-29 22:14:03,274 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,SelfDestructingSolverStorable8 [2023-08-29 22:14:03,274 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:14:03,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:14:03,278 INFO L85 PathProgramCache]: Analyzing trace with hash 766222181, now seen corresponding path program 1 times [2023-08-29 22:14:03,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:14:03,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364793619] [2023-08-29 22:14:03,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:14:03,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:14:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:14:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:14:03,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:14:03,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364793619] [2023-08-29 22:14:03,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364793619] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:14:03,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:14:03,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 22:14:03,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342157520] [2023-08-29 22:14:03,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:14:03,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 22:14:03,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:14:03,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 22:14:03,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 22:14:03,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 546 [2023-08-29 22:14:03,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 267.6) internal successors, (1338), 5 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:03,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:14:03,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 546 [2023-08-29 22:14:03,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:14:03,861 INFO L130 PetriNetUnfolder]: 46/157 cut-off events. [2023-08-29 22:14:03,861 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2023-08-29 22:14:03,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 157 events. 46/157 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 495 event pairs, 3 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 339. Up to 100 conditions per place. [2023-08-29 22:14:03,862 INFO L137 encePairwiseOnDemand]: 543/546 looper letters, 29 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-08-29 22:14:03,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 44 transitions, 177 flow [2023-08-29 22:14:03,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 22:14:03,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 22:14:03,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1094 transitions. [2023-08-29 22:14:03,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5009157509157509 [2023-08-29 22:14:03,871 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1094 transitions. [2023-08-29 22:14:03,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1094 transitions. [2023-08-29 22:14:03,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:14:03,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1094 transitions. [2023-08-29 22:14:03,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 273.5) internal successors, (1094), 4 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:03,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 546.0) internal successors, (2730), 5 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:03,893 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 546.0) internal successors, (2730), 5 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:03,893 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 109 flow. Second operand 4 states and 1094 transitions. [2023-08-29 22:14:03,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 44 transitions, 177 flow [2023-08-29 22:14:03,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 44 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 22:14:03,895 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 107 flow [2023-08-29 22:14:03,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=546, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2023-08-29 22:14:03,896 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -72 predicate places. [2023-08-29 22:14:03,896 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 107 flow [2023-08-29 22:14:03,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 267.6) internal successors, (1338), 5 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:03,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:14:03,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:14:03,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 22:14:03,897 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:14:03,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:14:03,898 INFO L85 PathProgramCache]: Analyzing trace with hash 766222182, now seen corresponding path program 1 times [2023-08-29 22:14:03,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:14:03,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196008833] [2023-08-29 22:14:03,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:14:03,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:14:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:14:04,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:14:04,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:14:04,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196008833] [2023-08-29 22:14:04,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196008833] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:14:04,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:14:04,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 22:14:04,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273756751] [2023-08-29 22:14:04,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:14:04,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 22:14:04,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:14:04,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 22:14:04,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 22:14:04,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 546 [2023-08-29 22:14:04,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 107 flow. Second operand has 6 states, 6 states have (on average 262.3333333333333) internal successors, (1574), 6 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:04,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:14:04,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 546 [2023-08-29 22:14:04,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:14:04,721 INFO L130 PetriNetUnfolder]: 44/152 cut-off events. [2023-08-29 22:14:04,721 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2023-08-29 22:14:04,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 152 events. 44/152 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 471 event pairs, 2 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 330. Up to 95 conditions per place. [2023-08-29 22:14:04,722 INFO L137 encePairwiseOnDemand]: 542/546 looper letters, 27 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2023-08-29 22:14:04,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 44 transitions, 176 flow [2023-08-29 22:14:04,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 22:14:04,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 22:14:04,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1336 transitions. [2023-08-29 22:14:04,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48937728937728936 [2023-08-29 22:14:04,725 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1336 transitions. [2023-08-29 22:14:04,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1336 transitions. [2023-08-29 22:14:04,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:14:04,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1336 transitions. [2023-08-29 22:14:04,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 267.2) internal successors, (1336), 5 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:04,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 546.0) internal successors, (3276), 6 states have internal predecessors, (3276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:04,732 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 546.0) internal successors, (3276), 6 states have internal predecessors, (3276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:04,732 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 107 flow. Second operand 5 states and 1336 transitions. [2023-08-29 22:14:04,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 44 transitions, 176 flow [2023-08-29 22:14:04,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 44 transitions, 173 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 22:14:04,733 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 110 flow [2023-08-29 22:14:04,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=546, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2023-08-29 22:14:04,734 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -71 predicate places. [2023-08-29 22:14:04,734 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 110 flow [2023-08-29 22:14:04,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 262.3333333333333) internal successors, (1574), 6 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:04,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:14:04,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:14:04,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 22:14:04,735 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:14:04,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:14:04,736 INFO L85 PathProgramCache]: Analyzing trace with hash -2016915354, now seen corresponding path program 1 times [2023-08-29 22:14:04,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:14:04,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755782319] [2023-08-29 22:14:04,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:14:04,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:14:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:14:04,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:14:04,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:14:04,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755782319] [2023-08-29 22:14:04,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755782319] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:14:04,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:14:04,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 22:14:04,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582561534] [2023-08-29 22:14:04,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:14:04,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 22:14:04,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:14:04,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 22:14:04,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 22:14:05,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 546 [2023-08-29 22:14:05,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 257.8) internal successors, (1289), 5 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:05,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:14:05,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 546 [2023-08-29 22:14:05,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:14:05,113 INFO L130 PetriNetUnfolder]: 42/132 cut-off events. [2023-08-29 22:14:05,113 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2023-08-29 22:14:05,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 132 events. 42/132 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 338 event pairs, 0 based on Foata normal form. 3/117 useless extension candidates. Maximal degree in co-relation 309. Up to 85 conditions per place. [2023-08-29 22:14:05,114 INFO L137 encePairwiseOnDemand]: 537/546 looper letters, 28 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2023-08-29 22:14:05,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 40 transitions, 178 flow [2023-08-29 22:14:05,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 22:14:05,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 22:14:05,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1317 transitions. [2023-08-29 22:14:05,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4824175824175824 [2023-08-29 22:14:05,128 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1317 transitions. [2023-08-29 22:14:05,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1317 transitions. [2023-08-29 22:14:05,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:14:05,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1317 transitions. [2023-08-29 22:14:05,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 263.4) internal successors, (1317), 5 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:05,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 546.0) internal successors, (3276), 6 states have internal predecessors, (3276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:05,136 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 546.0) internal successors, (3276), 6 states have internal predecessors, (3276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:05,136 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 110 flow. Second operand 5 states and 1317 transitions. [2023-08-29 22:14:05,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 40 transitions, 178 flow [2023-08-29 22:14:05,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 40 transitions, 171 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 22:14:05,138 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 99 flow [2023-08-29 22:14:05,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=546, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2023-08-29 22:14:05,139 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -76 predicate places. [2023-08-29 22:14:05,139 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 99 flow [2023-08-29 22:14:05,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 257.8) internal successors, (1289), 5 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:05,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:14:05,139 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:14:05,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 22:14:05,140 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:14:05,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:14:05,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2016915353, now seen corresponding path program 1 times [2023-08-29 22:14:05,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:14:05,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125912671] [2023-08-29 22:14:05,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:14:05,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:14:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:14:05,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-29 22:14:05,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:14:05,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125912671] [2023-08-29 22:14:05,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125912671] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:14:05,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:14:05,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 22:14:05,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978685357] [2023-08-29 22:14:05,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:14:05,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 22:14:05,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:14:05,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 22:14:05,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 22:14:05,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 546 [2023-08-29 22:14:05,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 263.8) internal successors, (1319), 5 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:05,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:14:05,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 546 [2023-08-29 22:14:05,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:14:05,600 INFO L130 PetriNetUnfolder]: 32/104 cut-off events. [2023-08-29 22:14:05,600 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-29 22:14:05,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 104 events. 32/104 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 233 event pairs, 2 based on Foata normal form. 9/104 useless extension candidates. Maximal degree in co-relation 251. Up to 60 conditions per place. [2023-08-29 22:14:05,601 INFO L137 encePairwiseOnDemand]: 537/546 looper letters, 18 selfloop transitions, 4 changer transitions 8/34 dead transitions. [2023-08-29 22:14:05,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 34 transitions, 157 flow [2023-08-29 22:14:05,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 22:14:05,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 22:14:05,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1342 transitions. [2023-08-29 22:14:05,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49157509157509155 [2023-08-29 22:14:05,605 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1342 transitions. [2023-08-29 22:14:05,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1342 transitions. [2023-08-29 22:14:05,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:14:05,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1342 transitions. [2023-08-29 22:14:05,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 268.4) internal successors, (1342), 5 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:05,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 546.0) internal successors, (3276), 6 states have internal predecessors, (3276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:05,611 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 546.0) internal successors, (3276), 6 states have internal predecessors, (3276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:05,611 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 99 flow. Second operand 5 states and 1342 transitions. [2023-08-29 22:14:05,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 34 transitions, 157 flow [2023-08-29 22:14:05,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 150 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 22:14:05,613 INFO L231 Difference]: Finished difference. Result has 45 places, 21 transitions, 72 flow [2023-08-29 22:14:05,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=546, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=45, PETRI_TRANSITIONS=21} [2023-08-29 22:14:05,613 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -81 predicate places. [2023-08-29 22:14:05,613 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 21 transitions, 72 flow [2023-08-29 22:14:05,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 263.8) internal successors, (1319), 5 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:05,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:14:05,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:14:05,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 22:14:05,614 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:14:05,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:14:05,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1900134344, now seen corresponding path program 1 times [2023-08-29 22:14:05,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:14:05,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551546948] [2023-08-29 22:14:05,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:14:05,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:14:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:14:05,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:14:05,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:14:05,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551546948] [2023-08-29 22:14:05,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551546948] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:14:05,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:14:05,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 22:14:05,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606559854] [2023-08-29 22:14:05,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:14:05,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 22:14:05,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:14:05,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 22:14:05,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 22:14:05,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 546 [2023-08-29 22:14:05,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 21 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:05,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:14:05,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 546 [2023-08-29 22:14:05,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:14:05,798 INFO L130 PetriNetUnfolder]: 20/66 cut-off events. [2023-08-29 22:14:05,798 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-08-29 22:14:05,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 66 events. 20/66 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 123 event pairs, 6 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 175. Up to 30 conditions per place. [2023-08-29 22:14:05,798 INFO L137 encePairwiseOnDemand]: 544/546 looper letters, 17 selfloop transitions, 1 changer transitions 0/22 dead transitions. [2023-08-29 22:14:05,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 22 transitions, 113 flow [2023-08-29 22:14:05,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 22:14:05,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 22:14:05,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 815 transitions. [2023-08-29 22:14:05,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49755799755799757 [2023-08-29 22:14:05,801 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 815 transitions. [2023-08-29 22:14:05,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 815 transitions. [2023-08-29 22:14:05,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:14:05,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 815 transitions. [2023-08-29 22:14:05,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:05,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 546.0) internal successors, (2184), 4 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:05,806 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 546.0) internal successors, (2184), 4 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:05,806 INFO L175 Difference]: Start difference. First operand has 45 places, 21 transitions, 72 flow. Second operand 3 states and 815 transitions. [2023-08-29 22:14:05,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 22 transitions, 113 flow [2023-08-29 22:14:05,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 22 transitions, 106 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 22:14:05,807 INFO L231 Difference]: Finished difference. Result has 35 places, 20 transitions, 65 flow [2023-08-29 22:14:05,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=546, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=35, PETRI_TRANSITIONS=20} [2023-08-29 22:14:05,807 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -91 predicate places. [2023-08-29 22:14:05,808 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 65 flow [2023-08-29 22:14:05,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:05,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:14:05,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:14:05,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 22:14:05,808 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:14:05,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:14:05,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1900134345, now seen corresponding path program 1 times [2023-08-29 22:14:05,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:14:05,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722939095] [2023-08-29 22:14:05,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:14:05,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:14:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:14:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:14:05,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:14:05,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722939095] [2023-08-29 22:14:05,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722939095] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:14:05,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:14:05,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 22:14:05,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141616998] [2023-08-29 22:14:05,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:14:05,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 22:14:05,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:14:05,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 22:14:05,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 22:14:05,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 546 [2023-08-29 22:14:05,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 20 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:05,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:14:05,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 546 [2023-08-29 22:14:05,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:14:05,984 INFO L130 PetriNetUnfolder]: 18/61 cut-off events. [2023-08-29 22:14:05,984 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-08-29 22:14:05,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 61 events. 18/61 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 103 event pairs, 6 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 160. Up to 26 conditions per place. [2023-08-29 22:14:05,985 INFO L137 encePairwiseOnDemand]: 544/546 looper letters, 16 selfloop transitions, 1 changer transitions 0/21 dead transitions. [2023-08-29 22:14:05,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 21 transitions, 104 flow [2023-08-29 22:14:05,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 22:14:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 22:14:05,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 805 transitions. [2023-08-29 22:14:05,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49145299145299143 [2023-08-29 22:14:05,987 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 805 transitions. [2023-08-29 22:14:05,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 805 transitions. [2023-08-29 22:14:05,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:14:05,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 805 transitions. [2023-08-29 22:14:05,990 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-29 22:14:05,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 546.0) internal successors, (2184), 4 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:05,992 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 546.0) internal successors, (2184), 4 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:05,992 INFO L175 Difference]: Start difference. First operand has 35 places, 20 transitions, 65 flow. Second operand 3 states and 805 transitions. [2023-08-29 22:14:05,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 21 transitions, 104 flow [2023-08-29 22:14:05,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 21 transitions, 103 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 22:14:05,993 INFO L231 Difference]: Finished difference. Result has 35 places, 19 transitions, 64 flow [2023-08-29 22:14:05,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=546, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=35, PETRI_TRANSITIONS=19} [2023-08-29 22:14:05,994 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -91 predicate places. [2023-08-29 22:14:05,994 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 19 transitions, 64 flow [2023-08-29 22:14:05,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:14:05,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:14:05,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:14:05,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 22:14:05,995 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:14:05,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:14:05,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1680780300, now seen corresponding path program 1 times [2023-08-29 22:14:05,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:14:05,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734317590] [2023-08-29 22:14:05,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:14:05,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:14:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 22:14:06,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 22:14:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 22:14:06,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 22:14:06,115 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 22:14:06,116 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr20ASSERT_VIOLATIONMEMORY_LEAK (81 of 82 remaining) [2023-08-29 22:14:06,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 82 remaining) [2023-08-29 22:14:06,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (79 of 82 remaining) [2023-08-29 22:14:06,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 82 remaining) [2023-08-29 22:14:06,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 82 remaining) [2023-08-29 22:14:06,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 82 remaining) [2023-08-29 22:14:06,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 82 remaining) [2023-08-29 22:14:06,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 82 remaining) [2023-08-29 22:14:06,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 82 remaining) [2023-08-29 22:14:06,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 82 remaining) [2023-08-29 22:14:06,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 82 remaining) [2023-08-29 22:14:06,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 82 remaining) [2023-08-29 22:14:06,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 82 remaining) [2023-08-29 22:14:06,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 82 remaining) [2023-08-29 22:14:06,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr20ASSERT_VIOLATIONMEMORY_LEAK (67 of 82 remaining) [2023-08-29 22:14:06,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 82 remaining) [2023-08-29 22:14:06,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 82 remaining) [2023-08-29 22:14:06,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 82 remaining) [2023-08-29 22:14:06,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 82 remaining) [2023-08-29 22:14:06,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 82 remaining) [2023-08-29 22:14:06,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 82 remaining) [2023-08-29 22:14:06,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 82 remaining) [2023-08-29 22:14:06,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 82 remaining) [2023-08-29 22:14:06,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 82 remaining) [2023-08-29 22:14:06,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 82 remaining) [2023-08-29 22:14:06,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 82 remaining) [2023-08-29 22:14:06,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 82 remaining) [2023-08-29 22:14:06,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 82 remaining) [2023-08-29 22:14:06,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 82 remaining) [2023-08-29 22:14:06,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 82 remaining) [2023-08-29 22:14:06,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 82 remaining) [2023-08-29 22:14:06,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 82 remaining) [2023-08-29 22:14:06,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 82 remaining) [2023-08-29 22:14:06,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 82 remaining) [2023-08-29 22:14:06,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 82 remaining) [2023-08-29 22:14:06,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 82 remaining) [2023-08-29 22:14:06,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 82 remaining) [2023-08-29 22:14:06,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 82 remaining) [2023-08-29 22:14:06,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 82 remaining) [2023-08-29 22:14:06,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 82 remaining) [2023-08-29 22:14:06,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 82 remaining) [2023-08-29 22:14:06,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 82 remaining) [2023-08-29 22:14:06,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 82 remaining) [2023-08-29 22:14:06,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 82 remaining) [2023-08-29 22:14:06,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 82 remaining) [2023-08-29 22:14:06,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 82 remaining) [2023-08-29 22:14:06,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 82 remaining) [2023-08-29 22:14:06,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 82 remaining) [2023-08-29 22:14:06,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 82 remaining) [2023-08-29 22:14:06,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 82 remaining) [2023-08-29 22:14:06,127 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 82 remaining) [2023-08-29 22:14:06,127 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 82 remaining) [2023-08-29 22:14:06,127 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 82 remaining) [2023-08-29 22:14:06,127 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 82 remaining) [2023-08-29 22:14:06,127 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 82 remaining) [2023-08-29 22:14:06,127 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 82 remaining) [2023-08-29 22:14:06,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 82 remaining) [2023-08-29 22:14:06,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 82 remaining) [2023-08-29 22:14:06,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 82 remaining) [2023-08-29 22:14:06,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 82 remaining) [2023-08-29 22:14:06,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 82 remaining) [2023-08-29 22:14:06,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 82 remaining) [2023-08-29 22:14:06,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 82 remaining) [2023-08-29 22:14:06,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 82 remaining) [2023-08-29 22:14:06,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 82 remaining) [2023-08-29 22:14:06,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 82 remaining) [2023-08-29 22:14:06,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 82 remaining) [2023-08-29 22:14:06,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 82 remaining) [2023-08-29 22:14:06,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 82 remaining) [2023-08-29 22:14:06,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK (12 of 82 remaining) [2023-08-29 22:14:06,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 82 remaining) [2023-08-29 22:14:06,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 82 remaining) [2023-08-29 22:14:06,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 82 remaining) [2023-08-29 22:14:06,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 82 remaining) [2023-08-29 22:14:06,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 82 remaining) [2023-08-29 22:14:06,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 82 remaining) [2023-08-29 22:14:06,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 82 remaining) [2023-08-29 22:14:06,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 82 remaining) [2023-08-29 22:14:06,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 82 remaining) [2023-08-29 22:14:06,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 82 remaining) [2023-08-29 22:14:06,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 82 remaining) [2023-08-29 22:14:06,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 82 remaining) [2023-08-29 22:14:06,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 22:14:06,132 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:14:06,134 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-29 22:14:06,138 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 22:14:06,138 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 22:14:06,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 10:14:06 BasicIcfg [2023-08-29 22:14:06,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 22:14:06,189 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 22:14:06,189 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 22:14:06,189 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 22:14:06,189 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:13:42" (3/4) ... [2023-08-29 22:14:06,191 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 22:14:06,191 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 22:14:06,192 INFO L158 Benchmark]: Toolchain (without parser) took 25735.25ms. Allocated memory was 86.0MB in the beginning and 547.4MB in the end (delta: 461.4MB). Free memory was 60.7MB in the beginning and 295.0MB in the end (delta: -234.3MB). Peak memory consumption was 227.3MB. Max. memory is 16.1GB. [2023-08-29 22:14:06,192 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 58.7MB. Free memory was 36.7MB in the beginning and 36.7MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 22:14:06,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 848.57ms. Allocated memory is still 86.0MB. Free memory was 60.7MB in the beginning and 41.5MB in the end (delta: 19.2MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2023-08-29 22:14:06,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.52ms. Allocated memory is still 86.0MB. Free memory was 41.5MB in the beginning and 38.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 22:14:06,193 INFO L158 Benchmark]: Boogie Preprocessor took 64.21ms. Allocated memory is still 86.0MB. Free memory was 38.1MB in the beginning and 60.4MB in the end (delta: -22.3MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2023-08-29 22:14:06,193 INFO L158 Benchmark]: RCFGBuilder took 726.81ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 60.4MB in the beginning and 71.1MB in the end (delta: -10.7MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2023-08-29 22:14:06,194 INFO L158 Benchmark]: TraceAbstraction took 24022.67ms. Allocated memory was 104.9MB in the beginning and 547.4MB in the end (delta: 442.5MB). Free memory was 70.1MB in the beginning and 296.0MB in the end (delta: -226.0MB). Peak memory consumption was 217.1MB. Max. memory is 16.1GB. [2023-08-29 22:14:06,194 INFO L158 Benchmark]: Witness Printer took 2.70ms. Allocated memory is still 547.4MB. Free memory was 296.0MB in the beginning and 295.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 22:14:06,196 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.18ms. Allocated memory is still 58.7MB. Free memory was 36.7MB in the beginning and 36.7MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 848.57ms. Allocated memory is still 86.0MB. Free memory was 60.7MB in the beginning and 41.5MB in the end (delta: 19.2MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.52ms. Allocated memory is still 86.0MB. Free memory was 41.5MB in the beginning and 38.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.21ms. Allocated memory is still 86.0MB. Free memory was 38.1MB in the beginning and 60.4MB in the end (delta: -22.3MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * RCFGBuilder took 726.81ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 60.4MB in the beginning and 71.1MB in the end (delta: -10.7MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * TraceAbstraction took 24022.67ms. Allocated memory was 104.9MB in the beginning and 547.4MB in the end (delta: 442.5MB). Free memory was 70.1MB in the beginning and 296.0MB in the end (delta: -226.0MB). Peak memory consumption was 217.1MB. Max. memory is 16.1GB. * Witness Printer took 2.70ms. Allocated memory is still 547.4MB. Free memory was 296.0MB in the beginning and 295.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.6s, 276 PlacesBefore, 126 PlacesAfterwards, 302 TransitionsBefore, 148 TransitionsAfterwards, 27832 CoEnabledTransitionPairs, 7 FixpointIterations, 74 TrivialSequentialCompositions, 150 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 244 TotalNumberOfCompositions, 104044 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 27391, independent: 26194, independent conditional: 0, independent unconditional: 26194, dependent: 1197, dependent conditional: 0, dependent unconditional: 1197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 13154, independent: 12916, independent conditional: 0, independent unconditional: 12916, dependent: 238, dependent conditional: 0, dependent unconditional: 238, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27391, independent: 13278, independent conditional: 0, independent unconditional: 13278, dependent: 959, dependent conditional: 0, dependent unconditional: 959, unknown: 13154, unknown conditional: 0, unknown unconditional: 13154] , Statistics on independence cache: Total cache size (in pairs): 2177, Positive cache size: 2049, Positive conditional cache size: 0, Positive unconditional cache size: 2049, Negative cache size: 128, Negative conditional cache size: 0, Negative unconditional cache size: 128, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 1235]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1235. Possible FailurePath: [L1240] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1241-L1244] 0 struct s { int datum; struct s *next; } *A; [L1253] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1254] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1267] 0 struct s *p; [L1268] 0 A = malloc(sizeof(struct s)) [L1269] EXPR 0 \read(*A) [L1269] CALL 0 init(A,3) [L1246] 0 p -> datum = x [L1247] 0 p -> next = ((void *)0) [L1269] RET 0 init(A,3) [L1270] 0 pthread_t t_ids[10000]; [L1270] 0 int i=0; VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, __global_lock={3:0}, i=0, t_ids={14:0}] [L1270] COND TRUE 0 i<10000 [L1270] FCALL, FORK 0 pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0)) VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, __global_lock={3:0}, i=0, pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0))=-1, t_ids={14:0}] [L1256] 1 struct s *p = malloc(sizeof(struct s)); [L1257] CALL 1 init(p,7) [L1246] 1 p -> datum = x VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, \old(x)=3, \old(x)=7, __global_lock={3:0}, p={-2:0}, p={-2:0}, p={9:0}, p={9:0}, x=3, x=7] [L1247] 1 p -> next = ((void *)0) [L1257] RET 1 init(p,7) [L1259] CALL 1 insert(p, &A) [L1250] EXPR 1 \read(**list) VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, \read(**list)={-2:0}, __global_lock={3:0}, list={4:0}, list={4:0}, p={9:0}, p={9:0}] [L1250] 1 p->next = *list VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, \read(**list)={-2:0}, __global_lock={3:0}, list={4:0}, list={4:0}, p={9:0}, p={9:0}] [L1251] 1 *list = p VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, __global_lock={3:0}, list={4:0}, list={4:0}, p={9:0}, p={9:0}] [L1259] RET 1 insert(p, &A) [L1262] COND FALSE 1 !(__VERIFIER_nondet_int()) [L1262] EXPR 1 p->datum [L1262] CALL 1 __VERIFIER_assert((p->datum) == 0) [L1235] COND TRUE 1 !(cond) [L1235] 1 reach_error() VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, \old(cond)=0, __global_lock={3:0}, cond=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1266]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 361 locations, 83 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4729 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2832 mSDsluCounter, 267 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 108 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5560 IncrementalHoareTripleChecker+Invalid, 5711 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 159 mSDtfsCounter, 5560 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=0, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 642 SizeOfPredicates, 1 NumberOfNonLiveVariables, 434 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 0/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 22:14:06,232 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 0 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_94-alloc_region_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 7faac9952fd378b53dcd8f21391daa9cc75834f7be2a5ad0c70d96fc8524bd08 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 22:14:08,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 22:14:08,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 22:14:08,145 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 22:14:08,147 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 22:14:08,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 22:14:08,152 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 22:14:08,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 22:14:08,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 22:14:08,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 22:14:08,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 22:14:08,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 22:14:08,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 22:14:08,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 22:14:08,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 22:14:08,171 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 22:14:08,172 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 22:14:08,174 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 22:14:08,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 22:14:08,179 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 22:14:08,186 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 22:14:08,187 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 22:14:08,188 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 22:14:08,189 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 22:14:08,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 22:14:08,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 22:14:08,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 22:14:08,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 22:14:08,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 22:14:08,198 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 22:14:08,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 22:14:08,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 22:14:08,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 22:14:08,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 22:14:08,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 22:14:08,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 22:14:08,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 22:14:08,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 22:14:08,210 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 22:14:08,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 22:14:08,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 22:14:08,212 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 22:14:08,244 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 22:14:08,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 22:14:08,245 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 22:14:08,246 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 22:14:08,246 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 22:14:08,246 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 22:14:08,247 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 22:14:08,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 22:14:08,247 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 22:14:08,248 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 22:14:08,248 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 22:14:08,248 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 22:14:08,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 22:14:08,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 22:14:08,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 22:14:08,249 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 22:14:08,249 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 22:14:08,250 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 22:14:08,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 22:14:08,250 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 22:14:08,250 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 22:14:08,250 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 22:14:08,250 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 22:14:08,251 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 22:14:08,251 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 22:14:08,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 22:14:08,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 22:14:08,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 22:14:08,252 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 22:14:08,252 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 22:14:08,252 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 22:14:08,252 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 22:14:08,253 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 22:14:08,253 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 22:14:08,253 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 22:14:08,253 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 22:14:08,253 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 22:14:08,253 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 -> 7faac9952fd378b53dcd8f21391daa9cc75834f7be2a5ad0c70d96fc8524bd08 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 22:14:08,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 22:14:08,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 22:14:08,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 22:14:08,553 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 22:14:08,553 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 22:14:08,554 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_94-alloc_region_racing.i [2023-08-29 22:14:09,723 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 22:14:10,020 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 22:14:10,020 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_94-alloc_region_racing.i [2023-08-29 22:14:10,034 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a76dda29/8cde998ad0d7476987cfbaf3ca6e3f99/FLAG14cbd545f [2023-08-29 22:14:10,048 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a76dda29/8cde998ad0d7476987cfbaf3ca6e3f99 [2023-08-29 22:14:10,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 22:14:10,051 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 22:14:10,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 22:14:10,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 22:14:10,056 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 22:14:10,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 10:14:10" (1/1) ... [2023-08-29 22:14:10,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9561e37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:14:10, skipping insertion in model container [2023-08-29 22:14:10,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 10:14:10" (1/1) ... [2023-08-29 22:14:10,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 22:14:10,104 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 22:14:10,536 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_94-alloc_region_racing.i[58135,58148] [2023-08-29 22:14:10,561 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 22:14:10,607 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 22:14:10,660 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_94-alloc_region_racing.i[58135,58148] [2023-08-29 22:14:10,669 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 22:14:10,743 INFO L208 MainTranslator]: Completed translation [2023-08-29 22:14:10,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:14:10 WrapperNode [2023-08-29 22:14:10,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 22:14:10,745 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 22:14:10,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 22:14:10,745 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 22:14:10,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:14:10" (1/1) ... [2023-08-29 22:14:10,769 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:14:10" (1/1) ... [2023-08-29 22:14:10,795 INFO L138 Inliner]: procedures = 381, calls = 72, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 237 [2023-08-29 22:14:10,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 22:14:10,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 22:14:10,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 22:14:10,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 22:14:10,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:14:10" (1/1) ... [2023-08-29 22:14:10,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:14:10" (1/1) ... [2023-08-29 22:14:10,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:14:10" (1/1) ... [2023-08-29 22:14:10,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:14:10" (1/1) ... [2023-08-29 22:14:10,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:14:10" (1/1) ... [2023-08-29 22:14:10,835 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:14:10" (1/1) ... [2023-08-29 22:14:10,837 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:14:10" (1/1) ... [2023-08-29 22:14:10,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:14:10" (1/1) ... [2023-08-29 22:14:10,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 22:14:10,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 22:14:10,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 22:14:10,843 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 22:14:10,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:14:10" (1/1) ... [2023-08-29 22:14:10,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 22:14:10,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 22:14:10,874 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 22:14:10,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 22:14:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-29 22:14:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 22:14:10,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-08-29 22:14:10,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 22:14:10,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 22:14:10,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-08-29 22:14:10,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 22:14:10,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-29 22:14:10,921 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-29 22:14:10,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-29 22:14:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 22:14:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-08-29 22:14:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-29 22:14:10,922 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-29 22:14:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 22:14:10,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 22:14:10,924 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 22:14:11,134 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 22:14:11,136 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 22:14:11,739 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 22:14:11,746 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 22:14:11,746 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-29 22:14:11,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:14:11 BoogieIcfgContainer [2023-08-29 22:14:11,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 22:14:11,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 22:14:11,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 22:14:11,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 22:14:11,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 10:14:10" (1/3) ... [2023-08-29 22:14:11,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6acd5a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 10:14:11, skipping insertion in model container [2023-08-29 22:14:11,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:14:10" (2/3) ... [2023-08-29 22:14:11,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6acd5a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 10:14:11, skipping insertion in model container [2023-08-29 22:14:11,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:14:11" (3/3) ... [2023-08-29 22:14:11,755 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_94-alloc_region_racing.i [2023-08-29 22:14:11,769 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 22:14:11,769 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2023-08-29 22:14:11,769 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 22:14:11,877 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-29 22:14:11,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 301 transitions, 610 flow [2023-08-29 22:14:12,085 INFO L130 PetriNetUnfolder]: 45/436 cut-off events. [2023-08-29 22:14:12,085 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 22:14:12,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 436 events. 45/436 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1676 event pairs, 0 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 237. Up to 8 conditions per place. [2023-08-29 22:14:12,097 INFO L82 GeneralOperation]: Start removeDead. Operand has 275 places, 301 transitions, 610 flow [2023-08-29 22:14:12,108 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 301 transitions, 610 flow [2023-08-29 22:14:12,112 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 22:14:12,127 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 275 places, 301 transitions, 610 flow [2023-08-29 22:14:12,128 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 275 places, 301 transitions, 610 flow [2023-08-29 22:14:12,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 301 transitions, 610 flow [2023-08-29 22:14:12,196 INFO L130 PetriNetUnfolder]: 45/436 cut-off events. [2023-08-29 22:14:12,197 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 22:14:12,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 436 events. 45/436 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1676 event pairs, 0 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 237. Up to 8 conditions per place. [2023-08-29 22:14:12,214 INFO L119 LiptonReduction]: Number of co-enabled transitions 27354 [2023-08-29 22:14:43,330 WARN L222 SmtUtils]: Spent 8.86s on a formula simplification. DAG size of input: 125 DAG size of output: 119 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-29 22:14:57,183 WARN L222 SmtUtils]: Spent 10.14s on a formula simplification. DAG size of input: 125 DAG size of output: 117 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-29 22:15:39,790 WARN L222 SmtUtils]: Spent 37.73s on a formula simplification. DAG size of input: 225 DAG size of output: 217 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-29 22:15:58,621 WARN L222 SmtUtils]: Spent 18.83s on a formula simplification that was a NOOP. DAG size: 217 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-29 22:16:15,800 WARN L222 SmtUtils]: Spent 17.18s on a formula simplification. DAG size of input: 221 DAG size of output: 213 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-29 22:16:24,208 WARN L222 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 213 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-29 22:16:24,323 INFO L134 LiptonReduction]: Checked pairs total: 103181 [2023-08-29 22:16:24,324 INFO L136 LiptonReduction]: Total number of compositions: 242 [2023-08-29 22:16:24,335 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 22:16:24,339 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;@2e175915, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 22:16:24,339 INFO L358 AbstractCegarLoop]: Starting to check reachability of 82 error locations. [2023-08-29 22:16:24,341 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 22:16:24,341 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 22:16:24,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:16:24,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 22:16:24,342 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:16:24,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:16:24,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1087, now seen corresponding path program 1 times [2023-08-29 22:16:24,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 22:16:24,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92058097] [2023-08-29 22:16:24,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:16:24,356 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-29 22:16:24,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 22:16:24,363 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-29 22:16:24,364 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-29 22:16:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:16:24,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 22:16:24,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:16:24,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:16:24,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 22:16:24,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 22:16:24,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92058097] [2023-08-29 22:16:24,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92058097] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:16:24,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:16:24,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 22:16:24,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496406885] [2023-08-29 22:16:24,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:16:24,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 22:16:24,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 22:16:24,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 22:16:24,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 22:16:24,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 543 [2023-08-29 22:16:24,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 148 transitions, 304 flow. Second operand has 2 states, 2 states have (on average 272.5) internal successors, (545), 2 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:24,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:16:24,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 543 [2023-08-29 22:16:24,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:16:25,320 INFO L130 PetriNetUnfolder]: 1488/3669 cut-off events. [2023-08-29 22:16:25,321 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 22:16:25,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6583 conditions, 3669 events. 1488/3669 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 27687 event pairs, 1376 based on Foata normal form. 266/2359 useless extension candidates. Maximal degree in co-relation 6457. Up to 2908 conditions per place. [2023-08-29 22:16:25,338 INFO L137 encePairwiseOnDemand]: 514/543 looper letters, 80 selfloop transitions, 0 changer transitions 0/119 dead transitions. [2023-08-29 22:16:25,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 119 transitions, 406 flow [2023-08-29 22:16:25,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 22:16:25,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 22:16:25,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 653 transitions. [2023-08-29 22:16:25,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6012891344383057 [2023-08-29 22:16:25,362 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 653 transitions. [2023-08-29 22:16:25,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 653 transitions. [2023-08-29 22:16:25,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:16:25,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 653 transitions. [2023-08-29 22:16:25,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 326.5) internal successors, (653), 2 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:25,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:25,382 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:25,384 INFO L175 Difference]: Start difference. First operand has 126 places, 148 transitions, 304 flow. Second operand 2 states and 653 transitions. [2023-08-29 22:16:25,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 119 transitions, 406 flow [2023-08-29 22:16:25,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 119 transitions, 406 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 22:16:25,391 INFO L231 Difference]: Finished difference. Result has 119 places, 119 transitions, 246 flow [2023-08-29 22:16:25,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=246, PETRI_PLACES=119, PETRI_TRANSITIONS=119} [2023-08-29 22:16:25,397 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -7 predicate places. [2023-08-29 22:16:25,397 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 119 transitions, 246 flow [2023-08-29 22:16:25,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 272.5) internal successors, (545), 2 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:25,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:16:25,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 22:16:25,415 INFO L552 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)] Ended with exit code 0 [2023-08-29 22:16:25,610 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-29 22:16:25,610 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:16:25,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:16:25,611 INFO L85 PathProgramCache]: Analyzing trace with hash 34714, now seen corresponding path program 1 times [2023-08-29 22:16:25,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 22:16:25,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610256733] [2023-08-29 22:16:25,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:16:25,612 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-29 22:16:25,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 22:16:25,614 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-29 22:16:25,617 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-29 22:16:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:16:25,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 22:16:25,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:16:25,795 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 22:16:25,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-08-29 22:16:25,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:16:25,813 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 22:16:25,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 22:16:25,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610256733] [2023-08-29 22:16:25,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610256733] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:16:25,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:16:25,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 22:16:25,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049107368] [2023-08-29 22:16:25,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:16:25,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 22:16:25,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 22:16:25,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 22:16:25,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 22:16:26,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 543 [2023-08-29 22:16:26,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 264.6666666666667) internal successors, (794), 3 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:26,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:16:26,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 543 [2023-08-29 22:16:26,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:16:27,217 INFO L130 PetriNetUnfolder]: 1483/3642 cut-off events. [2023-08-29 22:16:27,217 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 22:16:27,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6521 conditions, 3642 events. 1483/3642 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 27419 event pairs, 1344 based on Foata normal form. 0/2089 useless extension candidates. Maximal degree in co-relation 6517. Up to 2868 conditions per place. [2023-08-29 22:16:27,235 INFO L137 encePairwiseOnDemand]: 538/543 looper letters, 81 selfloop transitions, 3 changer transitions 0/123 dead transitions. [2023-08-29 22:16:27,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 123 transitions, 422 flow [2023-08-29 22:16:27,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 22:16:27,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 22:16:27,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 878 transitions. [2023-08-29 22:16:27,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5389809699201964 [2023-08-29 22:16:27,239 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 878 transitions. [2023-08-29 22:16:27,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 878 transitions. [2023-08-29 22:16:27,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:16:27,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 878 transitions. [2023-08-29 22:16:27,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 292.6666666666667) internal successors, (878), 3 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:27,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 543.0) internal successors, (2172), 4 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:27,246 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 543.0) internal successors, (2172), 4 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:27,246 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 246 flow. Second operand 3 states and 878 transitions. [2023-08-29 22:16:27,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 123 transitions, 422 flow [2023-08-29 22:16:27,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 123 transitions, 422 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 22:16:27,250 INFO L231 Difference]: Finished difference. Result has 122 places, 121 transitions, 267 flow [2023-08-29 22:16:27,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=267, PETRI_PLACES=122, PETRI_TRANSITIONS=121} [2023-08-29 22:16:27,251 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -4 predicate places. [2023-08-29 22:16:27,251 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 121 transitions, 267 flow [2023-08-29 22:16:27,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.6666666666667) internal successors, (794), 3 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:27,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:16:27,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 22:16:27,265 INFO L552 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)] Ended with exit code 0 [2023-08-29 22:16:27,461 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-29 22:16:27,462 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:16:27,464 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:16:27,464 INFO L85 PathProgramCache]: Analyzing trace with hash 34715, now seen corresponding path program 1 times [2023-08-29 22:16:27,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 22:16:27,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788508090] [2023-08-29 22:16:27,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:16:27,465 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-29 22:16:27,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 22:16:27,466 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-29 22:16:27,481 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-29 22:16:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:16:27,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 22:16:27,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:16:27,605 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-29 22:16:27,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 19 [2023-08-29 22:16:27,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:16:27,616 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 22:16:27,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 22:16:27,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788508090] [2023-08-29 22:16:27,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788508090] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:16:27,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:16:27,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 22:16:27,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907163212] [2023-08-29 22:16:27,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:16:27,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 22:16:27,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 22:16:27,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 22:16:27,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 22:16:27,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 543 [2023-08-29 22:16:27,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 121 transitions, 267 flow. Second operand has 3 states, 3 states have (on average 264.6666666666667) internal successors, (794), 3 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:27,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:16:27,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 543 [2023-08-29 22:16:27,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:16:28,703 INFO L130 PetriNetUnfolder]: 1415/3508 cut-off events. [2023-08-29 22:16:28,704 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2023-08-29 22:16:28,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6401 conditions, 3508 events. 1415/3508 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 26322 event pairs, 1216 based on Foata normal form. 0/2082 useless extension candidates. Maximal degree in co-relation 6395. Up to 2607 conditions per place. [2023-08-29 22:16:28,720 INFO L137 encePairwiseOnDemand]: 539/543 looper letters, 110 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2023-08-29 22:16:28,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 151 transitions, 553 flow [2023-08-29 22:16:28,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 22:16:28,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 22:16:28,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2023-08-29 22:16:28,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5549416820135052 [2023-08-29 22:16:28,723 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 904 transitions. [2023-08-29 22:16:28,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 904 transitions. [2023-08-29 22:16:28,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:16:28,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 904 transitions. [2023-08-29 22:16:28,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:28,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 543.0) internal successors, (2172), 4 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:28,730 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 543.0) internal successors, (2172), 4 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:28,730 INFO L175 Difference]: Start difference. First operand has 122 places, 121 transitions, 267 flow. Second operand 3 states and 904 transitions. [2023-08-29 22:16:28,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 151 transitions, 553 flow [2023-08-29 22:16:28,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 151 transitions, 550 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 22:16:28,734 INFO L231 Difference]: Finished difference. Result has 121 places, 119 transitions, 264 flow [2023-08-29 22:16:28,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=121, PETRI_TRANSITIONS=119} [2023-08-29 22:16:28,734 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -5 predicate places. [2023-08-29 22:16:28,735 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 119 transitions, 264 flow [2023-08-29 22:16:28,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.6666666666667) internal successors, (794), 3 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:28,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:16:28,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 22:16:28,745 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-29 22:16:28,944 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-29 22:16:28,945 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:16:28,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:16:28,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1035045106, now seen corresponding path program 1 times [2023-08-29 22:16:28,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 22:16:28,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069047552] [2023-08-29 22:16:28,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:16:28,946 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-29 22:16:28,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 22:16:28,950 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-29 22:16:28,951 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-29 22:16:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:16:29,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 22:16:29,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:16:29,081 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 22:16:29,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-08-29 22:16:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:16:29,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 22:16:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:16:29,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 22:16:29,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069047552] [2023-08-29 22:16:29,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069047552] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 22:16:29,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-29 22:16:29,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2023-08-29 22:16:29,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110107496] [2023-08-29 22:16:29,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-29 22:16:29,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 22:16:29,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 22:16:29,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 22:16:29,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-29 22:16:31,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 543 [2023-08-29 22:16:31,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 119 transitions, 264 flow. Second operand has 6 states, 6 states have (on average 262.6666666666667) internal successors, (1576), 6 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:31,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:16:31,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 543 [2023-08-29 22:16:31,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:16:33,113 INFO L130 PetriNetUnfolder]: 1309/3410 cut-off events. [2023-08-29 22:16:33,114 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2023-08-29 22:16:33,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6120 conditions, 3410 events. 1309/3410 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 27300 event pairs, 0 based on Foata normal form. 1/2049 useless extension candidates. Maximal degree in co-relation 6114. Up to 2433 conditions per place. [2023-08-29 22:16:33,128 INFO L137 encePairwiseOnDemand]: 538/543 looper letters, 137 selfloop transitions, 6 changer transitions 0/182 dead transitions. [2023-08-29 22:16:33,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 182 transitions, 674 flow [2023-08-29 22:16:33,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 22:16:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 22:16:33,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1712 transitions. [2023-08-29 22:16:33,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525475751995089 [2023-08-29 22:16:33,133 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1712 transitions. [2023-08-29 22:16:33,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1712 transitions. [2023-08-29 22:16:33,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:16:33,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1712 transitions. [2023-08-29 22:16:33,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 285.3333333333333) internal successors, (1712), 6 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:33,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 543.0) internal successors, (3801), 7 states have internal predecessors, (3801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:33,144 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 543.0) internal successors, (3801), 7 states have internal predecessors, (3801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:33,144 INFO L175 Difference]: Start difference. First operand has 121 places, 119 transitions, 264 flow. Second operand 6 states and 1712 transitions. [2023-08-29 22:16:33,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 182 transitions, 674 flow [2023-08-29 22:16:33,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 182 transitions, 670 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 22:16:33,148 INFO L231 Difference]: Finished difference. Result has 123 places, 118 transitions, 268 flow [2023-08-29 22:16:33,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=123, PETRI_TRANSITIONS=118} [2023-08-29 22:16:33,149 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -3 predicate places. [2023-08-29 22:16:33,149 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 118 transitions, 268 flow [2023-08-29 22:16:33,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 262.6666666666667) internal successors, (1576), 6 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:33,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:16:33,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 22:16:33,163 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-29 22:16:33,360 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-29 22:16:33,360 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:16:33,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:16:33,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1035045081, now seen corresponding path program 1 times [2023-08-29 22:16:33,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 22:16:33,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299081903] [2023-08-29 22:16:33,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:16:33,364 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-29 22:16:33,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 22:16:33,365 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-29 22:16:33,365 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-29 22:16:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:16:33,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 22:16:33,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:16:33,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-29 22:16:33,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:16:33,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 22:16:33,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 22:16:33,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299081903] [2023-08-29 22:16:33,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299081903] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:16:33,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:16:33,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 22:16:33,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213913399] [2023-08-29 22:16:33,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:16:33,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 22:16:33,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 22:16:33,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 22:16:33,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 22:16:33,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 543 [2023-08-29 22:16:33,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 118 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:33,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:16:33,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 543 [2023-08-29 22:16:33,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:16:34,459 INFO L130 PetriNetUnfolder]: 1301/3209 cut-off events. [2023-08-29 22:16:34,459 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2023-08-29 22:16:34,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5868 conditions, 3209 events. 1301/3209 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 23760 event pairs, 1170 based on Foata normal form. 0/1939 useless extension candidates. Maximal degree in co-relation 5862. Up to 2510 conditions per place. [2023-08-29 22:16:34,481 INFO L137 encePairwiseOnDemand]: 541/543 looper letters, 77 selfloop transitions, 2 changer transitions 0/118 dead transitions. [2023-08-29 22:16:34,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 118 transitions, 426 flow [2023-08-29 22:16:34,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 22:16:34,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 22:16:34,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 889 transitions. [2023-08-29 22:16:34,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5457335788827502 [2023-08-29 22:16:34,484 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 889 transitions. [2023-08-29 22:16:34,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 889 transitions. [2023-08-29 22:16:34,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:16:34,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 889 transitions. [2023-08-29 22:16:34,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:34,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 543.0) internal successors, (2172), 4 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:34,491 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 543.0) internal successors, (2172), 4 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:34,491 INFO L175 Difference]: Start difference. First operand has 123 places, 118 transitions, 268 flow. Second operand 3 states and 889 transitions. [2023-08-29 22:16:34,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 118 transitions, 426 flow [2023-08-29 22:16:34,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 118 transitions, 412 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 22:16:34,496 INFO L231 Difference]: Finished difference. Result has 121 places, 117 transitions, 256 flow [2023-08-29 22:16:34,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=121, PETRI_TRANSITIONS=117} [2023-08-29 22:16:34,499 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -5 predicate places. [2023-08-29 22:16:34,499 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 117 transitions, 256 flow [2023-08-29 22:16:34,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:34,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:16:34,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 22:16:34,515 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 (6)] Forceful destruction successful, exit code 0 [2023-08-29 22:16:34,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-29 22:16:34,712 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:16:34,712 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:16:34,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1035045082, now seen corresponding path program 1 times [2023-08-29 22:16:34,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 22:16:34,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398404960] [2023-08-29 22:16:34,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:16:34,713 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-29 22:16:34,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 22:16:34,714 INFO L229 MonitoredProcess]: Starting monitored process 7 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-29 22:16:34,717 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 (7)] Waiting until timeout for monitored process [2023-08-29 22:16:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:16:34,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 22:16:34,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:16:34,804 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 7 [2023-08-29 22:16:34,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:16:34,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 22:16:34,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 22:16:34,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398404960] [2023-08-29 22:16:34,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398404960] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:16:34,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:16:34,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 22:16:34,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182574435] [2023-08-29 22:16:34,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:16:34,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 22:16:34,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 22:16:34,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 22:16:34,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 22:16:35,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 543 [2023-08-29 22:16:35,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 117 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:35,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:16:35,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 543 [2023-08-29 22:16:35,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:16:36,032 INFO L130 PetriNetUnfolder]: 1287/3231 cut-off events. [2023-08-29 22:16:36,032 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2023-08-29 22:16:36,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5799 conditions, 3231 events. 1287/3231 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 24447 event pairs, 1074 based on Foata normal form. 0/1982 useless extension candidates. Maximal degree in co-relation 5794. Up to 2395 conditions per place. [2023-08-29 22:16:36,046 INFO L137 encePairwiseOnDemand]: 539/543 looper letters, 105 selfloop transitions, 4 changer transitions 0/148 dead transitions. [2023-08-29 22:16:36,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 148 transitions, 536 flow [2023-08-29 22:16:36,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 22:16:36,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 22:16:36,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 919 transitions. [2023-08-29 22:16:36,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5641497851442603 [2023-08-29 22:16:36,049 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 919 transitions. [2023-08-29 22:16:36,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 919 transitions. [2023-08-29 22:16:36,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:16:36,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 919 transitions. [2023-08-29 22:16:36,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:36,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 543.0) internal successors, (2172), 4 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:36,056 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 543.0) internal successors, (2172), 4 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:36,056 INFO L175 Difference]: Start difference. First operand has 121 places, 117 transitions, 256 flow. Second operand 3 states and 919 transitions. [2023-08-29 22:16:36,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 148 transitions, 536 flow [2023-08-29 22:16:36,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 148 transitions, 534 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 22:16:36,059 INFO L231 Difference]: Finished difference. Result has 124 places, 118 transitions, 276 flow [2023-08-29 22:16:36,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=124, PETRI_TRANSITIONS=118} [2023-08-29 22:16:36,060 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -2 predicate places. [2023-08-29 22:16:36,060 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 118 transitions, 276 flow [2023-08-29 22:16:36,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:36,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:16:36,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 22:16:36,078 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 (7)] Forceful destruction successful, exit code 0 [2023-08-29 22:16:36,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-29 22:16:36,271 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:16:36,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:16:36,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2021627235, now seen corresponding path program 1 times [2023-08-29 22:16:36,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 22:16:36,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33300203] [2023-08-29 22:16:36,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:16:36,273 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-29 22:16:36,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 22:16:36,275 INFO L229 MonitoredProcess]: Starting monitored process 8 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-29 22:16:36,277 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 (8)] Waiting until timeout for monitored process [2023-08-29 22:16:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:16:36,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-29 22:16:36,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:16:36,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:16:36,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 22:16:36,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 22:16:36,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33300203] [2023-08-29 22:16:36,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [33300203] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:16:36,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:16:36,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 22:16:36,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954868675] [2023-08-29 22:16:36,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:16:36,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 22:16:36,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 22:16:36,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 22:16:36,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 22:16:36,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 543 [2023-08-29 22:16:36,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 118 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:36,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:16:36,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 543 [2023-08-29 22:16:36,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:16:37,505 INFO L130 PetriNetUnfolder]: 1315/3313 cut-off events. [2023-08-29 22:16:37,506 INFO L131 PetriNetUnfolder]: For 158/158 co-relation queries the response was YES. [2023-08-29 22:16:37,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6080 conditions, 3313 events. 1315/3313 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 25336 event pairs, 814 based on Foata normal form. 0/2085 useless extension candidates. Maximal degree in co-relation 6074. Up to 2437 conditions per place. [2023-08-29 22:16:37,515 INFO L137 encePairwiseOnDemand]: 539/543 looper letters, 145 selfloop transitions, 4 changer transitions 0/187 dead transitions. [2023-08-29 22:16:37,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 187 transitions, 719 flow [2023-08-29 22:16:37,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 22:16:37,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 22:16:37,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 942 transitions. [2023-08-29 22:16:37,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.578268876611418 [2023-08-29 22:16:37,518 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 942 transitions. [2023-08-29 22:16:37,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 942 transitions. [2023-08-29 22:16:37,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:16:37,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 942 transitions. [2023-08-29 22:16:37,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 314.0) internal successors, (942), 3 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:37,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 543.0) internal successors, (2172), 4 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:37,524 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 543.0) internal successors, (2172), 4 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:37,524 INFO L175 Difference]: Start difference. First operand has 124 places, 118 transitions, 276 flow. Second operand 3 states and 942 transitions. [2023-08-29 22:16:37,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 187 transitions, 719 flow [2023-08-29 22:16:37,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 187 transitions, 709 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 22:16:37,527 INFO L231 Difference]: Finished difference. Result has 126 places, 120 transitions, 296 flow [2023-08-29 22:16:37,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=126, PETRI_TRANSITIONS=120} [2023-08-29 22:16:37,528 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, 0 predicate places. [2023-08-29 22:16:37,528 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 120 transitions, 296 flow [2023-08-29 22:16:37,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:37,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:16:37,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 22:16:37,538 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 (8)] Forceful destruction successful, exit code 0 [2023-08-29 22:16:37,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-29 22:16:37,734 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:16:37,734 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:16:37,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2021627236, now seen corresponding path program 1 times [2023-08-29 22:16:37,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 22:16:37,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700834693] [2023-08-29 22:16:37,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:16:37,735 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-29 22:16:37,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 22:16:37,736 INFO L229 MonitoredProcess]: Starting monitored process 9 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-29 22:16:37,763 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 (9)] Waiting until timeout for monitored process [2023-08-29 22:16:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:16:37,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 22:16:37,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:16:37,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-29 22:16:37,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:16:37,895 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 22:16:37,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 22:16:37,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700834693] [2023-08-29 22:16:37,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700834693] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:16:37,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:16:37,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 22:16:37,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631016082] [2023-08-29 22:16:37,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:16:37,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 22:16:37,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 22:16:37,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 22:16:37,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 22:16:38,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 543 [2023-08-29 22:16:38,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 120 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 267.5) internal successors, (1070), 4 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:38,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:16:38,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 543 [2023-08-29 22:16:38,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:16:39,430 INFO L130 PetriNetUnfolder]: 1316/3303 cut-off events. [2023-08-29 22:16:39,430 INFO L131 PetriNetUnfolder]: For 443/444 co-relation queries the response was YES. [2023-08-29 22:16:39,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6221 conditions, 3303 events. 1316/3303 cut-off events. For 443/444 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 25264 event pairs, 866 based on Foata normal form. 43/2119 useless extension candidates. Maximal degree in co-relation 6214. Up to 2554 conditions per place. [2023-08-29 22:16:39,443 INFO L137 encePairwiseOnDemand]: 539/543 looper letters, 117 selfloop transitions, 5 changer transitions 0/160 dead transitions. [2023-08-29 22:16:39,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 160 transitions, 623 flow [2023-08-29 22:16:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 22:16:39,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 22:16:39,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1184 transitions. [2023-08-29 22:16:39,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5451197053406999 [2023-08-29 22:16:39,448 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1184 transitions. [2023-08-29 22:16:39,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1184 transitions. [2023-08-29 22:16:39,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:16:39,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1184 transitions. [2023-08-29 22:16:39,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 296.0) internal successors, (1184), 4 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:39,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 543.0) internal successors, (2715), 5 states have internal predecessors, (2715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:39,455 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 543.0) internal successors, (2715), 5 states have internal predecessors, (2715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:39,456 INFO L175 Difference]: Start difference. First operand has 126 places, 120 transitions, 296 flow. Second operand 4 states and 1184 transitions. [2023-08-29 22:16:39,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 160 transitions, 623 flow [2023-08-29 22:16:39,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 160 transitions, 615 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 22:16:39,459 INFO L231 Difference]: Finished difference. Result has 126 places, 119 transitions, 296 flow [2023-08-29 22:16:39,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=296, PETRI_PLACES=126, PETRI_TRANSITIONS=119} [2023-08-29 22:16:39,461 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, 0 predicate places. [2023-08-29 22:16:39,461 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 119 transitions, 296 flow [2023-08-29 22:16:39,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 267.5) internal successors, (1070), 4 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:39,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:16:39,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:16:39,475 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 (9)] Forceful destruction successful, exit code 0 [2023-08-29 22:16:39,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-29 22:16:39,671 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:16:39,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:16:39,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1754026176, now seen corresponding path program 1 times [2023-08-29 22:16:39,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 22:16:39,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834882642] [2023-08-29 22:16:39,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:16:39,672 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-29 22:16:39,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 22:16:39,681 INFO L229 MonitoredProcess]: Starting monitored process 10 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-29 22:16:39,684 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 (10)] Waiting until timeout for monitored process [2023-08-29 22:16:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:16:39,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 22:16:39,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:16:39,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:16:39,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 22:16:39,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:16:39,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 22:16:39,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834882642] [2023-08-29 22:16:39,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834882642] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 22:16:39,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-29 22:16:39,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-08-29 22:16:39,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744026148] [2023-08-29 22:16:39,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-29 22:16:39,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 22:16:39,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 22:16:39,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 22:16:39,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-29 22:16:39,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 543 [2023-08-29 22:16:39,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 119 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 269.1666666666667) internal successors, (1615), 6 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:39,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:16:39,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 543 [2023-08-29 22:16:39,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:16:40,387 INFO L130 PetriNetUnfolder]: 63/193 cut-off events. [2023-08-29 22:16:40,387 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2023-08-29 22:16:40,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 193 events. 63/193 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 672 event pairs, 23 based on Foata normal form. 30/176 useless extension candidates. Maximal degree in co-relation 414. Up to 122 conditions per place. [2023-08-29 22:16:40,388 INFO L137 encePairwiseOnDemand]: 540/543 looper letters, 53 selfloop transitions, 3 changer transitions 11/79 dead transitions. [2023-08-29 22:16:40,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 79 transitions, 330 flow [2023-08-29 22:16:40,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 22:16:40,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 22:16:40,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1134 transitions. [2023-08-29 22:16:40,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5220994475138122 [2023-08-29 22:16:40,393 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1134 transitions. [2023-08-29 22:16:40,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1134 transitions. [2023-08-29 22:16:40,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:16:40,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1134 transitions. [2023-08-29 22:16:40,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 283.5) internal successors, (1134), 4 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:40,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 543.0) internal successors, (2715), 5 states have internal predecessors, (2715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:40,401 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 543.0) internal successors, (2715), 5 states have internal predecessors, (2715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:40,401 INFO L175 Difference]: Start difference. First operand has 126 places, 119 transitions, 296 flow. Second operand 4 states and 1134 transitions. [2023-08-29 22:16:40,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 79 transitions, 330 flow [2023-08-29 22:16:40,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 79 transitions, 308 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-29 22:16:40,404 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 109 flow [2023-08-29 22:16:40,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2023-08-29 22:16:40,405 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -67 predicate places. [2023-08-29 22:16:40,405 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 109 flow [2023-08-29 22:16:40,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 269.1666666666667) internal successors, (1615), 6 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:40,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:16:40,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:16:40,416 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 (10)] Forceful destruction successful, exit code 0 [2023-08-29 22:16:40,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-29 22:16:40,616 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:16:40,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:16:40,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1458727442, now seen corresponding path program 1 times [2023-08-29 22:16:40,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 22:16:40,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437074004] [2023-08-29 22:16:40,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:16:40,617 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-29 22:16:40,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 22:16:40,618 INFO L229 MonitoredProcess]: Starting monitored process 11 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-29 22:16:40,631 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 (11)] Waiting until timeout for monitored process [2023-08-29 22:16:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:16:40,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 23 conjunts are in the unsatisfiable core [2023-08-29 22:16:40,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:16:40,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 22:16:40,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 22:16:40,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 22:16:40,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-29 22:16:40,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 22:16:40,876 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-29 22:16:40,876 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 2 case distinctions, treesize of input 27 treesize of output 27 [2023-08-29 22:16:41,106 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2023-08-29 22:16:41,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 30 [2023-08-29 22:16:41,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:16:41,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 22:16:41,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 22:16:41,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437074004] [2023-08-29 22:16:41,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437074004] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:16:41,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:16:41,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 22:16:41,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125681524] [2023-08-29 22:16:41,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:16:41,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 22:16:41,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 22:16:41,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 22:16:41,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 22:16:45,436 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 [0] [2023-08-29 22:16:45,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 543 [2023-08-29 22:16:45,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 109 flow. Second operand has 6 states, 6 states have (on average 261.3333333333333) internal successors, (1568), 6 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:45,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:16:45,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 543 [2023-08-29 22:16:45,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:16:48,846 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 [0] [2023-08-29 22:16:50,249 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 [0] [2023-08-29 22:16:50,389 INFO L130 PetriNetUnfolder]: 50/161 cut-off events. [2023-08-29 22:16:50,389 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2023-08-29 22:16:50,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 161 events. 50/161 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 487 event pairs, 2 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 357. Up to 110 conditions per place. [2023-08-29 22:16:50,390 INFO L137 encePairwiseOnDemand]: 539/543 looper letters, 30 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2023-08-29 22:16:50,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 45 transitions, 185 flow [2023-08-29 22:16:50,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 22:16:50,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 22:16:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1334 transitions. [2023-08-29 22:16:50,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4913443830570902 [2023-08-29 22:16:50,401 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1334 transitions. [2023-08-29 22:16:50,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1334 transitions. [2023-08-29 22:16:50,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:16:50,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1334 transitions. [2023-08-29 22:16:50,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 266.8) internal successors, (1334), 5 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:50,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 543.0) internal successors, (3258), 6 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:50,420 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 543.0) internal successors, (3258), 6 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:50,421 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 109 flow. Second operand 5 states and 1334 transitions. [2023-08-29 22:16:50,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 45 transitions, 185 flow [2023-08-29 22:16:50,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 45 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 22:16:50,422 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 111 flow [2023-08-29 22:16:50,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-08-29 22:16:50,423 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -71 predicate places. [2023-08-29 22:16:50,423 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 111 flow [2023-08-29 22:16:50,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 261.3333333333333) internal successors, (1568), 6 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:50,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:16:50,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:16:50,438 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 (11)] Forceful destruction successful, exit code 0 [2023-08-29 22:16:50,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-29 22:16:50,636 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:16:50,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:16:50,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1458727440, now seen corresponding path program 1 times [2023-08-29 22:16:50,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 22:16:50,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802512353] [2023-08-29 22:16:50,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:16:50,637 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-29 22:16:50,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 22:16:50,638 INFO L229 MonitoredProcess]: Starting monitored process 12 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-29 22:16:50,638 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 (12)] Waiting until timeout for monitored process [2023-08-29 22:16:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:16:50,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-29 22:16:50,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:16:50,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 22:16:50,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 22:16:50,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 22:16:50,871 INFO L321 Elim1Store]: treesize reduction 84, result has 28.8 percent of original size [2023-08-29 22:16:50,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 66 [2023-08-29 22:16:50,957 INFO L321 Elim1Store]: treesize reduction 36, result has 48.6 percent of original size [2023-08-29 22:16:50,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 56 [2023-08-29 22:16:51,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:16:51,058 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 22:16:51,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 22:16:51,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802512353] [2023-08-29 22:16:51,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802512353] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:16:51,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:16:51,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 22:16:51,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916891499] [2023-08-29 22:16:51,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:16:51,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 22:16:51,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 22:16:51,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 22:16:51,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 22:16:51,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 543 [2023-08-29 22:16:51,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 266.6) internal successors, (1333), 5 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:51,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:16:51,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 543 [2023-08-29 22:16:51,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:16:52,184 INFO L130 PetriNetUnfolder]: 46/154 cut-off events. [2023-08-29 22:16:52,184 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2023-08-29 22:16:52,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 154 events. 46/154 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 460 event pairs, 3 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 342. Up to 100 conditions per place. [2023-08-29 22:16:52,185 INFO L137 encePairwiseOnDemand]: 540/543 looper letters, 29 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-08-29 22:16:52,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 43 transitions, 178 flow [2023-08-29 22:16:52,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 22:16:52,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 22:16:52,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1090 transitions. [2023-08-29 22:16:52,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.501841620626151 [2023-08-29 22:16:52,188 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1090 transitions. [2023-08-29 22:16:52,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1090 transitions. [2023-08-29 22:16:52,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:16:52,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1090 transitions. [2023-08-29 22:16:52,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 272.5) internal successors, (1090), 4 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:52,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 543.0) internal successors, (2715), 5 states have internal predecessors, (2715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:52,194 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 543.0) internal successors, (2715), 5 states have internal predecessors, (2715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:52,194 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 111 flow. Second operand 4 states and 1090 transitions. [2023-08-29 22:16:52,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 43 transitions, 178 flow [2023-08-29 22:16:52,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 171 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 22:16:52,196 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 106 flow [2023-08-29 22:16:52,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2023-08-29 22:16:52,196 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -72 predicate places. [2023-08-29 22:16:52,196 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 106 flow [2023-08-29 22:16:52,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 266.6) internal successors, (1333), 5 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:52,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:16:52,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:16:52,208 INFO L552 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 (12)] Ended with exit code 0 [2023-08-29 22:16:52,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-29 22:16:52,408 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:16:52,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:16:52,408 INFO L85 PathProgramCache]: Analyzing trace with hash -2024088837, now seen corresponding path program 1 times [2023-08-29 22:16:52,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 22:16:52,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317673843] [2023-08-29 22:16:52,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:16:52,409 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-29 22:16:52,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 22:16:52,410 INFO L229 MonitoredProcess]: Starting monitored process 13 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-29 22:16:52,410 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 (13)] Waiting until timeout for monitored process [2023-08-29 22:16:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:16:52,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-29 22:16:52,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:16:52,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-29 22:16:52,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:16:52,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 22:16:52,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 22:16:52,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317673843] [2023-08-29 22:16:52,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317673843] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:16:52,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:16:52,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 22:16:52,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81457512] [2023-08-29 22:16:52,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:16:52,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 22:16:52,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 22:16:52,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 22:16:52,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 22:16:53,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 543 [2023-08-29 22:16:53,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 106 flow. Second operand has 6 states, 6 states have (on average 261.5) internal successors, (1569), 6 states have internal predecessors, (1569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:53,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:16:53,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 543 [2023-08-29 22:16:53,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:16:54,546 INFO L130 PetriNetUnfolder]: 40/130 cut-off events. [2023-08-29 22:16:54,546 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-29 22:16:54,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 130 events. 40/130 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs, 0 based on Foata normal form. 6/115 useless extension candidates. Maximal degree in co-relation 297. Up to 80 conditions per place. [2023-08-29 22:16:54,547 INFO L137 encePairwiseOnDemand]: 534/543 looper letters, 27 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2023-08-29 22:16:54,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 40 transitions, 172 flow [2023-08-29 22:16:54,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 22:16:54,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 22:16:54,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1336 transitions. [2023-08-29 22:16:54,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49208103130755065 [2023-08-29 22:16:54,550 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1336 transitions. [2023-08-29 22:16:54,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1336 transitions. [2023-08-29 22:16:54,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:16:54,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1336 transitions. [2023-08-29 22:16:54,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 267.2) internal successors, (1336), 5 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:54,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 543.0) internal successors, (3258), 6 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:54,556 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 543.0) internal successors, (3258), 6 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:54,557 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 106 flow. Second operand 5 states and 1336 transitions. [2023-08-29 22:16:54,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 40 transitions, 172 flow [2023-08-29 22:16:54,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 40 transitions, 169 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 22:16:54,558 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 99 flow [2023-08-29 22:16:54,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2023-08-29 22:16:54,558 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -76 predicate places. [2023-08-29 22:16:54,559 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 99 flow [2023-08-29 22:16:54,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 261.5) internal successors, (1569), 6 states have internal predecessors, (1569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:54,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:16:54,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:16:54,573 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 (13)] Forceful destruction successful, exit code 0 [2023-08-29 22:16:54,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-29 22:16:54,769 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:16:54,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:16:54,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2024088838, now seen corresponding path program 1 times [2023-08-29 22:16:54,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 22:16:54,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286980414] [2023-08-29 22:16:54,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:16:54,770 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-29 22:16:54,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 22:16:54,771 INFO L229 MonitoredProcess]: Starting monitored process 14 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-29 22:16:54,771 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 (14)] Waiting until timeout for monitored process [2023-08-29 22:16:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:16:54,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 22:16:54,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:16:54,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-29 22:16:54,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 22:16:54,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 22:16:54,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286980414] [2023-08-29 22:16:54,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286980414] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:16:54,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:16:54,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 22:16:54,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817458330] [2023-08-29 22:16:54,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:16:54,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 22:16:54,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 22:16:54,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 22:16:54,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 22:16:56,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 543 [2023-08-29 22:16:56,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 99 flow. Second operand has 6 states, 6 states have (on average 255.5) internal successors, (1533), 6 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:56,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:16:56,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 543 [2023-08-29 22:16:56,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:16:56,946 INFO L130 PetriNetUnfolder]: 38/110 cut-off events. [2023-08-29 22:16:56,946 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2023-08-29 22:16:56,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 110 events. 38/110 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 237 event pairs, 0 based on Foata normal form. 3/104 useless extension candidates. Maximal degree in co-relation 278. Up to 75 conditions per place. [2023-08-29 22:16:56,946 INFO L137 encePairwiseOnDemand]: 534/543 looper letters, 20 selfloop transitions, 4 changer transitions 8/34 dead transitions. [2023-08-29 22:16:56,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 34 transitions, 163 flow [2023-08-29 22:16:56,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 22:16:56,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 22:16:56,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1305 transitions. [2023-08-29 22:16:56,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48066298342541436 [2023-08-29 22:16:56,949 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1305 transitions. [2023-08-29 22:16:56,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1305 transitions. [2023-08-29 22:16:56,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:16:56,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1305 transitions. [2023-08-29 22:16:56,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:56,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 543.0) internal successors, (3258), 6 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:56,955 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 543.0) internal successors, (3258), 6 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:56,956 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 99 flow. Second operand 5 states and 1305 transitions. [2023-08-29 22:16:56,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 34 transitions, 163 flow [2023-08-29 22:16:56,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 156 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 22:16:56,957 INFO L231 Difference]: Finished difference. Result has 45 places, 21 transitions, 72 flow [2023-08-29 22:16:56,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=45, PETRI_TRANSITIONS=21} [2023-08-29 22:16:56,957 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -81 predicate places. [2023-08-29 22:16:56,957 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 21 transitions, 72 flow [2023-08-29 22:16:56,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 255.5) internal successors, (1533), 6 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:56,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:16:56,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:16:56,971 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 (14)] Forceful destruction successful, exit code 0 [2023-08-29 22:16:57,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-29 22:16:57,168 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:16:57,168 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:16:57,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1677756336, now seen corresponding path program 1 times [2023-08-29 22:16:57,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 22:16:57,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899476270] [2023-08-29 22:16:57,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:16:57,169 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-29 22:16:57,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 22:16:57,171 INFO L229 MonitoredProcess]: Starting monitored process 15 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-29 22:16:57,171 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 (15)] Waiting until timeout for monitored process [2023-08-29 22:16:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:16:57,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 22:16:57,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:16:57,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:16:57,323 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 22:16:57,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 22:16:57,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899476270] [2023-08-29 22:16:57,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1899476270] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:16:57,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:16:57,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 22:16:57,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666487293] [2023-08-29 22:16:57,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:16:57,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 22:16:57,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 22:16:57,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 22:16:57,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 22:16:57,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 543 [2023-08-29 22:16:57,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 21 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 267.8) internal successors, (1339), 5 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:57,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:16:57,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 543 [2023-08-29 22:16:57,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:16:58,534 INFO L130 PetriNetUnfolder]: 22/67 cut-off events. [2023-08-29 22:16:58,534 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-29 22:16:58,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 67 events. 22/67 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 115 event pairs, 3 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 182. Up to 35 conditions per place. [2023-08-29 22:16:58,534 INFO L137 encePairwiseOnDemand]: 539/543 looper letters, 18 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2023-08-29 22:16:58,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 24 transitions, 126 flow [2023-08-29 22:16:58,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 22:16:58,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 22:16:58,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1350 transitions. [2023-08-29 22:16:58,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4972375690607735 [2023-08-29 22:16:58,538 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1350 transitions. [2023-08-29 22:16:58,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1350 transitions. [2023-08-29 22:16:58,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:16:58,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1350 transitions. [2023-08-29 22:16:58,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 270.0) internal successors, (1350), 5 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:58,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 543.0) internal successors, (3258), 6 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:58,544 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 543.0) internal successors, (3258), 6 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:58,544 INFO L175 Difference]: Start difference. First operand has 45 places, 21 transitions, 72 flow. Second operand 5 states and 1350 transitions. [2023-08-29 22:16:58,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 24 transitions, 126 flow [2023-08-29 22:16:58,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 24 transitions, 119 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 22:16:58,545 INFO L231 Difference]: Finished difference. Result has 37 places, 20 transitions, 69 flow [2023-08-29 22:16:58,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=69, PETRI_PLACES=37, PETRI_TRANSITIONS=20} [2023-08-29 22:16:58,545 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -89 predicate places. [2023-08-29 22:16:58,545 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 20 transitions, 69 flow [2023-08-29 22:16:58,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 267.8) internal successors, (1339), 5 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:58,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:16:58,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:16:58,557 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 (15)] Forceful destruction successful, exit code 0 [2023-08-29 22:16:58,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-29 22:16:58,756 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:16:58,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:16:58,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1677756335, now seen corresponding path program 1 times [2023-08-29 22:16:58,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 22:16:58,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126050301] [2023-08-29 22:16:58,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:16:58,757 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-29 22:16:58,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 22:16:58,758 INFO L229 MonitoredProcess]: Starting monitored process 16 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-29 22:16:58,760 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 (16)] Waiting until timeout for monitored process [2023-08-29 22:16:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:16:58,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-29 22:16:58,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:16:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 22:16:58,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 22:16:58,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 22:16:58,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126050301] [2023-08-29 22:16:58,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [126050301] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 22:16:58,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 22:16:58,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 22:16:58,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480380185] [2023-08-29 22:16:58,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 22:16:58,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 22:16:58,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 22:16:58,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 22:16:58,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 22:16:59,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 543 [2023-08-29 22:16:59,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 20 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 268.0) internal successors, (804), 3 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:59,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:16:59,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 543 [2023-08-29 22:16:59,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:16:59,559 INFO L130 PetriNetUnfolder]: 20/62 cut-off events. [2023-08-29 22:16:59,559 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-08-29 22:16:59,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 62 events. 20/62 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 4 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 171. Up to 30 conditions per place. [2023-08-29 22:16:59,559 INFO L137 encePairwiseOnDemand]: 541/543 looper letters, 17 selfloop transitions, 1 changer transitions 0/21 dead transitions. [2023-08-29 22:16:59,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 21 transitions, 110 flow [2023-08-29 22:16:59,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 22:16:59,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 22:16:59,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 812 transitions. [2023-08-29 22:16:59,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49846531614487416 [2023-08-29 22:16:59,561 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 812 transitions. [2023-08-29 22:16:59,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 812 transitions. [2023-08-29 22:16:59,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:16:59,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 812 transitions. [2023-08-29 22:16:59,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:59,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 543.0) internal successors, (2172), 4 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:59,566 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 543.0) internal successors, (2172), 4 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:59,566 INFO L175 Difference]: Start difference. First operand has 37 places, 20 transitions, 69 flow. Second operand 3 states and 812 transitions. [2023-08-29 22:16:59,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 21 transitions, 110 flow [2023-08-29 22:16:59,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 21 transitions, 105 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 22:16:59,567 INFO L231 Difference]: Finished difference. Result has 35 places, 19 transitions, 64 flow [2023-08-29 22:16:59,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=35, PETRI_TRANSITIONS=19} [2023-08-29 22:16:59,567 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -91 predicate places. [2023-08-29 22:16:59,567 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 19 transitions, 64 flow [2023-08-29 22:16:59,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 268.0) internal successors, (804), 3 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 22:16:59,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:16:59,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:16:59,583 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 (16)] Forceful destruction successful, exit code 0 [2023-08-29 22:16:59,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-29 22:16:59,778 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-08-29 22:16:59,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:16:59,779 INFO L85 PathProgramCache]: Analyzing trace with hash -834188393, now seen corresponding path program 1 times [2023-08-29 22:16:59,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 22:16:59,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835183873] [2023-08-29 22:16:59,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:16:59,779 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-29 22:16:59,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 22:16:59,780 INFO L229 MonitoredProcess]: Starting monitored process 17 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-29 22:16:59,784 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 (17)] Waiting until timeout for monitored process [2023-08-29 22:16:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 22:16:59,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 22:17:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 22:17:00,184 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 22:17:00,185 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 22:17:00,185 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr20ASSERT_VIOLATIONMEMORY_LEAK (81 of 82 remaining) [2023-08-29 22:17:00,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 82 remaining) [2023-08-29 22:17:00,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (79 of 82 remaining) [2023-08-29 22:17:00,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 82 remaining) [2023-08-29 22:17:00,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 82 remaining) [2023-08-29 22:17:00,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 82 remaining) [2023-08-29 22:17:00,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 82 remaining) [2023-08-29 22:17:00,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 82 remaining) [2023-08-29 22:17:00,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 82 remaining) [2023-08-29 22:17:00,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 82 remaining) [2023-08-29 22:17:00,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 82 remaining) [2023-08-29 22:17:00,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 82 remaining) [2023-08-29 22:17:00,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 82 remaining) [2023-08-29 22:17:00,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 82 remaining) [2023-08-29 22:17:00,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr20ASSERT_VIOLATIONMEMORY_LEAK (67 of 82 remaining) [2023-08-29 22:17:00,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 82 remaining) [2023-08-29 22:17:00,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 82 remaining) [2023-08-29 22:17:00,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 82 remaining) [2023-08-29 22:17:00,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 82 remaining) [2023-08-29 22:17:00,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 82 remaining) [2023-08-29 22:17:00,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 82 remaining) [2023-08-29 22:17:00,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 82 remaining) [2023-08-29 22:17:00,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 82 remaining) [2023-08-29 22:17:00,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 82 remaining) [2023-08-29 22:17:00,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 82 remaining) [2023-08-29 22:17:00,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 82 remaining) [2023-08-29 22:17:00,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 82 remaining) [2023-08-29 22:17:00,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 82 remaining) [2023-08-29 22:17:00,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 82 remaining) [2023-08-29 22:17:00,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 82 remaining) [2023-08-29 22:17:00,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 82 remaining) [2023-08-29 22:17:00,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 82 remaining) [2023-08-29 22:17:00,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 82 remaining) [2023-08-29 22:17:00,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 82 remaining) [2023-08-29 22:17:00,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 82 remaining) [2023-08-29 22:17:00,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 82 remaining) [2023-08-29 22:17:00,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 82 remaining) [2023-08-29 22:17:00,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 82 remaining) [2023-08-29 22:17:00,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 82 remaining) [2023-08-29 22:17:00,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 82 remaining) [2023-08-29 22:17:00,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 82 remaining) [2023-08-29 22:17:00,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 82 remaining) [2023-08-29 22:17:00,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 82 remaining) [2023-08-29 22:17:00,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 82 remaining) [2023-08-29 22:17:00,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 82 remaining) [2023-08-29 22:17:00,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 82 remaining) [2023-08-29 22:17:00,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 82 remaining) [2023-08-29 22:17:00,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 82 remaining) [2023-08-29 22:17:00,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 82 remaining) [2023-08-29 22:17:00,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 82 remaining) [2023-08-29 22:17:00,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 82 remaining) [2023-08-29 22:17:00,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 82 remaining) [2023-08-29 22:17:00,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 82 remaining) [2023-08-29 22:17:00,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 82 remaining) [2023-08-29 22:17:00,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 82 remaining) [2023-08-29 22:17:00,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 82 remaining) [2023-08-29 22:17:00,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 82 remaining) [2023-08-29 22:17:00,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 82 remaining) [2023-08-29 22:17:00,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 82 remaining) [2023-08-29 22:17:00,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 82 remaining) [2023-08-29 22:17:00,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 82 remaining) [2023-08-29 22:17:00,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 82 remaining) [2023-08-29 22:17:00,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 82 remaining) [2023-08-29 22:17:00,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 82 remaining) [2023-08-29 22:17:00,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 82 remaining) [2023-08-29 22:17:00,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 82 remaining) [2023-08-29 22:17:00,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 82 remaining) [2023-08-29 22:17:00,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 82 remaining) [2023-08-29 22:17:00,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 82 remaining) [2023-08-29 22:17:00,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK (12 of 82 remaining) [2023-08-29 22:17:00,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 82 remaining) [2023-08-29 22:17:00,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 82 remaining) [2023-08-29 22:17:00,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 82 remaining) [2023-08-29 22:17:00,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 82 remaining) [2023-08-29 22:17:00,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 82 remaining) [2023-08-29 22:17:00,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 82 remaining) [2023-08-29 22:17:00,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 82 remaining) [2023-08-29 22:17:00,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 82 remaining) [2023-08-29 22:17:00,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 82 remaining) [2023-08-29 22:17:00,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 82 remaining) [2023-08-29 22:17:00,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 82 remaining) [2023-08-29 22:17:00,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 82 remaining) [2023-08-29 22:17:00,215 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 (17)] Forceful destruction successful, exit code 0 [2023-08-29 22:17:00,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-29 22:17:00,416 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:17:00,418 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-29 22:17:00,421 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 22:17:00,422 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 22:17:00,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 10:17:00 BasicIcfg [2023-08-29 22:17:00,467 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 22:17:00,467 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 22:17:00,467 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 22:17:00,468 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 22:17:00,468 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:14:11" (3/4) ... [2023-08-29 22:17:00,470 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 22:17:00,470 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 22:17:00,471 INFO L158 Benchmark]: Toolchain (without parser) took 170419.53ms. Allocated memory was 83.9MB in the beginning and 385.9MB in the end (delta: 302.0MB). Free memory was 59.6MB in the beginning and 107.7MB in the end (delta: -48.1MB). Peak memory consumption was 256.0MB. Max. memory is 16.1GB. [2023-08-29 22:17:00,471 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 60.8MB. Free memory is still 38.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 22:17:00,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 691.38ms. Allocated memory is still 83.9MB. Free memory was 59.3MB in the beginning and 37.2MB in the end (delta: 22.1MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2023-08-29 22:17:00,472 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.07ms. Allocated memory is still 83.9MB. Free memory was 37.2MB in the beginning and 33.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 22:17:00,472 INFO L158 Benchmark]: Boogie Preprocessor took 46.21ms. Allocated memory is still 83.9MB. Free memory was 33.9MB in the beginning and 60.2MB in the end (delta: -26.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-08-29 22:17:00,473 INFO L158 Benchmark]: RCFGBuilder took 905.08ms. Allocated memory is still 83.9MB. Free memory was 60.2MB in the beginning and 48.7MB in the end (delta: 11.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-08-29 22:17:00,473 INFO L158 Benchmark]: TraceAbstraction took 168717.57ms. Allocated memory was 83.9MB in the beginning and 385.9MB in the end (delta: 302.0MB). Free memory was 48.2MB in the beginning and 107.7MB in the end (delta: -59.5MB). Peak memory consumption was 242.4MB. Max. memory is 16.1GB. [2023-08-29 22:17:00,473 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 385.9MB. Free memory is still 107.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 22:17:00,478 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.15ms. Allocated memory is still 60.8MB. Free memory is still 38.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 691.38ms. Allocated memory is still 83.9MB. Free memory was 59.3MB in the beginning and 37.2MB in the end (delta: 22.1MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.07ms. Allocated memory is still 83.9MB. Free memory was 37.2MB in the beginning and 33.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.21ms. Allocated memory is still 83.9MB. Free memory was 33.9MB in the beginning and 60.2MB in the end (delta: -26.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 905.08ms. Allocated memory is still 83.9MB. Free memory was 60.2MB in the beginning and 48.7MB in the end (delta: 11.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 168717.57ms. Allocated memory was 83.9MB in the beginning and 385.9MB in the end (delta: 302.0MB). Free memory was 48.2MB in the beginning and 107.7MB in the end (delta: -59.5MB). Peak memory consumption was 242.4MB. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 385.9MB. Free memory is still 107.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 132.2s, 275 PlacesBefore, 126 PlacesAfterwards, 301 TransitionsBefore, 148 TransitionsAfterwards, 27354 CoEnabledTransitionPairs, 7 FixpointIterations, 79 TrivialSequentialCompositions, 143 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 242 TotalNumberOfCompositions, 103181 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 34431, independent: 33226, independent conditional: 0, independent unconditional: 33226, dependent: 1205, dependent conditional: 0, dependent unconditional: 1205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 13035, independent: 12816, independent conditional: 0, independent unconditional: 12816, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 34431, independent: 20410, independent conditional: 0, independent unconditional: 20410, dependent: 986, dependent conditional: 0, dependent unconditional: 986, unknown: 13035, unknown conditional: 0, unknown unconditional: 13035] , Statistics on independence cache: Total cache size (in pairs): 2417, Positive cache size: 2309, Positive conditional cache size: 0, Positive unconditional cache size: 2309, Negative cache size: 108, Negative conditional cache size: 0, Negative unconditional cache size: 108, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 1235]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1235. Possible FailurePath: [L1240] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1241-L1244] 0 struct s { int datum; struct s *next; } *A; [L1253] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1254] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1267] 0 struct s *p; [L1268] 0 A = malloc(sizeof(struct s)) [L1269] EXPR 0 \read(*A) [L1269] CALL 0 init(A,3) [L1246] 0 p -> datum = x [L1247] 0 p -> next = ((void *)0) [L1269] RET 0 init(A,3) [L1270] 0 pthread_t t_ids[10000]; [L1270] 0 int i=0; VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, __global_lock={3:0}, i=0, t_ids={37:0}] [L1270] COND TRUE 0 i<10000 [L1270] FCALL, FORK 0 pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0)) VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, __global_lock={3:0}, i=0, pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0))=-1, t_ids={37:0}] [L1256] 1 struct s *p = malloc(sizeof(struct s)); [L1257] CALL 1 init(p,7) [L1246] 1 p -> datum = x VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, \old(x)=3, \old(x)=7, __global_lock={3:0}, p={15:0}, p={15:0}, p={7:0}, p={7:0}, x=3, x=7] [L1247] 1 p -> next = ((void *)0) [L1257] RET 1 init(p,7) [L1259] CALL 1 insert(p, &A) [L1250] EXPR 1 \read(**list) VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, \read(**list)={15:0}, __global_lock={3:0}, list={4:0}, list={4:0}, p={7:0}, p={7:0}] [L1250] 1 p->next = *list VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, \read(**list)={15:0}, __global_lock={3:0}, list={4:0}, list={4:0}, p={7:0}, p={7:0}] [L1251] 1 *list = p VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, __global_lock={3:0}, list={4:0}, list={4:0}, p={7:0}, p={7:0}] [L1259] RET 1 insert(p, &A) [L1262] COND FALSE 1 !(__VERIFIER_nondet_int()) [L1262] EXPR 1 p->datum [L1262] CALL 1 __VERIFIER_assert((p->datum) == 0) [L1235] COND TRUE 1 !(cond) [L1235] 1 reach_error() VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, \old(cond)=0, __global_lock={3:0}, cond=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1266]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 359 locations, 83 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 168.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 28.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 132.4s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 4904 SdHoareTripleChecker+Valid, 25.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3005 mSDsluCounter, 430 SdHoareTripleChecker+Invalid, 24.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 342 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6205 IncrementalHoareTripleChecker+Invalid, 6365 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 88 mSDtfsCounter, 6205 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=0, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 88 ConstructedInterpolants, 7 QuantifiedInterpolants, 911 SizeOfPredicates, 37 NumberOfNonLiveVariables, 2048 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 0/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 22:17:00,511 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 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample