./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.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 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 04:25:43,652 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 04:25:43,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 04:25:43,699 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 04:25:43,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 04:25:43,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 04:25:43,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 04:25:43,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 04:25:43,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 04:25:43,716 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 04:25:43,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 04:25:43,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 04:25:43,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 04:25:43,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 04:25:43,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 04:25:43,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 04:25:43,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 04:25:43,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 04:25:43,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 04:25:43,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 04:25:43,748 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 04:25:43,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 04:25:43,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 04:25:43,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 04:25:43,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 04:25:43,759 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 04:25:43,759 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 04:25:43,761 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 04:25:43,761 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 04:25:43,762 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 04:25:43,762 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 04:25:43,769 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 04:25:43,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 04:25:43,772 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 04:25:43,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 04:25:43,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 04:25:43,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 04:25:43,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 04:25:43,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 04:25:43,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 04:25:43,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 04:25:43,777 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-09-01 04:25:43,811 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 04:25:43,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 04:25:43,812 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 04:25:43,813 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 04:25:43,813 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 04:25:43,814 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 04:25:43,814 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 04:25:43,815 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 04:25:43,815 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 04:25:43,815 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 04:25:43,816 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 04:25:43,816 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-01 04:25:43,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 04:25:43,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 04:25:43,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 04:25:43,817 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-09-01 04:25:43,817 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-09-01 04:25:43,818 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-09-01 04:25:43,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 04:25:43,818 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-09-01 04:25:43,819 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 04:25:43,819 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 04:25:43,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 04:25:43,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 04:25:43,820 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 04:25:43,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 04:25:43,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 04:25:43,820 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 04:25:43,821 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 04:25:43,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 04:25:43,821 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 04:25:43,821 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 04:25:43,822 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 04:25:43,822 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 04:25:43,822 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 -> 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 04:25:44,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 04:25:44,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 04:25:44,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 04:25:44,180 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 04:25:44,181 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 04:25:44,183 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2023-09-01 04:25:45,338 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 04:25:45,615 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 04:25:45,618 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2023-09-01 04:25:45,639 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa6f343f7/bd9566eb748647338b7761cd5e0365aa/FLAG935aa8438 [2023-09-01 04:25:45,662 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa6f343f7/bd9566eb748647338b7761cd5e0365aa [2023-09-01 04:25:45,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 04:25:45,666 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 04:25:45,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 04:25:45,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 04:25:45,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 04:25:45,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 04:25:45" (1/1) ... [2023-09-01 04:25:45,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ba2d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:25:45, skipping insertion in model container [2023-09-01 04:25:45,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 04:25:45" (1/1) ... [2023-09-01 04:25:45,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 04:25:45,726 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 04:25:46,125 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2023-09-01 04:25:46,130 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 04:25:46,153 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 04:25:46,209 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2023-09-01 04:25:46,212 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 04:25:46,279 INFO L208 MainTranslator]: Completed translation [2023-09-01 04:25:46,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:25:46 WrapperNode [2023-09-01 04:25:46,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 04:25:46,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 04:25:46,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 04:25:46,282 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 04:25:46,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:25:46" (1/1) ... [2023-09-01 04:25:46,326 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:25:46" (1/1) ... [2023-09-01 04:25:46,355 INFO L138 Inliner]: procedures = 243, calls = 50, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2023-09-01 04:25:46,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 04:25:46,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 04:25:46,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 04:25:46,356 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 04:25:46,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:25:46" (1/1) ... [2023-09-01 04:25:46,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:25:46" (1/1) ... [2023-09-01 04:25:46,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:25:46" (1/1) ... [2023-09-01 04:25:46,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:25:46" (1/1) ... [2023-09-01 04:25:46,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:25:46" (1/1) ... [2023-09-01 04:25:46,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:25:46" (1/1) ... [2023-09-01 04:25:46,403 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:25:46" (1/1) ... [2023-09-01 04:25:46,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:25:46" (1/1) ... [2023-09-01 04:25:46,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 04:25:46,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 04:25:46,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 04:25:46,415 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 04:25:46,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:25:46" (1/1) ... [2023-09-01 04:25:46,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 04:25:46,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:25:46,458 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-09-01 04:25:46,485 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-09-01 04:25:46,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 04:25:46,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 04:25:46,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-09-01 04:25:46,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 04:25:46,498 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-01 04:25:46,498 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-01 04:25:46,499 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-01 04:25:46,499 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-01 04:25:46,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 04:25:46,499 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-01 04:25:46,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 04:25:46,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 04:25:46,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 04:25:46,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 04:25:46,501 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 04:25:46,650 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 04:25:46,666 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 04:25:46,997 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 04:25:47,004 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 04:25:47,015 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-09-01 04:25:47,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 04:25:47 BoogieIcfgContainer [2023-09-01 04:25:47,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 04:25:47,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 04:25:47,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 04:25:47,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 04:25:47,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 04:25:45" (1/3) ... [2023-09-01 04:25:47,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f560f17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 04:25:47, skipping insertion in model container [2023-09-01 04:25:47,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:25:46" (2/3) ... [2023-09-01 04:25:47,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f560f17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 04:25:47, skipping insertion in model container [2023-09-01 04:25:47,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 04:25:47" (3/3) ... [2023-09-01 04:25:47,026 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2023-09-01 04:25:47,042 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 04:25:47,042 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-09-01 04:25:47,042 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 04:25:47,144 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-01 04:25:47,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 143 transitions, 302 flow [2023-09-01 04:25:47,285 INFO L130 PetriNetUnfolder]: 10/141 cut-off events. [2023-09-01 04:25:47,285 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 04:25:47,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 141 events. 10/141 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 180 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 3 conditions per place. [2023-09-01 04:25:47,290 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 143 transitions, 302 flow [2023-09-01 04:25:47,295 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 137 transitions, 286 flow [2023-09-01 04:25:47,298 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 04:25:47,308 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 137 transitions, 286 flow [2023-09-01 04:25:47,310 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 137 transitions, 286 flow [2023-09-01 04:25:47,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 137 transitions, 286 flow [2023-09-01 04:25:47,336 INFO L130 PetriNetUnfolder]: 10/137 cut-off events. [2023-09-01 04:25:47,336 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 04:25:47,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 137 events. 10/137 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 179 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 87. Up to 3 conditions per place. [2023-09-01 04:25:47,339 INFO L119 LiptonReduction]: Number of co-enabled transitions 2314 [2023-09-01 04:25:53,925 INFO L134 LiptonReduction]: Checked pairs total: 5425 [2023-09-01 04:25:53,926 INFO L136 LiptonReduction]: Total number of compositions: 130 [2023-09-01 04:25:53,944 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 04:25:53,970 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;@62d7a648, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 04:25:53,971 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-09-01 04:25:53,976 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-09-01 04:25:53,977 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 04:25:53,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:25:53,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-09-01 04:25:53,979 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:25:53,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:25:53,985 INFO L85 PathProgramCache]: Analyzing trace with hash 544, now seen corresponding path program 1 times [2023-09-01 04:25:54,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:25:54,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036032655] [2023-09-01 04:25:54,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:25:54,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:25:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:25:54,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:25:54,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:25:54,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036032655] [2023-09-01 04:25:54,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036032655] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:25:54,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:25:54,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-09-01 04:25:54,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807116405] [2023-09-01 04:25:54,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:25:54,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-01 04:25:54,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:25:54,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-01 04:25:54,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-01 04:25:54,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 273 [2023-09-01 04:25:54,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:54,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:25:54,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 273 [2023-09-01 04:25:54,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:25:54,352 INFO L130 PetriNetUnfolder]: 264/513 cut-off events. [2023-09-01 04:25:54,353 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-09-01 04:25:54,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 513 events. 264/513 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2440 event pairs, 168 based on Foata normal form. 24/383 useless extension candidates. Maximal degree in co-relation 833. Up to 409 conditions per place. [2023-09-01 04:25:54,361 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 28 selfloop transitions, 0 changer transitions 0/37 dead transitions. [2023-09-01 04:25:54,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 142 flow [2023-09-01 04:25:54,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-01 04:25:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-09-01 04:25:54,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 297 transitions. [2023-09-01 04:25:54,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5439560439560439 [2023-09-01 04:25:54,383 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 297 transitions. [2023-09-01 04:25:54,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 297 transitions. [2023-09-01 04:25:54,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:25:54,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 297 transitions. [2023-09-01 04:25:54,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 148.5) internal successors, (297), 2 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:54,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:54,401 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:54,402 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 92 flow. Second operand 2 states and 297 transitions. [2023-09-01 04:25:54,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 142 flow [2023-09-01 04:25:54,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 134 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 04:25:54,411 INFO L231 Difference]: Finished difference. Result has 37 places, 37 transitions, 78 flow [2023-09-01 04:25:54,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=37, PETRI_TRANSITIONS=37} [2023-09-01 04:25:54,416 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -5 predicate places. [2023-09-01 04:25:54,417 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 37 transitions, 78 flow [2023-09-01 04:25:54,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:54,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:25:54,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 04:25:54,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 04:25:54,418 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:25:54,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:25:54,427 INFO L85 PathProgramCache]: Analyzing trace with hash 533161, now seen corresponding path program 1 times [2023-09-01 04:25:54,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:25:54,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179703313] [2023-09-01 04:25:54,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:25:54,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:25:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:25:54,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:25:54,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:25:54,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179703313] [2023-09-01 04:25:54,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179703313] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:25:54,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:25:54,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 04:25:54,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739071333] [2023-09-01 04:25:54,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:25:54,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:25:54,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:25:54,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:25:54,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:25:54,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 273 [2023-09-01 04:25:54,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:54,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:25:54,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 273 [2023-09-01 04:25:54,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:25:54,755 INFO L130 PetriNetUnfolder]: 252/486 cut-off events. [2023-09-01 04:25:54,755 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 04:25:54,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 486 events. 252/486 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2277 event pairs, 160 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 878. Up to 385 conditions per place. [2023-09-01 04:25:54,758 INFO L137 encePairwiseOnDemand]: 269/273 looper letters, 24 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-09-01 04:25:54,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 35 transitions, 126 flow [2023-09-01 04:25:54,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:25:54,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:25:54,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-09-01 04:25:54,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4884004884004884 [2023-09-01 04:25:54,761 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-09-01 04:25:54,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-09-01 04:25:54,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:25:54,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-09-01 04:25:54,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:54,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:54,768 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:54,768 INFO L175 Difference]: Start difference. First operand has 37 places, 37 transitions, 78 flow. Second operand 3 states and 400 transitions. [2023-09-01 04:25:54,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 35 transitions, 126 flow [2023-09-01 04:25:54,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 35 transitions, 126 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 04:25:54,770 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 78 flow [2023-09-01 04:25:54,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2023-09-01 04:25:54,771 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -5 predicate places. [2023-09-01 04:25:54,771 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 78 flow [2023-09-01 04:25:54,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:54,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:25:54,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 04:25:54,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 04:25:54,773 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:25:54,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:25:54,775 INFO L85 PathProgramCache]: Analyzing trace with hash 533162, now seen corresponding path program 1 times [2023-09-01 04:25:54,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:25:54,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837402246] [2023-09-01 04:25:54,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:25:54,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:25:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:25:54,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:25:54,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:25:54,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837402246] [2023-09-01 04:25:54,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837402246] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:25:54,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:25:54,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 04:25:54,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460978534] [2023-09-01 04:25:54,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:25:54,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:25:54,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:25:54,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:25:54,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:25:54,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 273 [2023-09-01 04:25:54,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:54,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:25:54,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 273 [2023-09-01 04:25:54,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:25:55,054 INFO L130 PetriNetUnfolder]: 240/459 cut-off events. [2023-09-01 04:25:55,055 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 04:25:55,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 459 events. 240/459 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2102 event pairs, 152 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 831. Up to 363 conditions per place. [2023-09-01 04:25:55,059 INFO L137 encePairwiseOnDemand]: 269/273 looper letters, 22 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2023-09-01 04:25:55,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 122 flow [2023-09-01 04:25:55,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:25:55,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:25:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-09-01 04:25:55,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5006105006105006 [2023-09-01 04:25:55,062 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-09-01 04:25:55,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-09-01 04:25:55,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:25:55,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-09-01 04:25:55,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:55,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:55,066 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:55,066 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 78 flow. Second operand 3 states and 410 transitions. [2023-09-01 04:25:55,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 122 flow [2023-09-01 04:25:55,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 04:25:55,067 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 74 flow [2023-09-01 04:25:55,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2023-09-01 04:25:55,069 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-09-01 04:25:55,069 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 74 flow [2023-09-01 04:25:55,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:55,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:25:55,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 04:25:55,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 04:25:55,070 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:25:55,071 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:25:55,071 INFO L85 PathProgramCache]: Analyzing trace with hash 512378966, now seen corresponding path program 1 times [2023-09-01 04:25:55,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:25:55,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880540663] [2023-09-01 04:25:55,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:25:55,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:25:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:25:55,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:25:55,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:25:55,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880540663] [2023-09-01 04:25:55,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880540663] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:25:55,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:25:55,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 04:25:55,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637230738] [2023-09-01 04:25:55,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:25:55,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 04:25:55,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:25:55,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 04:25:55,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 04:25:55,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 273 [2023-09-01 04:25:55,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:55,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:25:55,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 273 [2023-09-01 04:25:55,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:25:55,394 INFO L130 PetriNetUnfolder]: 180/354 cut-off events. [2023-09-01 04:25:55,395 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 04:25:55,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 354 events. 180/354 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1531 event pairs, 112 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 641. Up to 278 conditions per place. [2023-09-01 04:25:55,401 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 21 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-09-01 04:25:55,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 118 flow [2023-09-01 04:25:55,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:25:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:25:55,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-09-01 04:25:55,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4908424908424908 [2023-09-01 04:25:55,403 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-09-01 04:25:55,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-09-01 04:25:55,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:25:55,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-09-01 04:25:55,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:55,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:55,411 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:55,411 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 74 flow. Second operand 3 states and 402 transitions. [2023-09-01 04:25:55,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 118 flow [2023-09-01 04:25:55,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 32 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 04:25:55,413 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 72 flow [2023-09-01 04:25:55,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2023-09-01 04:25:55,415 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-09-01 04:25:55,415 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 72 flow [2023-09-01 04:25:55,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:55,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:25:55,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 04:25:55,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 04:25:55,416 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:25:55,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:25:55,417 INFO L85 PathProgramCache]: Analyzing trace with hash 512378967, now seen corresponding path program 1 times [2023-09-01 04:25:55,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:25:55,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838604180] [2023-09-01 04:25:55,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:25:55,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:25:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:25:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:25:55,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:25:55,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838604180] [2023-09-01 04:25:55,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838604180] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:25:55,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:25:55,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 04:25:55,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407780875] [2023-09-01 04:25:55,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:25:55,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 04:25:55,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:25:55,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 04:25:55,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 04:25:55,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 273 [2023-09-01 04:25:55,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:55,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:25:55,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 273 [2023-09-01 04:25:55,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:25:55,628 INFO L130 PetriNetUnfolder]: 120/249 cut-off events. [2023-09-01 04:25:55,628 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 04:25:55,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 249 events. 120/249 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 992 event pairs, 72 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 451. Up to 193 conditions per place. [2023-09-01 04:25:55,630 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 20 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-09-01 04:25:55,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 114 flow [2023-09-01 04:25:55,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:25:55,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:25:55,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2023-09-01 04:25:55,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46764346764346765 [2023-09-01 04:25:55,632 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 383 transitions. [2023-09-01 04:25:55,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 383 transitions. [2023-09-01 04:25:55,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:25:55,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 383 transitions. [2023-09-01 04:25:55,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:55,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:55,636 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:55,637 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 72 flow. Second operand 3 states and 383 transitions. [2023-09-01 04:25:55,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 114 flow [2023-09-01 04:25:55,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 31 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 04:25:55,639 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 70 flow [2023-09-01 04:25:55,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2023-09-01 04:25:55,641 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -9 predicate places. [2023-09-01 04:25:55,641 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 70 flow [2023-09-01 04:25:55,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:55,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:25:55,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:25:55,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 04:25:55,643 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:25:55,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:25:55,643 INFO L85 PathProgramCache]: Analyzing trace with hash -261057374, now seen corresponding path program 1 times [2023-09-01 04:25:55,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:25:55,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146128416] [2023-09-01 04:25:55,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:25:55,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:25:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:25:55,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:25:55,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:25:55,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146128416] [2023-09-01 04:25:55,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146128416] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:25:55,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:25:55,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 04:25:55,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369309889] [2023-09-01 04:25:55,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:25:55,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:25:55,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:25:55,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:25:55,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:25:55,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 273 [2023-09-01 04:25:55,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:55,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:25:55,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 273 [2023-09-01 04:25:55,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:25:55,787 INFO L130 PetriNetUnfolder]: 189/435 cut-off events. [2023-09-01 04:25:55,787 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 04:25:55,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 435 events. 189/435 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2003 event pairs, 72 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 745. Up to 195 conditions per place. [2023-09-01 04:25:55,790 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 33 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-09-01 04:25:55,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 44 transitions, 167 flow [2023-09-01 04:25:55,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:25:55,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:25:55,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-09-01 04:25:55,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5164835164835165 [2023-09-01 04:25:55,792 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-09-01 04:25:55,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-09-01 04:25:55,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:25:55,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-09-01 04:25:55,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:55,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:55,796 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:55,797 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 70 flow. Second operand 3 states and 423 transitions. [2023-09-01 04:25:55,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 44 transitions, 167 flow [2023-09-01 04:25:55,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 44 transitions, 163 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 04:25:55,798 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 78 flow [2023-09-01 04:25:55,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2023-09-01 04:25:55,799 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-09-01 04:25:55,800 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 78 flow [2023-09-01 04:25:55,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:55,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:25:55,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:25:55,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 04:25:55,801 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:25:55,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:25:55,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1965737995, now seen corresponding path program 1 times [2023-09-01 04:25:55,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:25:55,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137206070] [2023-09-01 04:25:55,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:25:55,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:25:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:25:55,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:25:55,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:25:55,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137206070] [2023-09-01 04:25:55,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137206070] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:25:55,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:25:55,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 04:25:55,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378494536] [2023-09-01 04:25:55,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:25:55,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:25:55,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:25:55,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:25:55,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:25:55,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 273 [2023-09-01 04:25:55,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:55,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:25:55,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 273 [2023-09-01 04:25:55,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:25:55,947 INFO L130 PetriNetUnfolder]: 297/642 cut-off events. [2023-09-01 04:25:55,948 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2023-09-01 04:25:55,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 642 events. 297/642 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3077 event pairs, 117 based on Foata normal form. 0/588 useless extension candidates. Maximal degree in co-relation 1202. Up to 300 conditions per place. [2023-09-01 04:25:55,951 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 35 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-09-01 04:25:55,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 191 flow [2023-09-01 04:25:55,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:25:55,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:25:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-09-01 04:25:55,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5164835164835165 [2023-09-01 04:25:55,954 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-09-01 04:25:55,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-09-01 04:25:55,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:25:55,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-09-01 04:25:55,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:55,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:55,957 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:55,957 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 78 flow. Second operand 3 states and 423 transitions. [2023-09-01 04:25:55,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 191 flow [2023-09-01 04:25:55,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 187 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 04:25:55,959 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 88 flow [2023-09-01 04:25:55,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2023-09-01 04:25:55,960 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -6 predicate places. [2023-09-01 04:25:55,960 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 88 flow [2023-09-01 04:25:55,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:55,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:25:55,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:25:55,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 04:25:55,961 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:25:55,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:25:55,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1443448180, now seen corresponding path program 1 times [2023-09-01 04:25:55,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:25:55,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450365361] [2023-09-01 04:25:55,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:25:55,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:25:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:25:56,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:25:56,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:25:56,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450365361] [2023-09-01 04:25:56,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450365361] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:25:56,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73125290] [2023-09-01 04:25:56,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:25:56,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:25:56,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:25:56,029 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-09-01 04:25:56,044 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-09-01 04:25:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:25:56,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjunts are in the unsatisfiable core [2023-09-01 04:25:56,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:25:56,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:25:56,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:25:56,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:25:56,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73125290] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:25:56,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:25:56,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-09-01 04:25:56,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961192829] [2023-09-01 04:25:56,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:25:56,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 04:25:56,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:25:56,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 04:25:56,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-09-01 04:25:56,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 273 [2023-09-01 04:25:56,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 88 flow. Second operand has 7 states, 7 states have (on average 129.42857142857142) internal successors, (906), 7 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-09-01 04:25:56,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:25:56,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 273 [2023-09-01 04:25:56,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:25:56,618 INFO L130 PetriNetUnfolder]: 593/1323 cut-off events. [2023-09-01 04:25:56,618 INFO L131 PetriNetUnfolder]: For 270/270 co-relation queries the response was YES. [2023-09-01 04:25:56,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2522 conditions, 1323 events. 593/1323 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 7089 event pairs, 42 based on Foata normal form. 74/1348 useless extension candidates. Maximal degree in co-relation 2516. Up to 168 conditions per place. [2023-09-01 04:25:56,627 INFO L137 encePairwiseOnDemand]: 266/273 looper letters, 105 selfloop transitions, 27 changer transitions 0/141 dead transitions. [2023-09-01 04:25:56,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 141 transitions, 631 flow [2023-09-01 04:25:56,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-09-01 04:25:56,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-09-01 04:25:56,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1754 transitions. [2023-09-01 04:25:56,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49422372499295575 [2023-09-01 04:25:56,632 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1754 transitions. [2023-09-01 04:25:56,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1754 transitions. [2023-09-01 04:25:56,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:25:56,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1754 transitions. [2023-09-01 04:25:56,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 134.92307692307693) internal successors, (1754), 13 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:56,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 273.0) internal successors, (3822), 14 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-09-01 04:25:56,644 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 273.0) internal successors, (3822), 14 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-09-01 04:25:56,644 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 88 flow. Second operand 13 states and 1754 transitions. [2023-09-01 04:25:56,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 141 transitions, 631 flow [2023-09-01 04:25:56,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 141 transitions, 625 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 04:25:56,647 INFO L231 Difference]: Finished difference. Result has 57 places, 55 transitions, 302 flow [2023-09-01 04:25:56,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=302, PETRI_PLACES=57, PETRI_TRANSITIONS=55} [2023-09-01 04:25:56,648 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2023-09-01 04:25:56,648 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 302 flow [2023-09-01 04:25:56,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 129.42857142857142) internal successors, (906), 7 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-09-01 04:25:56,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:25:56,649 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:25:56,660 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-09-01 04:25:56,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:25:56,857 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:25:56,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:25:56,857 INFO L85 PathProgramCache]: Analyzing trace with hash 938211468, now seen corresponding path program 1 times [2023-09-01 04:25:56,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:25:56,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313922841] [2023-09-01 04:25:56,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:25:56,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:25:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:25:56,983 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-09-01 04:25:56,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:25:56,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313922841] [2023-09-01 04:25:56,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313922841] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:25:56,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156511088] [2023-09-01 04:25:56,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:25:56,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:25:56,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:25:56,988 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-09-01 04:25:57,011 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-09-01 04:25:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:25:57,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 04:25:57,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:25:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-09-01 04:25:57,144 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 04:25:57,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156511088] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:25:57,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-01 04:25:57,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-09-01 04:25:57,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799037058] [2023-09-01 04:25:57,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:25:57,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 04:25:57,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:25:57,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 04:25:57,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-09-01 04:25:57,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-09-01 04:25:57,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 302 flow. Second operand has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:57,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:25:57,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-09-01 04:25:57,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:25:57,709 INFO L130 PetriNetUnfolder]: 2550/4433 cut-off events. [2023-09-01 04:25:57,709 INFO L131 PetriNetUnfolder]: For 5385/5385 co-relation queries the response was YES. [2023-09-01 04:25:57,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11736 conditions, 4433 events. 2550/4433 cut-off events. For 5385/5385 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 23912 event pairs, 485 based on Foata normal form. 0/4081 useless extension candidates. Maximal degree in co-relation 11721. Up to 1651 conditions per place. [2023-09-01 04:25:57,737 INFO L137 encePairwiseOnDemand]: 264/273 looper letters, 151 selfloop transitions, 18 changer transitions 0/172 dead transitions. [2023-09-01 04:25:57,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 172 transitions, 1280 flow [2023-09-01 04:25:57,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 04:25:57,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 04:25:57,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 964 transitions. [2023-09-01 04:25:57,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5044479330193616 [2023-09-01 04:25:57,741 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 964 transitions. [2023-09-01 04:25:57,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 964 transitions. [2023-09-01 04:25:57,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:25:57,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 964 transitions. [2023-09-01 04:25:57,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 137.71428571428572) internal successors, (964), 7 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:57,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 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-09-01 04:25:57,747 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 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-09-01 04:25:57,747 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 302 flow. Second operand 7 states and 964 transitions. [2023-09-01 04:25:57,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 172 transitions, 1280 flow [2023-09-01 04:25:57,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 172 transitions, 1179 flow, removed 33 selfloop flow, removed 2 redundant places. [2023-09-01 04:25:57,772 INFO L231 Difference]: Finished difference. Result has 67 places, 73 transitions, 408 flow [2023-09-01 04:25:57,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=408, PETRI_PLACES=67, PETRI_TRANSITIONS=73} [2023-09-01 04:25:57,772 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2023-09-01 04:25:57,773 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 73 transitions, 408 flow [2023-09-01 04:25:57,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:57,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:25:57,773 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:25:57,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-09-01 04:25:57,983 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-09-01 04:25:57,984 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:25:57,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:25:57,985 INFO L85 PathProgramCache]: Analyzing trace with hash 646760182, now seen corresponding path program 2 times [2023-09-01 04:25:57,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:25:57,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554622628] [2023-09-01 04:25:57,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:25:57,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:25:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:25:58,090 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-09-01 04:25:58,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:25:58,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554622628] [2023-09-01 04:25:58,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554622628] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:25:58,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:25:58,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 04:25:58,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815179011] [2023-09-01 04:25:58,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:25:58,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:25:58,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:25:58,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:25:58,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:25:58,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-09-01 04:25:58,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 73 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:58,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:25:58,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-09-01 04:25:58,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:25:58,359 INFO L130 PetriNetUnfolder]: 813/1815 cut-off events. [2023-09-01 04:25:58,359 INFO L131 PetriNetUnfolder]: For 3953/3953 co-relation queries the response was YES. [2023-09-01 04:25:58,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5707 conditions, 1815 events. 813/1815 cut-off events. For 3953/3953 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 10202 event pairs, 177 based on Foata normal form. 198/2012 useless extension candidates. Maximal degree in co-relation 5686. Up to 794 conditions per place. [2023-09-01 04:25:58,374 INFO L137 encePairwiseOnDemand]: 265/273 looper letters, 47 selfloop transitions, 20 changer transitions 0/80 dead transitions. [2023-09-01 04:25:58,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 80 transitions, 595 flow [2023-09-01 04:25:58,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:25:58,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:25:58,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-09-01 04:25:58,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49694749694749696 [2023-09-01 04:25:58,377 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-09-01 04:25:58,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-09-01 04:25:58,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:25:58,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-09-01 04:25:58,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:58,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:58,380 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:58,380 INFO L175 Difference]: Start difference. First operand has 67 places, 73 transitions, 408 flow. Second operand 3 states and 407 transitions. [2023-09-01 04:25:58,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 80 transitions, 595 flow [2023-09-01 04:25:58,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 80 transitions, 577 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-09-01 04:25:58,391 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 369 flow [2023-09-01 04:25:58,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=369, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2023-09-01 04:25:58,392 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2023-09-01 04:25:58,392 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 369 flow [2023-09-01 04:25:58,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:58,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:25:58,393 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:25:58,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 04:25:58,393 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:25:58,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:25:58,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1563860526, now seen corresponding path program 3 times [2023-09-01 04:25:58,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:25:58,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448278757] [2023-09-01 04:25:58,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:25:58,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:25:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:25:58,438 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-09-01 04:25:58,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:25:58,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448278757] [2023-09-01 04:25:58,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448278757] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:25:58,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:25:58,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 04:25:58,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189889410] [2023-09-01 04:25:58,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:25:58,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:25:58,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:25:58,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:25:58,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:25:58,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 273 [2023-09-01 04:25:58,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:58,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:25:58,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 273 [2023-09-01 04:25:58,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:25:58,652 INFO L130 PetriNetUnfolder]: 597/1255 cut-off events. [2023-09-01 04:25:58,653 INFO L131 PetriNetUnfolder]: For 2785/2789 co-relation queries the response was YES. [2023-09-01 04:25:58,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4400 conditions, 1255 events. 597/1255 cut-off events. For 2785/2789 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6064 event pairs, 146 based on Foata normal form. 54/1303 useless extension candidates. Maximal degree in co-relation 4380. Up to 849 conditions per place. [2023-09-01 04:25:58,664 INFO L137 encePairwiseOnDemand]: 268/273 looper letters, 61 selfloop transitions, 3 changer transitions 3/73 dead transitions. [2023-09-01 04:25:58,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 73 transitions, 557 flow [2023-09-01 04:25:58,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:25:58,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:25:58,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-09-01 04:25:58,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2023-09-01 04:25:58,666 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-09-01 04:25:58,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-09-01 04:25:58,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:25:58,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-09-01 04:25:58,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:58,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:58,670 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:58,670 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 369 flow. Second operand 3 states and 420 transitions. [2023-09-01 04:25:58,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 73 transitions, 557 flow [2023-09-01 04:25:58,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 73 transitions, 534 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 04:25:58,678 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 322 flow [2023-09-01 04:25:58,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2023-09-01 04:25:58,679 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2023-09-01 04:25:58,679 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 322 flow [2023-09-01 04:25:58,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:58,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:25:58,680 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:25:58,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 04:25:58,680 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:25:58,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:25:58,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1982420316, now seen corresponding path program 4 times [2023-09-01 04:25:58,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:25:58,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550511671] [2023-09-01 04:25:58,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:25:58,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:25:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:25:58,772 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-09-01 04:25:58,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:25:58,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550511671] [2023-09-01 04:25:58,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550511671] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:25:58,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583824994] [2023-09-01 04:25:58,773 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-01 04:25:58,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:25:58,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:25:58,777 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:25:58,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-01 04:25:58,889 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-01 04:25:58,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 04:25:58,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 04:25:58,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:25:58,970 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-09-01 04:25:58,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:25:59,028 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-09-01 04:25:59,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583824994] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:25:59,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:25:59,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2023-09-01 04:25:59,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681694869] [2023-09-01 04:25:59,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:25:59,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 04:25:59,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:25:59,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 04:25:59,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-09-01 04:25:59,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 273 [2023-09-01 04:25:59,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 322 flow. Second operand has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:59,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:25:59,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 273 [2023-09-01 04:25:59,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:25:59,226 INFO L130 PetriNetUnfolder]: 487/1163 cut-off events. [2023-09-01 04:25:59,226 INFO L131 PetriNetUnfolder]: For 2543/2573 co-relation queries the response was YES. [2023-09-01 04:25:59,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3637 conditions, 1163 events. 487/1163 cut-off events. For 2543/2573 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5971 event pairs, 90 based on Foata normal form. 60/1215 useless extension candidates. Maximal degree in co-relation 3616. Up to 258 conditions per place. [2023-09-01 04:25:59,241 INFO L137 encePairwiseOnDemand]: 269/273 looper letters, 61 selfloop transitions, 11 changer transitions 0/86 dead transitions. [2023-09-01 04:25:59,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 86 transitions, 630 flow [2023-09-01 04:25:59,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 04:25:59,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 04:25:59,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 695 transitions. [2023-09-01 04:25:59,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5091575091575091 [2023-09-01 04:25:59,246 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 695 transitions. [2023-09-01 04:25:59,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 695 transitions. [2023-09-01 04:25:59,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:25:59,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 695 transitions. [2023-09-01 04:25:59,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.0) internal successors, (695), 5 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:59,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 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-09-01 04:25:59,255 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 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-09-01 04:25:59,255 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 322 flow. Second operand 5 states and 695 transitions. [2023-09-01 04:25:59,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 86 transitions, 630 flow [2023-09-01 04:25:59,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 86 transitions, 624 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 04:25:59,267 INFO L231 Difference]: Finished difference. Result has 71 places, 58 transitions, 354 flow [2023-09-01 04:25:59,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=354, PETRI_PLACES=71, PETRI_TRANSITIONS=58} [2023-09-01 04:25:59,268 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2023-09-01 04:25:59,269 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 58 transitions, 354 flow [2023-09-01 04:25:59,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:59,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:25:59,269 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:25:59,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-01 04:25:59,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:25:59,473 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:25:59,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:25:59,474 INFO L85 PathProgramCache]: Analyzing trace with hash -344142387, now seen corresponding path program 5 times [2023-09-01 04:25:59,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:25:59,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151160375] [2023-09-01 04:25:59,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:25:59,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:25:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:25:59,649 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-09-01 04:25:59,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:25:59,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151160375] [2023-09-01 04:25:59,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151160375] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:25:59,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767863134] [2023-09-01 04:25:59,650 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-09-01 04:25:59,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:25:59,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:25:59,652 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:25:59,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-01 04:25:59,783 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-09-01 04:25:59,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 04:25:59,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 8 conjunts are in the unsatisfiable core [2023-09-01 04:25:59,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:25:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-09-01 04:25:59,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 04:25:59,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767863134] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:25:59,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-01 04:25:59,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2023-09-01 04:25:59,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147946012] [2023-09-01 04:25:59,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:25:59,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 04:25:59,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:25:59,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 04:25:59,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-09-01 04:25:59,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 273 [2023-09-01 04:25:59,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 58 transitions, 354 flow. Second operand has 6 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:25:59,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:25:59,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 273 [2023-09-01 04:25:59,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:26:00,136 INFO L130 PetriNetUnfolder]: 677/1348 cut-off events. [2023-09-01 04:26:00,136 INFO L131 PetriNetUnfolder]: For 3860/3860 co-relation queries the response was YES. [2023-09-01 04:26:00,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4867 conditions, 1348 events. 677/1348 cut-off events. For 3860/3860 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5922 event pairs, 170 based on Foata normal form. 24/1370 useless extension candidates. Maximal degree in co-relation 4845. Up to 520 conditions per place. [2023-09-01 04:26:00,150 INFO L137 encePairwiseOnDemand]: 262/273 looper letters, 92 selfloop transitions, 20 changer transitions 0/114 dead transitions. [2023-09-01 04:26:00,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 114 transitions, 959 flow [2023-09-01 04:26:00,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 04:26:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 04:26:00,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1037 transitions. [2023-09-01 04:26:00,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4748168498168498 [2023-09-01 04:26:00,155 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1037 transitions. [2023-09-01 04:26:00,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1037 transitions. [2023-09-01 04:26:00,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:26:00,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1037 transitions. [2023-09-01 04:26:00,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 129.625) internal successors, (1037), 8 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:00,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 273.0) internal successors, (2457), 9 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:00,162 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 273.0) internal successors, (2457), 9 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:00,162 INFO L175 Difference]: Start difference. First operand has 71 places, 58 transitions, 354 flow. Second operand 8 states and 1037 transitions. [2023-09-01 04:26:00,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 114 transitions, 959 flow [2023-09-01 04:26:00,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 114 transitions, 914 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-09-01 04:26:00,174 INFO L231 Difference]: Finished difference. Result has 78 places, 60 transitions, 415 flow [2023-09-01 04:26:00,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=415, PETRI_PLACES=78, PETRI_TRANSITIONS=60} [2023-09-01 04:26:00,175 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2023-09-01 04:26:00,176 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 60 transitions, 415 flow [2023-09-01 04:26:00,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:00,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:26:00,176 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:26:00,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-09-01 04:26:00,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:26:00,383 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:26:00,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:26:00,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1681654891, now seen corresponding path program 6 times [2023-09-01 04:26:00,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:26:00,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390741090] [2023-09-01 04:26:00,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:26:00,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:26:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:26:00,624 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-09-01 04:26:00,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:26:00,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390741090] [2023-09-01 04:26:00,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390741090] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:26:00,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063845503] [2023-09-01 04:26:00,625 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-09-01 04:26:00,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:26:00,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:26:00,627 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:26:00,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-09-01 04:26:00,756 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-09-01 04:26:00,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 04:26:00,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 16 conjunts are in the unsatisfiable core [2023-09-01 04:26:00,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:26:01,183 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-09-01 04:26:01,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 04:26:01,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063845503] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:26:01,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-01 04:26:01,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2023-09-01 04:26:01,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106445326] [2023-09-01 04:26:01,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:26:01,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:26:01,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:26:01,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:26:01,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-09-01 04:26:01,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 273 [2023-09-01 04:26:01,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 60 transitions, 415 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:01,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:26:01,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 273 [2023-09-01 04:26:01,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:26:01,411 INFO L130 PetriNetUnfolder]: 459/1066 cut-off events. [2023-09-01 04:26:01,412 INFO L131 PetriNetUnfolder]: For 3039/3067 co-relation queries the response was YES. [2023-09-01 04:26:01,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4013 conditions, 1066 events. 459/1066 cut-off events. For 3039/3067 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5073 event pairs, 281 based on Foata normal form. 0/1052 useless extension candidates. Maximal degree in co-relation 3988. Up to 780 conditions per place. [2023-09-01 04:26:01,421 INFO L137 encePairwiseOnDemand]: 271/273 looper letters, 43 selfloop transitions, 1 changer transitions 0/59 dead transitions. [2023-09-01 04:26:01,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 59 transitions, 501 flow [2023-09-01 04:26:01,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:26:01,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:26:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-09-01 04:26:01,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47374847374847373 [2023-09-01 04:26:01,424 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-09-01 04:26:01,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-09-01 04:26:01,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:26:01,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-09-01 04:26:01,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:01,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:01,427 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:01,427 INFO L175 Difference]: Start difference. First operand has 78 places, 60 transitions, 415 flow. Second operand 3 states and 388 transitions. [2023-09-01 04:26:01,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 59 transitions, 501 flow [2023-09-01 04:26:01,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 59 transitions, 472 flow, removed 1 selfloop flow, removed 6 redundant places. [2023-09-01 04:26:01,435 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 386 flow [2023-09-01 04:26:01,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2023-09-01 04:26:01,436 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2023-09-01 04:26:01,436 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 386 flow [2023-09-01 04:26:01,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:01,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:26:01,437 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:26:01,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-09-01 04:26:01,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-09-01 04:26:01,645 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:26:01,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:26:01,646 INFO L85 PathProgramCache]: Analyzing trace with hash 181541812, now seen corresponding path program 2 times [2023-09-01 04:26:01,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:26:01,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509326173] [2023-09-01 04:26:01,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:26:01,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:26:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 04:26:01,697 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 04:26:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 04:26:01,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 04:26:01,745 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 04:26:01,746 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (11 of 12 remaining) [2023-09-01 04:26:01,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-09-01 04:26:01,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-09-01 04:26:01,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-09-01 04:26:01,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-09-01 04:26:01,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-09-01 04:26:01,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-09-01 04:26:01,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-09-01 04:26:01,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 12 remaining) [2023-09-01 04:26:01,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (2 of 12 remaining) [2023-09-01 04:26:01,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-09-01 04:26:01,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 12 remaining) [2023-09-01 04:26:01,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-09-01 04:26:01,750 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:26:01,753 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 04:26:01,754 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 04:26:01,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 04:26:01 BasicIcfg [2023-09-01 04:26:01,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 04:26:01,818 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 04:26:01,819 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 04:26:01,819 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 04:26:01,819 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 04:25:47" (3/4) ... [2023-09-01 04:26:01,822 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-09-01 04:26:01,822 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 04:26:01,823 INFO L158 Benchmark]: Toolchain (without parser) took 16157.04ms. Allocated memory was 71.3MB in the beginning and 348.1MB in the end (delta: 276.8MB). Free memory was 41.0MB in the beginning and 266.0MB in the end (delta: -225.0MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. [2023-09-01 04:26:01,823 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 54.5MB. Free memory was 32.4MB in the beginning and 32.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 04:26:01,823 INFO L158 Benchmark]: CACSL2BoogieTranslator took 611.50ms. Allocated memory is still 71.3MB. Free memory was 40.9MB in the beginning and 48.0MB in the end (delta: -7.1MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2023-09-01 04:26:01,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.31ms. Allocated memory is still 71.3MB. Free memory was 48.0MB in the beginning and 45.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 04:26:01,824 INFO L158 Benchmark]: Boogie Preprocessor took 58.29ms. Allocated memory is still 71.3MB. Free memory was 45.8MB in the beginning and 44.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 04:26:01,824 INFO L158 Benchmark]: RCFGBuilder took 602.46ms. Allocated memory is still 71.3MB. Free memory was 43.7MB in the beginning and 44.7MB in the end (delta: -1.0MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2023-09-01 04:26:01,825 INFO L158 Benchmark]: TraceAbstraction took 14798.41ms. Allocated memory was 71.3MB in the beginning and 348.1MB in the end (delta: 276.8MB). Free memory was 44.1MB in the beginning and 266.0MB in the end (delta: -221.9MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. [2023-09-01 04:26:01,825 INFO L158 Benchmark]: Witness Printer took 3.85ms. Allocated memory is still 348.1MB. Free memory is still 266.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 04:26:01,826 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.30ms. Allocated memory is still 54.5MB. Free memory was 32.4MB in the beginning and 32.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 611.50ms. Allocated memory is still 71.3MB. Free memory was 40.9MB in the beginning and 48.0MB in the end (delta: -7.1MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.31ms. Allocated memory is still 71.3MB. Free memory was 48.0MB in the beginning and 45.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.29ms. Allocated memory is still 71.3MB. Free memory was 45.8MB in the beginning and 44.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 602.46ms. Allocated memory is still 71.3MB. Free memory was 43.7MB in the beginning and 44.7MB in the end (delta: -1.0MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. * TraceAbstraction took 14798.41ms. Allocated memory was 71.3MB in the beginning and 348.1MB in the end (delta: 276.8MB). Free memory was 44.1MB in the beginning and 266.0MB in the end (delta: -221.9MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. * Witness Printer took 3.85ms. Allocated memory is still 348.1MB. Free memory is still 266.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: 6.6s, 134 PlacesBefore, 42 PlacesAfterwards, 137 TransitionsBefore, 40 TransitionsAfterwards, 2314 CoEnabledTransitionPairs, 7 FixpointIterations, 71 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 8 ConcurrentYvCompositions, 5 ChoiceCompositions, 130 TotalNumberOfCompositions, 5425 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3215, independent: 3049, independent conditional: 0, independent unconditional: 3049, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1186, independent: 1162, independent conditional: 0, independent unconditional: 1162, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3215, independent: 1887, independent conditional: 0, independent unconditional: 1887, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 1186, unknown conditional: 0, unknown unconditional: 1186] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 159, Positive conditional cache size: 0, Positive unconditional cache size: 159, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 919]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 919. Possible FailurePath: [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; [L908] 0 num = 0 [L909] 0 total = 0 [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, pthread_create(&t1, 0, thread1, 0)=-2, t1={6:0}, t2={7:0}, total=0] [L876] 1 int i; [L877] 1 i = 0 VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L882] 1 num++ [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=1, pthread_create(&t2, 0, thread2, 0)=-1, t1={6:0}, t2={7:0}, total=0] [L915] 0 \read(t1) VAL [\read(t1)=-2, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=1, t1={6:0}, t2={7:0}, total=0] [L890] 2 int j; [L891] 2 j = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L897] 2 num-- [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L882] 1 num++ [L892] COND TRUE 2 j < 3 [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=1] [L897] 2 num-- [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=2, m={3:0}, num=0, total=1] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L878] COND TRUE 1 i < 3 [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L882] 1 num++ [L892] COND TRUE 2 j < 3 [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=1, total=3] [L897] 2 num-- [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) [L902] 2 total = total + j [L903] 2 flag = 1 [L904] 2 return ((void *)0); [L885] 1 i++ VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, total=6] [L878] COND FALSE 1 !(i < 3) [L887] 1 return ((void *)0); [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=-2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=6] [L916] 0 \read(t2) VAL [\read(t2)=-1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=6] [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\read(t2)=-1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=6] [L917] COND TRUE 0 \read(flag) [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) [L919] 0 reach_error() VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=6] - 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: 906]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 914]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 913]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 179 locations, 12 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: 14.6s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 862 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 571 mSDsluCounter, 121 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1409 IncrementalHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 93 mSDtfsCounter, 1409 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 266 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=415occurred in iteration=13, InterpolantAutomatonStates: 62, 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.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 567 NumberOfCodeBlocks, 526 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 564 ConstructedInterpolants, 45 QuantifiedInterpolants, 2223 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1343 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 21 InterpolantComputations, 12 PerfectInterpolantSequences, 297/345 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-09-01 04:26:01,849 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/pthread-deagle/arithmetic_prog_bad.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 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 04:26:03,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 04:26:03,785 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 04:26:03,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 04:26:03,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 04:26:03,829 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 04:26:03,831 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 04:26:03,834 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 04:26:03,836 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 04:26:03,840 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 04:26:03,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 04:26:03,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 04:26:03,844 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 04:26:03,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 04:26:03,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 04:26:03,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 04:26:03,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 04:26:03,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 04:26:03,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 04:26:03,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 04:26:03,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 04:26:03,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 04:26:03,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 04:26:03,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 04:26:03,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 04:26:03,875 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 04:26:03,875 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 04:26:03,876 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 04:26:03,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 04:26:03,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 04:26:03,879 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 04:26:03,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 04:26:03,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 04:26:03,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 04:26:03,887 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 04:26:03,888 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 04:26:03,888 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 04:26:03,889 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 04:26:03,889 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 04:26:03,901 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 04:26:03,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 04:26:03,903 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-09-01 04:26:03,934 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 04:26:03,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 04:26:03,936 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 04:26:03,936 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 04:26:03,937 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 04:26:03,937 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 04:26:03,937 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 04:26:03,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 04:26:03,938 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 04:26:03,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 04:26:03,939 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 04:26:03,939 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-01 04:26:03,939 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 04:26:03,939 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 04:26:03,940 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 04:26:03,940 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-09-01 04:26:03,940 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-09-01 04:26:03,940 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-09-01 04:26:03,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 04:26:03,940 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-09-01 04:26:03,941 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-09-01 04:26:03,941 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-09-01 04:26:03,941 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 04:26:03,941 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 04:26:03,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 04:26:03,941 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 04:26:03,942 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 04:26:03,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 04:26:03,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 04:26:03,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 04:26:03,942 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-09-01 04:26:03,942 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-09-01 04:26:03,943 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 04:26:03,943 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 04:26:03,943 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 04:26:03,943 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-09-01 04:26:03,943 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 04:26:03,944 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 -> 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 04:26:04,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 04:26:04,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 04:26:04,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 04:26:04,309 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 04:26:04,310 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 04:26:04,311 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2023-09-01 04:26:05,523 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 04:26:05,738 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 04:26:05,739 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2023-09-01 04:26:05,756 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8853af8ff/400ba31023f14c0fabb8ac870ca7e9a8/FLAGafb1516b5 [2023-09-01 04:26:05,771 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8853af8ff/400ba31023f14c0fabb8ac870ca7e9a8 [2023-09-01 04:26:05,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 04:26:05,774 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 04:26:05,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 04:26:05,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 04:26:05,781 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 04:26:05,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 04:26:05" (1/1) ... [2023-09-01 04:26:05,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@778337f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:26:05, skipping insertion in model container [2023-09-01 04:26:05,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 04:26:05" (1/1) ... [2023-09-01 04:26:05,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 04:26:05,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 04:26:06,262 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2023-09-01 04:26:06,267 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 04:26:06,287 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 04:26:06,346 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2023-09-01 04:26:06,347 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 04:26:06,406 INFO L208 MainTranslator]: Completed translation [2023-09-01 04:26:06,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:26:06 WrapperNode [2023-09-01 04:26:06,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 04:26:06,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 04:26:06,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 04:26:06,407 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 04:26:06,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:26:06" (1/1) ... [2023-09-01 04:26:06,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:26:06" (1/1) ... [2023-09-01 04:26:06,464 INFO L138 Inliner]: procedures = 250, calls = 50, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 82 [2023-09-01 04:26:06,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 04:26:06,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 04:26:06,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 04:26:06,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 04:26:06,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:26:06" (1/1) ... [2023-09-01 04:26:06,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:26:06" (1/1) ... [2023-09-01 04:26:06,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:26:06" (1/1) ... [2023-09-01 04:26:06,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:26:06" (1/1) ... [2023-09-01 04:26:06,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:26:06" (1/1) ... [2023-09-01 04:26:06,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:26:06" (1/1) ... [2023-09-01 04:26:06,501 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:26:06" (1/1) ... [2023-09-01 04:26:06,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:26:06" (1/1) ... [2023-09-01 04:26:06,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 04:26:06,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 04:26:06,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 04:26:06,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 04:26:06,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:26:06" (1/1) ... [2023-09-01 04:26:06,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 04:26:06,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:26:06,533 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-09-01 04:26:06,538 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-09-01 04:26:06,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-09-01 04:26:06,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 04:26:06,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 04:26:06,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-09-01 04:26:06,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-09-01 04:26:06,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-09-01 04:26:06,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-09-01 04:26:06,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-09-01 04:26:06,561 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-01 04:26:06,562 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-01 04:26:06,562 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-01 04:26:06,562 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-01 04:26:06,562 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-01 04:26:06,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 04:26:06,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 04:26:06,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 04:26:06,564 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 04:26:06,682 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 04:26:06,684 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 04:26:07,118 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 04:26:07,129 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 04:26:07,129 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-09-01 04:26:07,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 04:26:07 BoogieIcfgContainer [2023-09-01 04:26:07,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 04:26:07,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 04:26:07,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 04:26:07,137 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 04:26:07,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 04:26:05" (1/3) ... [2023-09-01 04:26:07,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6a8a7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 04:26:07, skipping insertion in model container [2023-09-01 04:26:07,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:26:06" (2/3) ... [2023-09-01 04:26:07,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6a8a7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 04:26:07, skipping insertion in model container [2023-09-01 04:26:07,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 04:26:07" (3/3) ... [2023-09-01 04:26:07,139 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2023-09-01 04:26:07,154 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 04:26:07,155 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-09-01 04:26:07,155 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 04:26:07,263 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-01 04:26:07,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 144 transitions, 304 flow [2023-09-01 04:26:07,402 INFO L130 PetriNetUnfolder]: 10/142 cut-off events. [2023-09-01 04:26:07,403 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 04:26:07,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 142 events. 10/142 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 181 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 88. Up to 3 conditions per place. [2023-09-01 04:26:07,408 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 144 transitions, 304 flow [2023-09-01 04:26:07,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 138 transitions, 288 flow [2023-09-01 04:26:07,419 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 04:26:07,429 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 138 transitions, 288 flow [2023-09-01 04:26:07,432 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 138 transitions, 288 flow [2023-09-01 04:26:07,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 138 transitions, 288 flow [2023-09-01 04:26:07,482 INFO L130 PetriNetUnfolder]: 10/138 cut-off events. [2023-09-01 04:26:07,483 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 04:26:07,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 138 events. 10/138 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 181 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 88. Up to 3 conditions per place. [2023-09-01 04:26:07,488 INFO L119 LiptonReduction]: Number of co-enabled transitions 2314 [2023-09-01 04:26:29,833 INFO L134 LiptonReduction]: Checked pairs total: 5425 [2023-09-01 04:26:29,833 INFO L136 LiptonReduction]: Total number of compositions: 131 [2023-09-01 04:26:29,845 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 04:26:29,849 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;@2e1cb2e0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 04:26:29,850 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-09-01 04:26:29,851 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-09-01 04:26:29,851 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 04:26:29,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:26:29,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-09-01 04:26:29,852 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:26:29,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:26:29,855 INFO L85 PathProgramCache]: Analyzing trace with hash 546, now seen corresponding path program 1 times [2023-09-01 04:26:29,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 04:26:29,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752319648] [2023-09-01 04:26:29,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:26:29,864 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-09-01 04:26:29,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 04:26:29,865 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-09-01 04:26:29,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-09-01 04:26:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:26:29,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-09-01 04:26:29,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:26:29,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:26:29,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 04:26:29,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 04:26:29,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752319648] [2023-09-01 04:26:29,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752319648] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:26:29,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:26:29,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-09-01 04:26:29,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061380425] [2023-09-01 04:26:29,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:26:29,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-01 04:26:29,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 04:26:29,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-01 04:26:29,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-01 04:26:29,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 275 [2023-09-01 04:26:30,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:30,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:26:30,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 275 [2023-09-01 04:26:30,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:26:30,215 INFO L130 PetriNetUnfolder]: 264/513 cut-off events. [2023-09-01 04:26:30,215 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-09-01 04:26:30,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 513 events. 264/513 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2442 event pairs, 168 based on Foata normal form. 24/383 useless extension candidates. Maximal degree in co-relation 833. Up to 409 conditions per place. [2023-09-01 04:26:30,221 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 28 selfloop transitions, 0 changer transitions 0/37 dead transitions. [2023-09-01 04:26:30,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 142 flow [2023-09-01 04:26:30,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-01 04:26:30,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-09-01 04:26:30,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 299 transitions. [2023-09-01 04:26:30,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5436363636363636 [2023-09-01 04:26:30,236 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 299 transitions. [2023-09-01 04:26:30,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 299 transitions. [2023-09-01 04:26:30,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:26:30,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 299 transitions. [2023-09-01 04:26:30,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:30,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:30,250 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:30,252 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 92 flow. Second operand 2 states and 299 transitions. [2023-09-01 04:26:30,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 142 flow [2023-09-01 04:26:30,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 134 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 04:26:30,256 INFO L231 Difference]: Finished difference. Result has 37 places, 37 transitions, 78 flow [2023-09-01 04:26:30,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=37, PETRI_TRANSITIONS=37} [2023-09-01 04:26:30,261 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -5 predicate places. [2023-09-01 04:26:30,261 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 37 transitions, 78 flow [2023-09-01 04:26:30,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:30,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:26:30,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 04:26:30,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-09-01 04:26:30,471 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-09-01 04:26:30,471 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:26:30,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:26:30,472 INFO L85 PathProgramCache]: Analyzing trace with hash 538029, now seen corresponding path program 1 times [2023-09-01 04:26:30,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 04:26:30,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060937685] [2023-09-01 04:26:30,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:26:30,473 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-09-01 04:26:30,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 04:26:30,475 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-09-01 04:26:30,477 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-09-01 04:26:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:26:30,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2023-09-01 04:26:30,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:26:30,633 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-09-01 04:26:30,634 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-09-01 04:26:30,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:26:30,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 04:26:30,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 04:26:30,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060937685] [2023-09-01 04:26:30,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060937685] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:26:30,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:26:30,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 04:26:30,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630013023] [2023-09-01 04:26:30,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:26:30,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:26:30,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 04:26:30,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:26:30,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:26:30,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 275 [2023-09-01 04:26:30,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:30,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:26:30,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 275 [2023-09-01 04:26:30,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:26:30,895 INFO L130 PetriNetUnfolder]: 252/486 cut-off events. [2023-09-01 04:26:30,895 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 04:26:30,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 486 events. 252/486 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2283 event pairs, 160 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 878. Up to 385 conditions per place. [2023-09-01 04:26:30,903 INFO L137 encePairwiseOnDemand]: 271/275 looper letters, 24 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-09-01 04:26:30,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 35 transitions, 126 flow [2023-09-01 04:26:30,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:26:30,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:26:30,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2023-09-01 04:26:30,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48848484848484847 [2023-09-01 04:26:30,913 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2023-09-01 04:26:30,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2023-09-01 04:26:30,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:26:30,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2023-09-01 04:26:30,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:30,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:30,924 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:30,925 INFO L175 Difference]: Start difference. First operand has 37 places, 37 transitions, 78 flow. Second operand 3 states and 403 transitions. [2023-09-01 04:26:30,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 35 transitions, 126 flow [2023-09-01 04:26:30,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 35 transitions, 126 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 04:26:30,926 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 78 flow [2023-09-01 04:26:30,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2023-09-01 04:26:30,927 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -5 predicate places. [2023-09-01 04:26:30,927 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 78 flow [2023-09-01 04:26:30,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:30,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:26:30,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 04:26:30,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-09-01 04:26:31,139 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-09-01 04:26:31,140 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:26:31,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:26:31,140 INFO L85 PathProgramCache]: Analyzing trace with hash 538028, now seen corresponding path program 1 times [2023-09-01 04:26:31,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 04:26:31,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1028771949] [2023-09-01 04:26:31,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:26:31,141 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-09-01 04:26:31,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 04:26:31,143 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-09-01 04:26:31,181 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-09-01 04:26:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:26:31,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 04:26:31,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:26:31,284 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:26:31,285 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-09-01 04:26:31,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:26:31,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 04:26:31,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 04:26:31,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1028771949] [2023-09-01 04:26:31,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1028771949] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:26:31,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:26:31,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 04:26:31,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485918652] [2023-09-01 04:26:31,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:26:31,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:26:31,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 04:26:31,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:26:31,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:26:31,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 275 [2023-09-01 04:26:31,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:31,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:26:31,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 275 [2023-09-01 04:26:31,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:26:31,503 INFO L130 PetriNetUnfolder]: 240/459 cut-off events. [2023-09-01 04:26:31,504 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 04:26:31,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 459 events. 240/459 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2096 event pairs, 152 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 831. Up to 363 conditions per place. [2023-09-01 04:26:31,507 INFO L137 encePairwiseOnDemand]: 271/275 looper letters, 22 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2023-09-01 04:26:31,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 122 flow [2023-09-01 04:26:31,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:26:31,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:26:31,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2023-09-01 04:26:31,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5006060606060606 [2023-09-01 04:26:31,510 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2023-09-01 04:26:31,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2023-09-01 04:26:31,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:26:31,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2023-09-01 04:26:31,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:31,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:31,514 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:31,514 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 78 flow. Second operand 3 states and 413 transitions. [2023-09-01 04:26:31,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 122 flow [2023-09-01 04:26:31,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 04:26:31,515 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 74 flow [2023-09-01 04:26:31,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2023-09-01 04:26:31,516 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-09-01 04:26:31,517 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 74 flow [2023-09-01 04:26:31,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:31,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:26:31,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 04:26:31,535 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-09-01 04:26:31,727 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-09-01 04:26:31,728 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:26:31,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:26:31,728 INFO L85 PathProgramCache]: Analyzing trace with hash 517059102, now seen corresponding path program 1 times [2023-09-01 04:26:31,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 04:26:31,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280429674] [2023-09-01 04:26:31,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:26:31,729 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-09-01 04:26:31,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 04:26:31,731 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-09-01 04:26:31,734 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-09-01 04:26:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:26:31,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 04:26:31,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:26:31,845 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-01 04:26:31,845 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-09-01 04:26:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:26:31,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 04:26:31,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 04:26:31,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280429674] [2023-09-01 04:26:31,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280429674] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:26:31,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:26:31,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 04:26:31,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239220835] [2023-09-01 04:26:31,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:26:31,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:26:31,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 04:26:31,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:26:31,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:26:31,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 275 [2023-09-01 04:26:31,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:31,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:26:31,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 275 [2023-09-01 04:26:31,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:26:32,088 INFO L130 PetriNetUnfolder]: 180/354 cut-off events. [2023-09-01 04:26:32,088 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 04:26:32,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 354 events. 180/354 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1532 event pairs, 112 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 641. Up to 278 conditions per place. [2023-09-01 04:26:32,091 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 21 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-09-01 04:26:32,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 118 flow [2023-09-01 04:26:32,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:26:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:26:32,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions. [2023-09-01 04:26:32,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48363636363636364 [2023-09-01 04:26:32,093 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions. [2023-09-01 04:26:32,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions. [2023-09-01 04:26:32,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:26:32,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions. [2023-09-01 04:26:32,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:32,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:32,097 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:32,097 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 74 flow. Second operand 3 states and 399 transitions. [2023-09-01 04:26:32,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 118 flow [2023-09-01 04:26:32,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 32 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 04:26:32,099 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 72 flow [2023-09-01 04:26:32,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2023-09-01 04:26:32,100 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-09-01 04:26:32,100 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 72 flow [2023-09-01 04:26:32,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:32,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:26:32,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 04:26:32,116 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-09-01 04:26:32,310 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-09-01 04:26:32,311 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:26:32,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:26:32,311 INFO L85 PathProgramCache]: Analyzing trace with hash 517059103, now seen corresponding path program 1 times [2023-09-01 04:26:32,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 04:26:32,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919954087] [2023-09-01 04:26:32,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:26:32,312 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-09-01 04:26:32,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 04:26:32,313 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-09-01 04:26:32,314 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-09-01 04:26:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:26:32,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2023-09-01 04:26:32,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:26:32,440 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-09-01 04:26:32,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2023-09-01 04:26:32,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:26:32,500 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 04:26:32,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 04:26:32,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919954087] [2023-09-01 04:26:32,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919954087] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:26:32,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:26:32,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 04:26:32,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074842879] [2023-09-01 04:26:32,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:26:32,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:26:32,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 04:26:32,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:26:32,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:26:32,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 275 [2023-09-01 04:26:32,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:32,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:26:32,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 275 [2023-09-01 04:26:32,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:26:32,671 INFO L130 PetriNetUnfolder]: 120/249 cut-off events. [2023-09-01 04:26:32,673 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 04:26:32,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 249 events. 120/249 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 996 event pairs, 72 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 451. Up to 193 conditions per place. [2023-09-01 04:26:32,675 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 20 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-09-01 04:26:32,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 114 flow [2023-09-01 04:26:32,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:26:32,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:26:32,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-09-01 04:26:32,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49696969696969695 [2023-09-01 04:26:32,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-09-01 04:26:32,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-09-01 04:26:32,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:26:32,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-09-01 04:26:32,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:32,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:32,681 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:32,681 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 72 flow. Second operand 3 states and 410 transitions. [2023-09-01 04:26:32,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 114 flow [2023-09-01 04:26:32,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 31 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 04:26:32,683 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 70 flow [2023-09-01 04:26:32,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2023-09-01 04:26:32,686 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -9 predicate places. [2023-09-01 04:26:32,687 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 70 flow [2023-09-01 04:26:32,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:32,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:26:32,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:26:32,705 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-09-01 04:26:32,899 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-09-01 04:26:32,900 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:26:32,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:26:32,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1060858756, now seen corresponding path program 1 times [2023-09-01 04:26:32,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 04:26:32,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567169485] [2023-09-01 04:26:32,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:26:32,901 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-09-01 04:26:32,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 04:26:32,902 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-09-01 04:26:32,905 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-09-01 04:26:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:26:32,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjunts are in the unsatisfiable core [2023-09-01 04:26:32,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:26:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:26:33,006 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 04:26:33,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 04:26:33,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567169485] [2023-09-01 04:26:33,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567169485] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:26:33,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:26:33,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 04:26:33,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660108670] [2023-09-01 04:26:33,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:26:33,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:26:33,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 04:26:33,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:26:33,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:26:33,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 275 [2023-09-01 04:26:33,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:33,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:26:33,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 275 [2023-09-01 04:26:33,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:26:33,179 INFO L130 PetriNetUnfolder]: 189/435 cut-off events. [2023-09-01 04:26:33,180 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 04:26:33,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 435 events. 189/435 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2015 event pairs, 72 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 745. Up to 195 conditions per place. [2023-09-01 04:26:33,182 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 33 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-09-01 04:26:33,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 44 transitions, 167 flow [2023-09-01 04:26:33,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:26:33,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:26:33,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-09-01 04:26:33,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5163636363636364 [2023-09-01 04:26:33,185 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-09-01 04:26:33,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-09-01 04:26:33,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:26:33,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-09-01 04:26:33,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:33,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:33,188 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:33,189 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 70 flow. Second operand 3 states and 426 transitions. [2023-09-01 04:26:33,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 44 transitions, 167 flow [2023-09-01 04:26:33,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 44 transitions, 163 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 04:26:33,190 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 78 flow [2023-09-01 04:26:33,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2023-09-01 04:26:33,191 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-09-01 04:26:33,191 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 78 flow [2023-09-01 04:26:33,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:33,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:26:33,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:26:33,209 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-09-01 04:26:33,410 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-09-01 04:26:33,410 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:26:33,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:26:33,411 INFO L85 PathProgramCache]: Analyzing trace with hash -791743015, now seen corresponding path program 1 times [2023-09-01 04:26:33,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 04:26:33,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [774526635] [2023-09-01 04:26:33,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:26:33,412 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-09-01 04:26:33,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 04:26:33,413 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-09-01 04:26:33,417 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-09-01 04:26:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:26:33,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2023-09-01 04:26:33,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:26:33,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:26:33,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 04:26:33,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 04:26:33,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [774526635] [2023-09-01 04:26:33,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [774526635] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:26:33,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:26:33,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 04:26:33,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857771060] [2023-09-01 04:26:33,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:26:33,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:26:33,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 04:26:33,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:26:33,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:26:33,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 275 [2023-09-01 04:26:33,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:33,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:26:33,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 275 [2023-09-01 04:26:33,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:26:33,673 INFO L130 PetriNetUnfolder]: 297/642 cut-off events. [2023-09-01 04:26:33,673 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2023-09-01 04:26:33,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 642 events. 297/642 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3088 event pairs, 117 based on Foata normal form. 0/588 useless extension candidates. Maximal degree in co-relation 1202. Up to 300 conditions per place. [2023-09-01 04:26:33,677 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 35 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-09-01 04:26:33,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 191 flow [2023-09-01 04:26:33,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:26:33,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:26:33,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-09-01 04:26:33,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5163636363636364 [2023-09-01 04:26:33,679 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-09-01 04:26:33,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-09-01 04:26:33,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:26:33,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-09-01 04:26:33,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:33,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:33,682 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:33,683 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 78 flow. Second operand 3 states and 426 transitions. [2023-09-01 04:26:33,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 191 flow [2023-09-01 04:26:33,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 187 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 04:26:33,684 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 88 flow [2023-09-01 04:26:33,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2023-09-01 04:26:33,685 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -6 predicate places. [2023-09-01 04:26:33,685 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 88 flow [2023-09-01 04:26:33,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:33,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:26:33,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:26:33,695 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-09-01 04:26:33,896 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-09-01 04:26:33,896 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:26:33,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:26:33,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1472421019, now seen corresponding path program 1 times [2023-09-01 04:26:33,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 04:26:33,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495867314] [2023-09-01 04:26:33,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:26:33,897 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-09-01 04:26:33,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 04:26:33,898 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-09-01 04:26:33,899 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-09-01 04:26:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:26:34,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 3 conjunts are in the unsatisfiable core [2023-09-01 04:26:34,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:26:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:26:34,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:26:34,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:26:34,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 04:26:34,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495867314] [2023-09-01 04:26:34,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495867314] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:26:34,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-09-01 04:26:34,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-09-01 04:26:34,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034463988] [2023-09-01 04:26:34,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-09-01 04:26:34,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 04:26:34,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 04:26:34,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 04:26:34,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-09-01 04:26:34,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 275 [2023-09-01 04:26:34,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 88 flow. Second operand has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 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-09-01 04:26:34,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:26:34,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 275 [2023-09-01 04:26:34,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:26:34,476 INFO L130 PetriNetUnfolder]: 435/973 cut-off events. [2023-09-01 04:26:34,477 INFO L131 PetriNetUnfolder]: For 181/181 co-relation queries the response was YES. [2023-09-01 04:26:34,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1883 conditions, 973 events. 435/973 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4753 event pairs, 69 based on Foata normal form. 36/938 useless extension candidates. Maximal degree in co-relation 1877. Up to 180 conditions per place. [2023-09-01 04:26:34,483 INFO L137 encePairwiseOnDemand]: 271/275 looper letters, 57 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2023-09-01 04:26:34,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 71 transitions, 323 flow [2023-09-01 04:26:34,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 04:26:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 04:26:34,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 705 transitions. [2023-09-01 04:26:34,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5127272727272727 [2023-09-01 04:26:34,487 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 705 transitions. [2023-09-01 04:26:34,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 705 transitions. [2023-09-01 04:26:34,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:26:34,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 705 transitions. [2023-09-01 04:26:34,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.0) internal successors, (705), 5 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:34,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:34,492 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:34,492 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 88 flow. Second operand 5 states and 705 transitions. [2023-09-01 04:26:34,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 71 transitions, 323 flow [2023-09-01 04:26:34,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 71 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 04:26:34,497 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 116 flow [2023-09-01 04:26:34,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-09-01 04:26:34,499 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2023-09-01 04:26:34,499 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 116 flow [2023-09-01 04:26:34,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 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-09-01 04:26:34,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:26:34,500 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:26:34,517 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-09-01 04:26:34,716 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-09-01 04:26:34,717 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:26:34,718 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:26:34,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1197724531, now seen corresponding path program 1 times [2023-09-01 04:26:34,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 04:26:34,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311995144] [2023-09-01 04:26:34,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:26:34,719 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-09-01 04:26:34,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 04:26:34,720 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-09-01 04:26:34,722 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-09-01 04:26:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:26:34,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 04:26:34,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:26:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-09-01 04:26:34,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:26:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-09-01 04:26:34,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 04:26:34,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311995144] [2023-09-01 04:26:34,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311995144] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:26:34,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-09-01 04:26:34,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-09-01 04:26:34,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755279084] [2023-09-01 04:26:34,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-09-01 04:26:34,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 04:26:34,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 04:26:34,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 04:26:34,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-09-01 04:26:34,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 275 [2023-09-01 04:26:34,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 116 flow. Second operand has 8 states, 8 states have (on average 129.375) internal successors, (1035), 8 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:34,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:26:34,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 275 [2023-09-01 04:26:34,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:26:35,427 INFO L130 PetriNetUnfolder]: 920/1616 cut-off events. [2023-09-01 04:26:35,427 INFO L131 PetriNetUnfolder]: For 512/512 co-relation queries the response was YES. [2023-09-01 04:26:35,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3717 conditions, 1616 events. 920/1616 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6959 event pairs, 213 based on Foata normal form. 0/1543 useless extension candidates. Maximal degree in co-relation 3709. Up to 659 conditions per place. [2023-09-01 04:26:35,434 INFO L137 encePairwiseOnDemand]: 266/275 looper letters, 87 selfloop transitions, 13 changer transitions 4/107 dead transitions. [2023-09-01 04:26:35,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 107 transitions, 549 flow [2023-09-01 04:26:35,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 04:26:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 04:26:35,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1092 transitions. [2023-09-01 04:26:35,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49636363636363634 [2023-09-01 04:26:35,439 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1092 transitions. [2023-09-01 04:26:35,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1092 transitions. [2023-09-01 04:26:35,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:26:35,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1092 transitions. [2023-09-01 04:26:35,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 136.5) internal successors, (1092), 8 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:35,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 275.0) internal successors, (2475), 9 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:35,450 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 275.0) internal successors, (2475), 9 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:35,450 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 116 flow. Second operand 8 states and 1092 transitions. [2023-09-01 04:26:35,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 107 transitions, 549 flow [2023-09-01 04:26:35,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 107 transitions, 533 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-09-01 04:26:35,457 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 224 flow [2023-09-01 04:26:35,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=224, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2023-09-01 04:26:35,458 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2023-09-01 04:26:35,458 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 224 flow [2023-09-01 04:26:35,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 129.375) internal successors, (1035), 8 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:35,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:26:35,459 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:26:35,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 (10)] Forceful destruction successful, exit code 0 [2023-09-01 04:26:35,669 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-09-01 04:26:35,669 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:26:35,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:26:35,670 INFO L85 PathProgramCache]: Analyzing trace with hash 373370299, now seen corresponding path program 2 times [2023-09-01 04:26:35,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 04:26:35,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481695183] [2023-09-01 04:26:35,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 04:26:35,670 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-09-01 04:26:35,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 04:26:35,673 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-09-01 04:26:35,683 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-09-01 04:26:35,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 04:26:35,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 04:26:35,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 04:26:35,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:26:35,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-09-01 04:26:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-09-01 04:26:35,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 04:26:35,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 04:26:35,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [481695183] [2023-09-01 04:26:35,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [481695183] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:26:35,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:26:35,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 04:26:35,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300103947] [2023-09-01 04:26:35,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:26:35,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:26:35,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 04:26:35,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:26:35,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:26:35,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 275 [2023-09-01 04:26:35,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:35,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:26:35,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 275 [2023-09-01 04:26:35,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:26:36,053 INFO L130 PetriNetUnfolder]: 339/787 cut-off events. [2023-09-01 04:26:36,054 INFO L131 PetriNetUnfolder]: For 773/773 co-relation queries the response was YES. [2023-09-01 04:26:36,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2197 conditions, 787 events. 339/787 cut-off events. For 773/773 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3528 event pairs, 99 based on Foata normal form. 82/868 useless extension candidates. Maximal degree in co-relation 2182. Up to 326 conditions per place. [2023-09-01 04:26:36,060 INFO L137 encePairwiseOnDemand]: 267/275 looper letters, 30 selfloop transitions, 11 changer transitions 0/54 dead transitions. [2023-09-01 04:26:36,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 320 flow [2023-09-01 04:26:36,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:26:36,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:26:36,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-09-01 04:26:36,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49696969696969695 [2023-09-01 04:26:36,062 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-09-01 04:26:36,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-09-01 04:26:36,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:26:36,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-09-01 04:26:36,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:36,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:36,066 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:36,066 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 224 flow. Second operand 3 states and 410 transitions. [2023-09-01 04:26:36,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 320 flow [2023-09-01 04:26:36,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 54 transitions, 310 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-09-01 04:26:36,071 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 198 flow [2023-09-01 04:26:36,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2023-09-01 04:26:36,071 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2023-09-01 04:26:36,072 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 198 flow [2023-09-01 04:26:36,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:36,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:26:36,072 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:26:36,085 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-09-01 04:26:36,283 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-09-01 04:26:36,283 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:26:36,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:26:36,284 INFO L85 PathProgramCache]: Analyzing trace with hash 918995859, now seen corresponding path program 2 times [2023-09-01 04:26:36,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 04:26:36,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830476374] [2023-09-01 04:26:36,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 04:26:36,285 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-09-01 04:26:36,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 04:26:36,286 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-09-01 04:26:36,289 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-09-01 04:26:36,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-09-01 04:26:36,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 04:26:36,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2023-09-01 04:26:36,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:26:36,784 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-09-01 04:26:36,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 04:26:36,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 04:26:36,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830476374] [2023-09-01 04:26:36,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830476374] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:26:36,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:26:36,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 04:26:36,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565913445] [2023-09-01 04:26:36,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:26:36,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:26:36,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 04:26:36,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:26:36,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:26:36,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 275 [2023-09-01 04:26:36,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:36,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:26:36,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 275 [2023-09-01 04:26:36,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:26:37,066 INFO L130 PetriNetUnfolder]: 282/670 cut-off events. [2023-09-01 04:26:37,066 INFO L131 PetriNetUnfolder]: For 563/573 co-relation queries the response was YES. [2023-09-01 04:26:37,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1980 conditions, 670 events. 282/670 cut-off events. For 563/573 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2904 event pairs, 196 based on Foata normal form. 2/657 useless extension candidates. Maximal degree in co-relation 1967. Up to 487 conditions per place. [2023-09-01 04:26:37,071 INFO L137 encePairwiseOnDemand]: 273/275 looper letters, 25 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-09-01 04:26:37,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 41 transitions, 248 flow [2023-09-01 04:26:37,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:26:37,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:26:37,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2023-09-01 04:26:37,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47393939393939394 [2023-09-01 04:26:37,074 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 391 transitions. [2023-09-01 04:26:37,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 391 transitions. [2023-09-01 04:26:37,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:26:37,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 391 transitions. [2023-09-01 04:26:37,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:37,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:37,077 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:37,077 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 198 flow. Second operand 3 states and 391 transitions. [2023-09-01 04:26:37,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 41 transitions, 248 flow [2023-09-01 04:26:37,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 41 transitions, 237 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 04:26:37,080 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 187 flow [2023-09-01 04:26:37,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=187, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-09-01 04:26:37,081 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2023-09-01 04:26:37,081 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 187 flow [2023-09-01 04:26:37,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:37,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:26:37,082 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:26:37,094 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 (12)] Forceful destruction successful, exit code 0 [2023-09-01 04:26:37,291 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-09-01 04:26:37,291 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:26:37,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:26:37,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1316237347, now seen corresponding path program 3 times [2023-09-01 04:26:37,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 04:26:37,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283484245] [2023-09-01 04:26:37,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 04:26:37,292 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-09-01 04:26:37,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 04:26:37,294 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-09-01 04:26:37,297 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-09-01 04:26:37,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-09-01 04:26:37,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 04:26:37,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core [2023-09-01 04:26:37,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:26:37,531 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-09-01 04:26:37,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:26:37,629 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-09-01 04:26:37,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 04:26:37,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283484245] [2023-09-01 04:26:37,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283484245] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:26:37,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-09-01 04:26:37,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-09-01 04:26:37,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767308508] [2023-09-01 04:26:37,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-09-01 04:26:37,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-09-01 04:26:37,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 04:26:37,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-09-01 04:26:37,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-09-01 04:26:37,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 275 [2023-09-01 04:26:37,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 187 flow. Second operand has 10 states, 10 states have (on average 127.1) internal successors, (1271), 10 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:37,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:26:37,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 275 [2023-09-01 04:26:37,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:26:38,167 INFO L130 PetriNetUnfolder]: 447/896 cut-off events. [2023-09-01 04:26:38,168 INFO L131 PetriNetUnfolder]: For 776/776 co-relation queries the response was YES. [2023-09-01 04:26:38,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2644 conditions, 896 events. 447/896 cut-off events. For 776/776 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3311 event pairs, 130 based on Foata normal form. 44/940 useless extension candidates. Maximal degree in co-relation 2630. Up to 349 conditions per place. [2023-09-01 04:26:38,173 INFO L137 encePairwiseOnDemand]: 264/275 looper letters, 68 selfloop transitions, 13 changer transitions 0/83 dead transitions. [2023-09-01 04:26:38,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 83 transitions, 517 flow [2023-09-01 04:26:38,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 04:26:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 04:26:38,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1043 transitions. [2023-09-01 04:26:38,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4740909090909091 [2023-09-01 04:26:38,177 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1043 transitions. [2023-09-01 04:26:38,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1043 transitions. [2023-09-01 04:26:38,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:26:38,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1043 transitions. [2023-09-01 04:26:38,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 130.375) internal successors, (1043), 8 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:38,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 275.0) internal successors, (2475), 9 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:38,186 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 275.0) internal successors, (2475), 9 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:38,186 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 187 flow. Second operand 8 states and 1043 transitions. [2023-09-01 04:26:38,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 83 transitions, 517 flow [2023-09-01 04:26:38,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 83 transitions, 516 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 04:26:38,191 INFO L231 Difference]: Finished difference. Result has 61 places, 41 transitions, 228 flow [2023-09-01 04:26:38,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=228, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2023-09-01 04:26:38,192 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2023-09-01 04:26:38,193 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 228 flow [2023-09-01 04:26:38,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 127.1) internal successors, (1271), 10 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:38,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:26:38,194 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:26:38,204 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-09-01 04:26:38,404 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-09-01 04:26:38,404 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:26:38,404 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:26:38,404 INFO L85 PathProgramCache]: Analyzing trace with hash -84794677, now seen corresponding path program 4 times [2023-09-01 04:26:38,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 04:26:38,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686945765] [2023-09-01 04:26:38,405 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-01 04:26:38,405 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-09-01 04:26:38,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 04:26:38,406 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-09-01 04:26:38,407 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-09-01 04:26:38,523 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-01 04:26:38,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 04:26:38,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 04:26:38,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:26:38,576 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:26:38,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:26:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:26:38,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 04:26:38,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686945765] [2023-09-01 04:26:38,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686945765] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:26:38,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-09-01 04:26:38,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-09-01 04:26:38,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205862852] [2023-09-01 04:26:38,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-09-01 04:26:38,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 04:26:38,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 04:26:38,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 04:26:38,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-09-01 04:26:38,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 275 [2023-09-01 04:26:38,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 41 transitions, 228 flow. Second operand has 8 states, 8 states have (on average 134.25) internal successors, (1074), 8 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:38,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:26:38,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 275 [2023-09-01 04:26:38,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:26:39,037 INFO L130 PetriNetUnfolder]: 370/926 cut-off events. [2023-09-01 04:26:39,037 INFO L131 PetriNetUnfolder]: For 1062/1064 co-relation queries the response was YES. [2023-09-01 04:26:39,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2883 conditions, 926 events. 370/926 cut-off events. For 1062/1064 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3866 event pairs, 93 based on Foata normal form. 38/960 useless extension candidates. Maximal degree in co-relation 2867. Up to 157 conditions per place. [2023-09-01 04:26:39,046 INFO L137 encePairwiseOnDemand]: 271/275 looper letters, 62 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2023-09-01 04:26:39,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 83 transitions, 579 flow [2023-09-01 04:26:39,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 04:26:39,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 04:26:39,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 836 transitions. [2023-09-01 04:26:39,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667 [2023-09-01 04:26:39,049 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 836 transitions. [2023-09-01 04:26:39,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 836 transitions. [2023-09-01 04:26:39,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:26:39,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 836 transitions. [2023-09-01 04:26:39,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.33333333333334) internal successors, (836), 6 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:39,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:39,054 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:39,054 INFO L175 Difference]: Start difference. First operand has 61 places, 41 transitions, 228 flow. Second operand 6 states and 836 transitions. [2023-09-01 04:26:39,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 83 transitions, 579 flow [2023-09-01 04:26:39,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 83 transitions, 537 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-09-01 04:26:39,059 INFO L231 Difference]: Finished difference. Result has 62 places, 44 transitions, 243 flow [2023-09-01 04:26:39,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=62, PETRI_TRANSITIONS=44} [2023-09-01 04:26:39,060 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2023-09-01 04:26:39,060 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 44 transitions, 243 flow [2023-09-01 04:26:39,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 134.25) internal successors, (1074), 8 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:26:39,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:26:39,061 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:26:39,072 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-09-01 04:26:39,272 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-09-01 04:26:39,272 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-09-01 04:26:39,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:26:39,273 INFO L85 PathProgramCache]: Analyzing trace with hash -202895433, now seen corresponding path program 5 times [2023-09-01 04:26:39,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 04:26:39,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516398733] [2023-09-01 04:26:39,273 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-09-01 04:26:39,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-09-01 04:26:39,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 04:26:39,275 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-09-01 04:26:39,276 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-09-01 04:26:39,431 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-09-01 04:26:39,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-09-01 04:26:39,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 04:26:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 04:26:39,561 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-09-01 04:26:39,561 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 04:26:39,562 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (11 of 12 remaining) [2023-09-01 04:26:39,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-09-01 04:26:39,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-09-01 04:26:39,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-09-01 04:26:39,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-09-01 04:26:39,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-09-01 04:26:39,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-09-01 04:26:39,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-09-01 04:26:39,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 12 remaining) [2023-09-01 04:26:39,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (2 of 12 remaining) [2023-09-01 04:26:39,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-09-01 04:26:39,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 12 remaining) [2023-09-01 04:26:39,609 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-09-01 04:26:39,793 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-09-01 04:26:39,793 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:26:39,797 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 04:26:39,798 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 04:26:39,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 04:26:39 BasicIcfg [2023-09-01 04:26:39,886 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 04:26:39,887 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 04:26:39,887 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 04:26:39,887 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 04:26:39,887 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 04:26:07" (3/4) ... [2023-09-01 04:26:39,890 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-09-01 04:26:39,890 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 04:26:39,891 INFO L158 Benchmark]: Toolchain (without parser) took 34116.62ms. Allocated memory was 69.2MB in the beginning and 104.9MB in the end (delta: 35.7MB). Free memory was 39.3MB in the beginning and 35.0MB in the end (delta: 4.4MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2023-09-01 04:26:39,891 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 50.3MB. Free memory was 28.6MB in the beginning and 28.6MB in the end (delta: 54.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 04:26:39,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 628.30ms. Allocated memory is still 69.2MB. Free memory was 39.1MB in the beginning and 32.1MB in the end (delta: 7.0MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2023-09-01 04:26:39,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.18ms. Allocated memory is still 69.2MB. Free memory was 32.1MB in the beginning and 29.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 04:26:39,892 INFO L158 Benchmark]: Boogie Preprocessor took 43.38ms. Allocated memory is still 69.2MB. Free memory was 29.7MB in the beginning and 47.5MB in the end (delta: -17.8MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2023-09-01 04:26:39,893 INFO L158 Benchmark]: RCFGBuilder took 621.83ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 47.5MB in the beginning and 63.1MB in the end (delta: -15.7MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2023-09-01 04:26:39,893 INFO L158 Benchmark]: TraceAbstraction took 32752.12ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 62.2MB in the beginning and 35.0MB in the end (delta: 27.2MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2023-09-01 04:26:39,893 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 104.9MB. Free memory is still 35.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 04:26:39,895 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 50.3MB. Free memory was 28.6MB in the beginning and 28.6MB in the end (delta: 54.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 628.30ms. Allocated memory is still 69.2MB. Free memory was 39.1MB in the beginning and 32.1MB in the end (delta: 7.0MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.18ms. Allocated memory is still 69.2MB. Free memory was 32.1MB in the beginning and 29.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.38ms. Allocated memory is still 69.2MB. Free memory was 29.7MB in the beginning and 47.5MB in the end (delta: -17.8MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. * RCFGBuilder took 621.83ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 47.5MB in the beginning and 63.1MB in the end (delta: -15.7MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * TraceAbstraction took 32752.12ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 62.2MB in the beginning and 35.0MB in the end (delta: 27.2MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 104.9MB. Free memory is still 35.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: 22.4s, 135 PlacesBefore, 42 PlacesAfterwards, 138 TransitionsBefore, 40 TransitionsAfterwards, 2314 CoEnabledTransitionPairs, 7 FixpointIterations, 73 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 8 ConcurrentYvCompositions, 5 ChoiceCompositions, 131 TotalNumberOfCompositions, 5425 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3243, independent: 3077, independent conditional: 0, independent unconditional: 3077, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1187, independent: 1163, independent conditional: 0, independent unconditional: 1163, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3243, independent: 1914, independent conditional: 0, independent unconditional: 1914, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 1187, unknown conditional: 0, unknown unconditional: 1187] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 158, Positive conditional cache size: 0, Positive unconditional cache size: 158, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 919]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 919. Possible FailurePath: [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; [L908] 0 num = 0 [L909] 0 total = 0 [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, pthread_create(&t1, 0, thread1, 0)=-1, t1={7:0}, t2={15:0}, total=0] [L876] 1 int i; [L877] 1 i = 0 VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, pthread_create(&t2, 0, thread2, 0)=0, t1={7:0}, t2={15:0}, total=0] [L878] COND TRUE 1 i < 3 [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L882] 1 num++ [L915] 0 \read(t1) VAL [\read(t1)=-1, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=1, t1={7:0}, t2={15:0}, total=0] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, m={3:0}, num=1, total=0] [L890] 2 int j; [L891] 2 j = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L897] 2 num-- [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L882] 1 num++ [L892] COND TRUE 2 j < 3 [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=1, total=1] [L897] 2 num-- [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L878] COND TRUE 1 i < 3 [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L882] 1 num++ [L892] COND TRUE 2 j < 3 [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=3] [L897] 2 num-- VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num--=1, num=0, total=3] [L878] COND FALSE 1 !(i < 3) [L887] 1 return ((void *)0); [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=-1, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num--=1, num=0, t1={7:0}, t2={15:0}, total=3] [L916] 0 \read(t2) VAL [\read(t2)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num--=1, num=0, t1={7:0}, t2={15:0}, total=3] [L900] 2 j++ VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) [L902] 2 total = total + j [L903] 2 flag = 1 [L904] 2 return ((void *)0); [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\read(t2)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={15:0}, total=6] [L917] COND TRUE 0 \read(flag) [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) [L919] 0 reach_error() VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={15:0}, total=6] - 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: 906]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 914]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 913]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 180 locations, 12 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: 32.5s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 22.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 838 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 555 mSDsluCounter, 106 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1449 IncrementalHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 74 mSDtfsCounter, 1449 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 384 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243occurred in iteration=13, InterpolantAutomatonStates: 53, 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.2s InterpolantComputationTime, 304 NumberOfCodeBlocks, 278 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 378 ConstructedInterpolants, 35 QuantifiedInterpolants, 1719 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1711 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 149/193 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-09-01 04:26:39,929 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