./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe018_power.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe018_power.opt.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 81ed16bb51b8da596bb3c9a2024b72d3baf359b31125524126025207d822fe2c --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 03:13:35,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 03:13:35,920 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 03:13:35,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 03:13:35,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 03:13:35,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 03:13:35,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 03:13:35,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 03:13:35,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 03:13:35,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 03:13:35,968 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 03:13:35,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 03:13:35,970 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 03:13:35,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 03:13:35,972 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 03:13:35,974 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 03:13:35,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 03:13:35,978 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 03:13:35,979 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 03:13:35,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 03:13:35,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 03:13:35,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 03:13:35,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 03:13:35,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 03:13:35,992 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 03:13:35,992 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 03:13:35,992 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 03:13:35,993 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 03:13:35,994 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 03:13:35,995 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 03:13:35,995 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 03:13:35,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 03:13:35,996 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 03:13:35,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 03:13:35,997 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 03:13:35,998 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 03:13:35,998 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 03:13:35,998 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 03:13:35,998 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 03:13:35,999 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 03:13:35,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 03:13:36,004 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 03:13:36,036 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 03:13:36,036 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 03:13:36,037 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 03:13:36,037 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 03:13:36,038 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 03:13:36,038 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 03:13:36,039 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 03:13:36,039 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 03:13:36,039 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 03:13:36,039 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 03:13:36,040 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 03:13:36,040 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 03:13:36,040 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 03:13:36,040 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 03:13:36,040 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 03:13:36,041 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 03:13:36,041 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 03:13:36,041 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 03:13:36,041 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 03:13:36,041 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 03:13:36,041 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 03:13:36,041 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 03:13:36,041 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 03:13:36,042 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 03:13:36,042 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 03:13:36,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:13:36,042 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 03:13:36,042 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 03:13:36,042 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 03:13:36,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 03:13:36,043 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 03:13:36,043 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 03:13:36,043 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 03:13:36,043 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 03:13:36,043 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 -> 81ed16bb51b8da596bb3c9a2024b72d3baf359b31125524126025207d822fe2c Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 03:13:36,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 03:13:36,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 03:13:36,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 03:13:36,322 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 03:13:36,322 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 03:13:36,323 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_power.opt.i [2023-08-30 03:13:37,356 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 03:13:37,570 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 03:13:37,571 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_power.opt.i [2023-08-30 03:13:37,581 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42785c7f1/67f706f8802f4e71a6863adb012232d8/FLAG6cc8e6d75 [2023-08-30 03:13:37,593 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42785c7f1/67f706f8802f4e71a6863adb012232d8 [2023-08-30 03:13:37,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 03:13:37,596 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 03:13:37,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 03:13:37,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 03:13:37,604 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 03:13:37,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:13:37" (1/1) ... [2023-08-30 03:13:37,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408c860d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:37, skipping insertion in model container [2023-08-30 03:13:37,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:13:37" (1/1) ... [2023-08-30 03:13:37,612 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 03:13:37,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 03:13:37,764 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-wmm/safe018_power.opt.i[994,1007] [2023-08-30 03:13:38,022 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:13:38,038 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 03:13:38,051 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-wmm/safe018_power.opt.i[994,1007] [2023-08-30 03:13:38,141 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:13:38,182 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:13:38,183 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:13:38,189 INFO L208 MainTranslator]: Completed translation [2023-08-30 03:13:38,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:38 WrapperNode [2023-08-30 03:13:38,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 03:13:38,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 03:13:38,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 03:13:38,191 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 03:13:38,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:38" (1/1) ... [2023-08-30 03:13:38,228 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:38" (1/1) ... [2023-08-30 03:13:38,266 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 178 [2023-08-30 03:13:38,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 03:13:38,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 03:13:38,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 03:13:38,268 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 03:13:38,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:38" (1/1) ... [2023-08-30 03:13:38,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:38" (1/1) ... [2023-08-30 03:13:38,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:38" (1/1) ... [2023-08-30 03:13:38,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:38" (1/1) ... [2023-08-30 03:13:38,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:38" (1/1) ... [2023-08-30 03:13:38,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:38" (1/1) ... [2023-08-30 03:13:38,321 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:38" (1/1) ... [2023-08-30 03:13:38,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:38" (1/1) ... [2023-08-30 03:13:38,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 03:13:38,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 03:13:38,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 03:13:38,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 03:13:38,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:38" (1/1) ... [2023-08-30 03:13:38,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:13:38,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 03:13:38,361 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 03:13:38,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 03:13:38,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 03:13:38,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 03:13:38,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 03:13:38,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 03:13:38,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 03:13:38,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 03:13:38,400 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 03:13:38,400 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 03:13:38,400 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 03:13:38,400 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 03:13:38,400 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 03:13:38,400 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 03:13:38,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 03:13:38,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 03:13:38,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 03:13:38,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 03:13:38,402 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 03:13:38,566 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 03:13:38,581 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 03:13:39,135 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 03:13:39,602 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 03:13:39,602 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 03:13:39,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:13:39 BoogieIcfgContainer [2023-08-30 03:13:39,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 03:13:39,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 03:13:39,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 03:13:39,608 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 03:13:39,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 03:13:37" (1/3) ... [2023-08-30 03:13:39,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c1d55c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:13:39, skipping insertion in model container [2023-08-30 03:13:39,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:13:38" (2/3) ... [2023-08-30 03:13:39,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c1d55c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:13:39, skipping insertion in model container [2023-08-30 03:13:39,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:13:39" (3/3) ... [2023-08-30 03:13:39,610 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_power.opt.i [2023-08-30 03:13:39,622 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 03:13:39,622 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 51 error locations. [2023-08-30 03:13:39,622 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 03:13:39,732 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 03:13:39,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 177 transitions, 369 flow [2023-08-30 03:13:39,813 INFO L130 PetriNetUnfolder]: 2/174 cut-off events. [2023-08-30 03:13:39,813 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:13:39,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 174 events. 2/174 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 292 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2023-08-30 03:13:39,818 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 177 transitions, 369 flow [2023-08-30 03:13:39,822 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 174 transitions, 357 flow [2023-08-30 03:13:39,824 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 03:13:39,830 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 174 transitions, 357 flow [2023-08-30 03:13:39,832 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 174 transitions, 357 flow [2023-08-30 03:13:39,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 174 transitions, 357 flow [2023-08-30 03:13:39,859 INFO L130 PetriNetUnfolder]: 2/174 cut-off events. [2023-08-30 03:13:39,859 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:13:39,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 174 events. 2/174 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 290 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2023-08-30 03:13:39,863 INFO L119 LiptonReduction]: Number of co-enabled transitions 7064 [2023-08-30 03:13:48,317 INFO L134 LiptonReduction]: Checked pairs total: 40932 [2023-08-30 03:13:48,324 INFO L136 LiptonReduction]: Total number of compositions: 143 [2023-08-30 03:13:48,342 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 03:13:48,348 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;@32dca3b6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 03:13:48,348 INFO L358 AbstractCegarLoop]: Starting to check reachability of 91 error locations. [2023-08-30 03:13:48,350 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 03:13:48,350 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:13:48,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:48,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 03:13:48,352 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:13:48,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:48,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1191, now seen corresponding path program 1 times [2023-08-30 03:13:48,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:13:48,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087258490] [2023-08-30 03:13:48,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:48,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:13:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:48,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:48,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:13:48,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087258490] [2023-08-30 03:13:48,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087258490] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:48,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:48,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 03:13:48,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033671099] [2023-08-30 03:13:48,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:48,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 03:13:48,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:13:48,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 03:13:48,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 03:13:48,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 320 [2023-08-30 03:13:48,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 77 transitions, 163 flow. Second operand has 2 states, 2 states have (on average 121.5) internal successors, (243), 2 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:48,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:48,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 320 [2023-08-30 03:13:48,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:52,128 INFO L130 PetriNetUnfolder]: 20995/29870 cut-off events. [2023-08-30 03:13:52,128 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2023-08-30 03:13:52,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59273 conditions, 29870 events. 20995/29870 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 2453. Compared 203391 event pairs, 20995 based on Foata normal form. 540/13016 useless extension candidates. Maximal degree in co-relation 59262. Up to 29277 conditions per place. [2023-08-30 03:13:52,320 INFO L137 encePairwiseOnDemand]: 289/320 looper letters, 44 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2023-08-30 03:13:52,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 189 flow [2023-08-30 03:13:52,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 03:13:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 03:13:52,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 317 transitions. [2023-08-30 03:13:52,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4953125 [2023-08-30 03:13:52,334 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 317 transitions. [2023-08-30 03:13:52,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 317 transitions. [2023-08-30 03:13:52,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:52,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 317 transitions. [2023-08-30 03:13:52,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 158.5) internal successors, (317), 2 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:52,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 320.0) internal successors, (960), 3 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:52,344 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 320.0) internal successors, (960), 3 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:52,345 INFO L175 Difference]: Start difference. First operand has 86 places, 77 transitions, 163 flow. Second operand 2 states and 317 transitions. [2023-08-30 03:13:52,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 189 flow [2023-08-30 03:13:52,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 46 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 03:13:52,350 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 98 flow [2023-08-30 03:13:52,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2023-08-30 03:13:52,354 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -32 predicate places. [2023-08-30 03:13:52,354 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 98 flow [2023-08-30 03:13:52,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 121.5) internal successors, (243), 2 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:52,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:52,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-30 03:13:52,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 03:13:52,358 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:13:52,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:52,364 INFO L85 PathProgramCache]: Analyzing trace with hash 36460368, now seen corresponding path program 1 times [2023-08-30 03:13:52,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:13:52,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212982072] [2023-08-30 03:13:52,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:52,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:13:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:52,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:52,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:13:52,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212982072] [2023-08-30 03:13:52,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212982072] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:52,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:52,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:13:52,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837002695] [2023-08-30 03:13:52,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:52,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:13:52,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:13:52,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:13:52,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:13:52,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 320 [2023-08-30 03:13:52,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:52,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:52,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 320 [2023-08-30 03:13:52,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:55,285 INFO L130 PetriNetUnfolder]: 14203/20820 cut-off events. [2023-08-30 03:13:55,285 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:13:55,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41439 conditions, 20820 events. 14203/20820 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1336. Compared 138072 event pairs, 9159 based on Foata normal form. 0/11194 useless extension candidates. Maximal degree in co-relation 41436. Up to 12837 conditions per place. [2023-08-30 03:13:55,354 INFO L137 encePairwiseOnDemand]: 303/320 looper letters, 53 selfloop transitions, 9 changer transitions 0/63 dead transitions. [2023-08-30 03:13:55,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 256 flow [2023-08-30 03:13:55,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:13:55,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:13:55,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-30 03:13:55,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43854166666666666 [2023-08-30 03:13:55,357 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-30 03:13:55,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-30 03:13:55,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:55,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-30 03:13:55,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:55,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 320.0) internal successors, (1280), 4 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:55,360 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 320.0) internal successors, (1280), 4 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:55,360 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 98 flow. Second operand 3 states and 421 transitions. [2023-08-30 03:13:55,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 256 flow [2023-08-30 03:13:55,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 256 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:13:55,362 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 170 flow [2023-08-30 03:13:55,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2023-08-30 03:13:55,363 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -30 predicate places. [2023-08-30 03:13:55,363 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 170 flow [2023-08-30 03:13:55,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:55,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:55,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-30 03:13:55,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 03:13:55,364 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:13:55,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:55,364 INFO L85 PathProgramCache]: Analyzing trace with hash 36460369, now seen corresponding path program 1 times [2023-08-30 03:13:55,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:13:55,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503972955] [2023-08-30 03:13:55,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:55,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:13:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:55,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:13:55,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503972955] [2023-08-30 03:13:55,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503972955] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:55,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:55,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:13:55,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641978957] [2023-08-30 03:13:55,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:55,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:13:55,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:13:55,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:13:55,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:13:55,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 320 [2023-08-30 03:13:55,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:55,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:55,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 320 [2023-08-30 03:13:55,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:56,205 INFO L130 PetriNetUnfolder]: 4608/7201 cut-off events. [2023-08-30 03:13:56,205 INFO L131 PetriNetUnfolder]: For 1991/1991 co-relation queries the response was YES. [2023-08-30 03:13:56,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18993 conditions, 7201 events. 4608/7201 cut-off events. For 1991/1991 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 44706 event pairs, 3700 based on Foata normal form. 1577/7376 useless extension candidates. Maximal degree in co-relation 18988. Up to 6686 conditions per place. [2023-08-30 03:13:56,241 INFO L137 encePairwiseOnDemand]: 311/320 looper letters, 39 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2023-08-30 03:13:56,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 43 transitions, 234 flow [2023-08-30 03:13:56,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:13:56,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:13:56,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-08-30 03:13:56,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2023-08-30 03:13:56,243 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-08-30 03:13:56,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-08-30 03:13:56,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:56,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-08-30 03:13:56,245 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-08-30 03:13:56,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 320.0) internal successors, (1280), 4 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:56,247 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 320.0) internal successors, (1280), 4 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:56,247 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 170 flow. Second operand 3 states and 402 transitions. [2023-08-30 03:13:56,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 43 transitions, 234 flow [2023-08-30 03:13:56,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 43 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:13:56,258 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 138 flow [2023-08-30 03:13:56,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2023-08-30 03:13:56,259 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -38 predicate places. [2023-08-30 03:13:56,259 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 138 flow [2023-08-30 03:13:56,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:56,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:56,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 03:13:56,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 03:13:56,260 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:13:56,261 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:56,261 INFO L85 PathProgramCache]: Analyzing trace with hash 680190564, now seen corresponding path program 1 times [2023-08-30 03:13:56,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:13:56,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643421312] [2023-08-30 03:13:56,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:56,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:13:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:56,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:56,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:13:56,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643421312] [2023-08-30 03:13:56,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643421312] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:56,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:56,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:13:56,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487743098] [2023-08-30 03:13:56,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:56,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:13:56,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:13:56,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:13:56,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:13:56,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 320 [2023-08-30 03:13:56,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:56,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:56,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 320 [2023-08-30 03:13:56,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:57,226 INFO L130 PetriNetUnfolder]: 3788/5905 cut-off events. [2023-08-30 03:13:57,227 INFO L131 PetriNetUnfolder]: For 749/761 co-relation queries the response was YES. [2023-08-30 03:13:57,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14908 conditions, 5905 events. 3788/5905 cut-off events. For 749/761 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 36282 event pairs, 1072 based on Foata normal form. 12/4464 useless extension candidates. Maximal degree in co-relation 14903. Up to 4782 conditions per place. [2023-08-30 03:13:57,251 INFO L137 encePairwiseOnDemand]: 317/320 looper letters, 63 selfloop transitions, 2 changer transitions 2/70 dead transitions. [2023-08-30 03:13:57,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 70 transitions, 358 flow [2023-08-30 03:13:57,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:13:57,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:13:57,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-08-30 03:13:57,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.434375 [2023-08-30 03:13:57,253 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-08-30 03:13:57,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-08-30 03:13:57,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:57,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-08-30 03:13:57,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:57,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 320.0) internal successors, (1280), 4 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:57,256 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 320.0) internal successors, (1280), 4 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:57,257 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 138 flow. Second operand 3 states and 417 transitions. [2023-08-30 03:13:57,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 70 transitions, 358 flow [2023-08-30 03:13:57,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 70 transitions, 357 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:13:57,258 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 137 flow [2023-08-30 03:13:57,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2023-08-30 03:13:57,259 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -38 predicate places. [2023-08-30 03:13:57,259 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 137 flow [2023-08-30 03:13:57,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:57,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:57,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:57,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 03:13:57,260 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:13:57,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:57,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1667800651, now seen corresponding path program 1 times [2023-08-30 03:13:57,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:13:57,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229189175] [2023-08-30 03:13:57,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:57,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:13:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:57,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:57,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:13:57,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229189175] [2023-08-30 03:13:57,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229189175] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:57,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:57,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:13:57,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535417802] [2023-08-30 03:13:57,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:57,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:13:57,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:13:57,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:13:57,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:13:57,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 320 [2023-08-30 03:13:57,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:57,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:57,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 320 [2023-08-30 03:13:57,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:58,155 INFO L130 PetriNetUnfolder]: 3580/5745 cut-off events. [2023-08-30 03:13:58,156 INFO L131 PetriNetUnfolder]: For 1033/1033 co-relation queries the response was YES. [2023-08-30 03:13:58,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14647 conditions, 5745 events. 3580/5745 cut-off events. For 1033/1033 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 35891 event pairs, 1224 based on Foata normal form. 0/4405 useless extension candidates. Maximal degree in co-relation 14642. Up to 4073 conditions per place. [2023-08-30 03:13:58,180 INFO L137 encePairwiseOnDemand]: 316/320 looper letters, 55 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2023-08-30 03:13:58,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 61 transitions, 319 flow [2023-08-30 03:13:58,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:13:58,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:13:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-08-30 03:13:58,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2023-08-30 03:13:58,182 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-08-30 03:13:58,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-08-30 03:13:58,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:58,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-08-30 03:13:58,184 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-08-30 03:13:58,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 320.0) internal successors, (1280), 4 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:58,186 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 320.0) internal successors, (1280), 4 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:58,186 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 137 flow. Second operand 3 states and 410 transitions. [2023-08-30 03:13:58,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 61 transitions, 319 flow [2023-08-30 03:13:58,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 61 transitions, 313 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:13:58,188 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 146 flow [2023-08-30 03:13:58,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2023-08-30 03:13:58,191 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -38 predicate places. [2023-08-30 03:13:58,191 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 146 flow [2023-08-30 03:13:58,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:58,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:58,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:58,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 03:13:58,192 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:13:58,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:58,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1667800987, now seen corresponding path program 1 times [2023-08-30 03:13:58,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:13:58,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354225026] [2023-08-30 03:13:58,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:58,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:13:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:58,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:58,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:13:58,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354225026] [2023-08-30 03:13:58,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354225026] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:58,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:58,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:13:58,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475225419] [2023-08-30 03:13:58,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:58,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:13:58,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:13:58,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:13:58,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:13:58,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 320 [2023-08-30 03:13:58,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:58,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:58,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 320 [2023-08-30 03:13:58,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:59,207 INFO L130 PetriNetUnfolder]: 3519/5512 cut-off events. [2023-08-30 03:13:59,207 INFO L131 PetriNetUnfolder]: For 1145/1157 co-relation queries the response was YES. [2023-08-30 03:13:59,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14641 conditions, 5512 events. 3519/5512 cut-off events. For 1145/1157 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 34322 event pairs, 1074 based on Foata normal form. 12/4354 useless extension candidates. Maximal degree in co-relation 14635. Up to 4449 conditions per place. [2023-08-30 03:13:59,257 INFO L137 encePairwiseOnDemand]: 317/320 looper letters, 66 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2023-08-30 03:13:59,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 388 flow [2023-08-30 03:13:59,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:13:59,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:13:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-30 03:13:59,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4322916666666667 [2023-08-30 03:13:59,271 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-30 03:13:59,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-30 03:13:59,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:59,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-30 03:13:59,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:59,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 320.0) internal successors, (1280), 4 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:59,274 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 320.0) internal successors, (1280), 4 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:59,274 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 146 flow. Second operand 3 states and 415 transitions. [2023-08-30 03:13:59,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 71 transitions, 388 flow [2023-08-30 03:13:59,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 71 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:13:59,276 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 148 flow [2023-08-30 03:13:59,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-08-30 03:13:59,282 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -37 predicate places. [2023-08-30 03:13:59,283 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 148 flow [2023-08-30 03:13:59,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:59,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:59,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:59,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 03:13:59,284 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:13:59,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:59,284 INFO L85 PathProgramCache]: Analyzing trace with hash 162221340, now seen corresponding path program 1 times [2023-08-30 03:13:59,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:13:59,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663349399] [2023-08-30 03:13:59,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:59,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:13:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:59,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:13:59,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663349399] [2023-08-30 03:13:59,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663349399] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:59,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:59,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:13:59,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12895972] [2023-08-30 03:13:59,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:59,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:13:59,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:13:59,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:13:59,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:13:59,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 320 [2023-08-30 03:13:59,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:59,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:59,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 320 [2023-08-30 03:13:59,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:00,698 INFO L130 PetriNetUnfolder]: 6012/9353 cut-off events. [2023-08-30 03:14:00,698 INFO L131 PetriNetUnfolder]: For 1610/1646 co-relation queries the response was YES. [2023-08-30 03:14:00,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25072 conditions, 9353 events. 6012/9353 cut-off events. For 1610/1646 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 59516 event pairs, 1586 based on Foata normal form. 92/7320 useless extension candidates. Maximal degree in co-relation 25065. Up to 3676 conditions per place. [2023-08-30 03:14:00,741 INFO L137 encePairwiseOnDemand]: 316/320 looper letters, 82 selfloop transitions, 3 changer transitions 0/87 dead transitions. [2023-08-30 03:14:00,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 87 transitions, 477 flow [2023-08-30 03:14:00,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:14:00,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:14:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 540 transitions. [2023-08-30 03:14:00,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2023-08-30 03:14:00,754 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 540 transitions. [2023-08-30 03:14:00,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 540 transitions. [2023-08-30 03:14:00,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:00,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 540 transitions. [2023-08-30 03:14:00,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:00,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 320.0) internal successors, (1600), 5 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:00,763 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 320.0) internal successors, (1600), 5 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:00,763 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 148 flow. Second operand 4 states and 540 transitions. [2023-08-30 03:14:00,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 87 transitions, 477 flow [2023-08-30 03:14:00,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 87 transitions, 471 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:14:00,773 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 163 flow [2023-08-30 03:14:00,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-08-30 03:14:00,777 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -34 predicate places. [2023-08-30 03:14:00,778 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 163 flow [2023-08-30 03:14:00,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:00,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:00,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:14:00,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 03:14:00,784 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:14:00,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:00,785 INFO L85 PathProgramCache]: Analyzing trace with hash 160263974, now seen corresponding path program 1 times [2023-08-30 03:14:00,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:00,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091597746] [2023-08-30 03:14:00,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:00,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:00,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:00,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:00,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091597746] [2023-08-30 03:14:00,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091597746] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:00,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:00,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:14:00,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530471227] [2023-08-30 03:14:00,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:00,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:14:00,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:00,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:14:00,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:14:01,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 320 [2023-08-30 03:14:01,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 163 flow. Second operand has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:01,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:01,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 320 [2023-08-30 03:14:01,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:02,039 INFO L130 PetriNetUnfolder]: 6288/9933 cut-off events. [2023-08-30 03:14:02,040 INFO L131 PetriNetUnfolder]: For 2440/2440 co-relation queries the response was YES. [2023-08-30 03:14:02,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27707 conditions, 9933 events. 6288/9933 cut-off events. For 2440/2440 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 67692 event pairs, 1008 based on Foata normal form. 0/7933 useless extension candidates. Maximal degree in co-relation 27698. Up to 6180 conditions per place. [2023-08-30 03:14:02,078 INFO L137 encePairwiseOnDemand]: 312/320 looper letters, 83 selfloop transitions, 15 changer transitions 0/99 dead transitions. [2023-08-30 03:14:02,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 99 transitions, 564 flow [2023-08-30 03:14:02,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:14:02,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:14:02,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 658 transitions. [2023-08-30 03:14:02,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41125 [2023-08-30 03:14:02,081 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 658 transitions. [2023-08-30 03:14:02,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 658 transitions. [2023-08-30 03:14:02,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:02,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 658 transitions. [2023-08-30 03:14:02,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:02,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 320.0) internal successors, (1920), 6 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:02,086 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 320.0) internal successors, (1920), 6 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:02,086 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 163 flow. Second operand 5 states and 658 transitions. [2023-08-30 03:14:02,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 99 transitions, 564 flow [2023-08-30 03:14:02,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 99 transitions, 557 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:14:02,095 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 259 flow [2023-08-30 03:14:02,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2023-08-30 03:14:02,095 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -31 predicate places. [2023-08-30 03:14:02,096 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 259 flow [2023-08-30 03:14:02,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:02,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:02,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:14:02,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 03:14:02,096 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:14:02,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:02,097 INFO L85 PathProgramCache]: Analyzing trace with hash 162221625, now seen corresponding path program 1 times [2023-08-30 03:14:02,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:02,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142254911] [2023-08-30 03:14:02,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:02,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:02,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:02,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142254911] [2023-08-30 03:14:02,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142254911] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:02,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:02,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:14:02,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225920089] [2023-08-30 03:14:02,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:02,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:14:02,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:02,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:14:02,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:14:02,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 320 [2023-08-30 03:14:02,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 259 flow. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:02,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:02,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 320 [2023-08-30 03:14:02,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:03,246 INFO L130 PetriNetUnfolder]: 5768/9329 cut-off events. [2023-08-30 03:14:03,246 INFO L131 PetriNetUnfolder]: For 5381/5381 co-relation queries the response was YES. [2023-08-30 03:14:03,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28359 conditions, 9329 events. 5768/9329 cut-off events. For 5381/5381 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 63540 event pairs, 2280 based on Foata normal form. 84/7533 useless extension candidates. Maximal degree in co-relation 28348. Up to 7493 conditions per place. [2023-08-30 03:14:03,281 INFO L137 encePairwiseOnDemand]: 317/320 looper letters, 59 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2023-08-30 03:14:03,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 454 flow [2023-08-30 03:14:03,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:14:03,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:14:03,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 522 transitions. [2023-08-30 03:14:03,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4078125 [2023-08-30 03:14:03,283 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 522 transitions. [2023-08-30 03:14:03,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 522 transitions. [2023-08-30 03:14:03,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:03,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 522 transitions. [2023-08-30 03:14:03,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:03,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 320.0) internal successors, (1600), 5 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:03,287 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 320.0) internal successors, (1600), 5 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:03,287 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 259 flow. Second operand 4 states and 522 transitions. [2023-08-30 03:14:03,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 454 flow [2023-08-30 03:14:03,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 449 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:14:03,363 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 260 flow [2023-08-30 03:14:03,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=260, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2023-08-30 03:14:03,364 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -30 predicate places. [2023-08-30 03:14:03,364 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 260 flow [2023-08-30 03:14:03,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:03,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:03,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:14:03,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 03:14:03,365 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:14:03,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:03,365 INFO L85 PathProgramCache]: Analyzing trace with hash 733959645, now seen corresponding path program 1 times [2023-08-30 03:14:03,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:03,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126104514] [2023-08-30 03:14:03,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:03,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:03,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:03,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:03,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126104514] [2023-08-30 03:14:03,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126104514] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:03,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:03,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:14:03,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526527821] [2023-08-30 03:14:03,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:03,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:14:03,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:03,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:14:03,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:14:03,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 320 [2023-08-30 03:14:03,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 260 flow. Second operand has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:03,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:03,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 320 [2023-08-30 03:14:03,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:04,320 INFO L130 PetriNetUnfolder]: 5258/8327 cut-off events. [2023-08-30 03:14:04,320 INFO L131 PetriNetUnfolder]: For 5927/5927 co-relation queries the response was YES. [2023-08-30 03:14:04,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25918 conditions, 8327 events. 5258/8327 cut-off events. For 5927/5927 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 53331 event pairs, 1718 based on Foata normal form. 16/6733 useless extension candidates. Maximal degree in co-relation 25907. Up to 3527 conditions per place. [2023-08-30 03:14:04,354 INFO L137 encePairwiseOnDemand]: 305/320 looper letters, 54 selfloop transitions, 19 changer transitions 0/74 dead transitions. [2023-08-30 03:14:04,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 512 flow [2023-08-30 03:14:04,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:14:04,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:14:04,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions. [2023-08-30 03:14:04,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39765625 [2023-08-30 03:14:04,356 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 509 transitions. [2023-08-30 03:14:04,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 509 transitions. [2023-08-30 03:14:04,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:04,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 509 transitions. [2023-08-30 03:14:04,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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-08-30 03:14:04,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 320.0) internal successors, (1600), 5 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:04,360 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 320.0) internal successors, (1600), 5 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:04,360 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 260 flow. Second operand 4 states and 509 transitions. [2023-08-30 03:14:04,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 512 flow [2023-08-30 03:14:04,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 74 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:14:04,425 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 376 flow [2023-08-30 03:14:04,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=376, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2023-08-30 03:14:04,425 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -27 predicate places. [2023-08-30 03:14:04,425 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 376 flow [2023-08-30 03:14:04,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:04,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:04,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:14:04,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 03:14:04,426 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:14:04,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:04,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1477449812, now seen corresponding path program 1 times [2023-08-30 03:14:04,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:04,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020413067] [2023-08-30 03:14:04,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:04,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:05,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:05,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:05,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020413067] [2023-08-30 03:14:05,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020413067] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:05,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:05,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 03:14:05,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349787608] [2023-08-30 03:14:05,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:05,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 03:14:05,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:05,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 03:14:05,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-30 03:14:05,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 320 [2023-08-30 03:14:05,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 376 flow. Second operand has 9 states, 9 states have (on average 105.44444444444444) internal successors, (949), 9 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:05,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:05,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 320 [2023-08-30 03:14:05,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:06,952 INFO L130 PetriNetUnfolder]: 6095/9518 cut-off events. [2023-08-30 03:14:06,952 INFO L131 PetriNetUnfolder]: For 10990/10999 co-relation queries the response was YES. [2023-08-30 03:14:06,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35022 conditions, 9518 events. 6095/9518 cut-off events. For 10990/10999 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 61716 event pairs, 2692 based on Foata normal form. 15/8223 useless extension candidates. Maximal degree in co-relation 35010. Up to 7882 conditions per place. [2023-08-30 03:14:07,006 INFO L137 encePairwiseOnDemand]: 308/320 looper letters, 125 selfloop transitions, 45 changer transitions 0/171 dead transitions. [2023-08-30 03:14:07,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 171 transitions, 1394 flow [2023-08-30 03:14:07,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 03:14:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 03:14:07,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1258 transitions. [2023-08-30 03:14:07,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3573863636363636 [2023-08-30 03:14:07,010 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1258 transitions. [2023-08-30 03:14:07,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1258 transitions. [2023-08-30 03:14:07,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:07,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1258 transitions. [2023-08-30 03:14:07,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 114.36363636363636) internal successors, (1258), 11 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:07,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 320.0) internal successors, (3840), 12 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:07,040 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 320.0) internal successors, (3840), 12 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:07,040 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 376 flow. Second operand 11 states and 1258 transitions. [2023-08-30 03:14:07,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 171 transitions, 1394 flow [2023-08-30 03:14:07,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 171 transitions, 1387 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:14:07,279 INFO L231 Difference]: Finished difference. Result has 74 places, 96 transitions, 828 flow [2023-08-30 03:14:07,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=828, PETRI_PLACES=74, PETRI_TRANSITIONS=96} [2023-08-30 03:14:07,280 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -12 predicate places. [2023-08-30 03:14:07,280 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 96 transitions, 828 flow [2023-08-30 03:14:07,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 105.44444444444444) internal successors, (949), 9 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:07,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:07,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:14:07,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 03:14:07,281 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:14:07,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:07,281 INFO L85 PathProgramCache]: Analyzing trace with hash 960459143, now seen corresponding path program 1 times [2023-08-30 03:14:07,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:07,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972261237] [2023-08-30 03:14:07,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:07,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:07,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:07,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:07,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972261237] [2023-08-30 03:14:07,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972261237] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:07,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:07,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 03:14:07,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492327313] [2023-08-30 03:14:07,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:07,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 03:14:07,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:07,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 03:14:07,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-30 03:14:07,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 320 [2023-08-30 03:14:07,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 96 transitions, 828 flow. Second operand has 9 states, 9 states have (on average 105.66666666666667) internal successors, (951), 9 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:07,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:07,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 320 [2023-08-30 03:14:07,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:08,990 INFO L130 PetriNetUnfolder]: 4379/6975 cut-off events. [2023-08-30 03:14:08,991 INFO L131 PetriNetUnfolder]: For 17469/17501 co-relation queries the response was YES. [2023-08-30 03:14:09,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29229 conditions, 6975 events. 4379/6975 cut-off events. For 17469/17501 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 44020 event pairs, 465 based on Foata normal form. 0/6645 useless extension candidates. Maximal degree in co-relation 29210. Up to 2538 conditions per place. [2023-08-30 03:14:09,041 INFO L137 encePairwiseOnDemand]: 312/320 looper letters, 135 selfloop transitions, 24 changer transitions 2/162 dead transitions. [2023-08-30 03:14:09,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 162 transitions, 1485 flow [2023-08-30 03:14:09,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 03:14:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 03:14:09,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 915 transitions. [2023-08-30 03:14:09,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.357421875 [2023-08-30 03:14:09,044 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 915 transitions. [2023-08-30 03:14:09,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 915 transitions. [2023-08-30 03:14:09,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:09,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 915 transitions. [2023-08-30 03:14:09,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 114.375) internal successors, (915), 8 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:09,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 320.0) internal successors, (2880), 9 states have internal predecessors, (2880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:09,049 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 320.0) internal successors, (2880), 9 states have internal predecessors, (2880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:09,049 INFO L175 Difference]: Start difference. First operand has 74 places, 96 transitions, 828 flow. Second operand 8 states and 915 transitions. [2023-08-30 03:14:09,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 162 transitions, 1485 flow [2023-08-30 03:14:09,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 162 transitions, 1479 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 03:14:09,136 INFO L231 Difference]: Finished difference. Result has 80 places, 87 transitions, 770 flow [2023-08-30 03:14:09,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=770, PETRI_PLACES=80, PETRI_TRANSITIONS=87} [2023-08-30 03:14:09,137 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -6 predicate places. [2023-08-30 03:14:09,138 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 87 transitions, 770 flow [2023-08-30 03:14:09,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 105.66666666666667) internal successors, (951), 9 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:09,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:09,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:14:09,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 03:14:09,139 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:14:09,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:09,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1277908507, now seen corresponding path program 1 times [2023-08-30 03:14:09,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:09,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011518579] [2023-08-30 03:14:09,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:09,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:09,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:09,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:09,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011518579] [2023-08-30 03:14:09,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011518579] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:09,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:09,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:14:09,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728820119] [2023-08-30 03:14:09,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:09,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:14:09,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:09,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:14:09,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:14:09,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 320 [2023-08-30 03:14:09,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 87 transitions, 770 flow. Second operand has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:09,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:09,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 320 [2023-08-30 03:14:09,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:10,307 INFO L130 PetriNetUnfolder]: 3308/5329 cut-off events. [2023-08-30 03:14:10,308 INFO L131 PetriNetUnfolder]: For 14316/14345 co-relation queries the response was YES. [2023-08-30 03:14:10,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22300 conditions, 5329 events. 3308/5329 cut-off events. For 14316/14345 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 31893 event pairs, 715 based on Foata normal form. 138/5299 useless extension candidates. Maximal degree in co-relation 22279. Up to 1693 conditions per place. [2023-08-30 03:14:10,332 INFO L137 encePairwiseOnDemand]: 305/320 looper letters, 111 selfloop transitions, 29 changer transitions 1/142 dead transitions. [2023-08-30 03:14:10,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 142 transitions, 1361 flow [2023-08-30 03:14:10,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:14:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:14:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 843 transitions. [2023-08-30 03:14:10,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3763392857142857 [2023-08-30 03:14:10,335 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 843 transitions. [2023-08-30 03:14:10,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 843 transitions. [2023-08-30 03:14:10,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:10,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 843 transitions. [2023-08-30 03:14:10,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.42857142857143) internal successors, (843), 7 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:10,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 320.0) internal successors, (2560), 8 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:10,339 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 320.0) internal successors, (2560), 8 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:10,339 INFO L175 Difference]: Start difference. First operand has 80 places, 87 transitions, 770 flow. Second operand 7 states and 843 transitions. [2023-08-30 03:14:10,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 142 transitions, 1361 flow [2023-08-30 03:14:10,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 142 transitions, 1320 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-08-30 03:14:10,383 INFO L231 Difference]: Finished difference. Result has 84 places, 95 transitions, 939 flow [2023-08-30 03:14:10,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=939, PETRI_PLACES=84, PETRI_TRANSITIONS=95} [2023-08-30 03:14:10,384 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -2 predicate places. [2023-08-30 03:14:10,384 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 95 transitions, 939 flow [2023-08-30 03:14:10,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:10,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:10,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:14:10,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 03:14:10,385 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:14:10,385 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:10,385 INFO L85 PathProgramCache]: Analyzing trace with hash -785671347, now seen corresponding path program 1 times [2023-08-30 03:14:10,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:10,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163437246] [2023-08-30 03:14:10,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:10,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:10,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:10,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:10,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163437246] [2023-08-30 03:14:10,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163437246] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:10,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:10,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:14:10,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436558546] [2023-08-30 03:14:10,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:10,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:14:10,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:10,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:14:10,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:14:10,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 320 [2023-08-30 03:14:10,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 95 transitions, 939 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:10,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:10,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 320 [2023-08-30 03:14:10,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:10,907 INFO L130 PetriNetUnfolder]: 1159/2133 cut-off events. [2023-08-30 03:14:10,907 INFO L131 PetriNetUnfolder]: For 7288/7293 co-relation queries the response was YES. [2023-08-30 03:14:10,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9234 conditions, 2133 events. 1159/2133 cut-off events. For 7288/7293 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 12537 event pairs, 255 based on Foata normal form. 49/2131 useless extension candidates. Maximal degree in co-relation 9211. Up to 1822 conditions per place. [2023-08-30 03:14:10,918 INFO L137 encePairwiseOnDemand]: 315/320 looper letters, 100 selfloop transitions, 4 changer transitions 4/113 dead transitions. [2023-08-30 03:14:10,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 113 transitions, 1227 flow [2023-08-30 03:14:10,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:14:10,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:14:10,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2023-08-30 03:14:10,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2023-08-30 03:14:10,920 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2023-08-30 03:14:10,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2023-08-30 03:14:10,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:10,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2023-08-30 03:14:10,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:10,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 320.0) internal successors, (1280), 4 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:10,922 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 320.0) internal successors, (1280), 4 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:10,923 INFO L175 Difference]: Start difference. First operand has 84 places, 95 transitions, 939 flow. Second operand 3 states and 396 transitions. [2023-08-30 03:14:10,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 113 transitions, 1227 flow [2023-08-30 03:14:10,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 113 transitions, 1201 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-30 03:14:10,952 INFO L231 Difference]: Finished difference. Result has 84 places, 88 transitions, 812 flow [2023-08-30 03:14:10,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=84, PETRI_TRANSITIONS=88} [2023-08-30 03:14:10,953 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -2 predicate places. [2023-08-30 03:14:10,953 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 88 transitions, 812 flow [2023-08-30 03:14:10,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:10,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:10,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:14:10,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 03:14:10,954 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:14:10,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:10,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1302756781, now seen corresponding path program 1 times [2023-08-30 03:14:10,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:10,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722652092] [2023-08-30 03:14:10,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:10,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:11,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:11,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:11,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722652092] [2023-08-30 03:14:11,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722652092] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:11,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:11,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 03:14:11,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738335402] [2023-08-30 03:14:11,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:11,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 03:14:11,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:11,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 03:14:11,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-08-30 03:14:12,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 320 [2023-08-30 03:14:12,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 88 transitions, 812 flow. Second operand has 10 states, 10 states have (on average 104.5) internal successors, (1045), 10 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:12,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:12,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 320 [2023-08-30 03:14:12,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:12,941 INFO L130 PetriNetUnfolder]: 1405/2501 cut-off events. [2023-08-30 03:14:12,942 INFO L131 PetriNetUnfolder]: For 7484/7489 co-relation queries the response was YES. [2023-08-30 03:14:12,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11547 conditions, 2501 events. 1405/2501 cut-off events. For 7484/7489 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 14630 event pairs, 480 based on Foata normal form. 13/2453 useless extension candidates. Maximal degree in co-relation 11523. Up to 1868 conditions per place. [2023-08-30 03:14:12,955 INFO L137 encePairwiseOnDemand]: 309/320 looper letters, 115 selfloop transitions, 51 changer transitions 1/168 dead transitions. [2023-08-30 03:14:12,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 168 transitions, 1713 flow [2023-08-30 03:14:12,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-30 03:14:12,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-30 03:14:12,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1444 transitions. [2023-08-30 03:14:12,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3471153846153846 [2023-08-30 03:14:12,959 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1444 transitions. [2023-08-30 03:14:12,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1444 transitions. [2023-08-30 03:14:12,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:12,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1444 transitions. [2023-08-30 03:14:12,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 111.07692307692308) internal successors, (1444), 13 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:12,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 320.0) internal successors, (4480), 14 states have internal predecessors, (4480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:12,966 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 320.0) internal successors, (4480), 14 states have internal predecessors, (4480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:12,966 INFO L175 Difference]: Start difference. First operand has 84 places, 88 transitions, 812 flow. Second operand 13 states and 1444 transitions. [2023-08-30 03:14:12,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 168 transitions, 1713 flow [2023-08-30 03:14:13,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 168 transitions, 1702 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:14:13,002 INFO L231 Difference]: Finished difference. Result has 99 places, 103 transitions, 1144 flow [2023-08-30 03:14:13,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1144, PETRI_PLACES=99, PETRI_TRANSITIONS=103} [2023-08-30 03:14:13,003 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 13 predicate places. [2023-08-30 03:14:13,003 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 103 transitions, 1144 flow [2023-08-30 03:14:13,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 104.5) internal successors, (1045), 10 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:13,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:13,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:14:13,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 03:14:13,004 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:14:13,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:13,005 INFO L85 PathProgramCache]: Analyzing trace with hash 987750957, now seen corresponding path program 1 times [2023-08-30 03:14:13,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:13,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505976773] [2023-08-30 03:14:13,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:13,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:13,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:13,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:13,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505976773] [2023-08-30 03:14:13,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505976773] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:13,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:13,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:14:13,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574007382] [2023-08-30 03:14:13,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:13,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:14:13,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:13,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:14:13,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:14:13,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 320 [2023-08-30 03:14:13,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 103 transitions, 1144 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:13,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:13,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 320 [2023-08-30 03:14:13,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:13,414 INFO L130 PetriNetUnfolder]: 350/719 cut-off events. [2023-08-30 03:14:13,414 INFO L131 PetriNetUnfolder]: For 3084/3085 co-relation queries the response was YES. [2023-08-30 03:14:13,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3447 conditions, 719 events. 350/719 cut-off events. For 3084/3085 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3331 event pairs, 76 based on Foata normal form. 53/765 useless extension candidates. Maximal degree in co-relation 3419. Up to 326 conditions per place. [2023-08-30 03:14:13,417 INFO L137 encePairwiseOnDemand]: 315/320 looper letters, 81 selfloop transitions, 7 changer transitions 15/106 dead transitions. [2023-08-30 03:14:13,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 106 transitions, 1160 flow [2023-08-30 03:14:13,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:14:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:14:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 525 transitions. [2023-08-30 03:14:13,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2023-08-30 03:14:13,419 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 525 transitions. [2023-08-30 03:14:13,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 525 transitions. [2023-08-30 03:14:13,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:13,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 525 transitions. [2023-08-30 03:14:13,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:13,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 320.0) internal successors, (1600), 5 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:13,422 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 320.0) internal successors, (1600), 5 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:13,422 INFO L175 Difference]: Start difference. First operand has 99 places, 103 transitions, 1144 flow. Second operand 4 states and 525 transitions. [2023-08-30 03:14:13,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 106 transitions, 1160 flow [2023-08-30 03:14:13,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 106 transitions, 990 flow, removed 35 selfloop flow, removed 14 redundant places. [2023-08-30 03:14:13,432 INFO L231 Difference]: Finished difference. Result has 81 places, 58 transitions, 433 flow [2023-08-30 03:14:13,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=433, PETRI_PLACES=81, PETRI_TRANSITIONS=58} [2023-08-30 03:14:13,432 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -5 predicate places. [2023-08-30 03:14:13,433 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 58 transitions, 433 flow [2023-08-30 03:14:13,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:13,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:13,433 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-08-30 03:14:13,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 03:14:13,434 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:14:13,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:13,434 INFO L85 PathProgramCache]: Analyzing trace with hash -207061560, now seen corresponding path program 1 times [2023-08-30 03:14:13,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:13,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003249203] [2023-08-30 03:14:13,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:13,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:14,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:14,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:14,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003249203] [2023-08-30 03:14:14,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003249203] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:14,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:14,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 03:14:14,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957814203] [2023-08-30 03:14:14,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:14,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 03:14:14,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:14,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 03:14:14,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-30 03:14:14,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 320 [2023-08-30 03:14:14,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 58 transitions, 433 flow. Second operand has 9 states, 9 states have (on average 107.0) internal successors, (963), 9 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:14,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:14,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 320 [2023-08-30 03:14:14,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:15,108 INFO L130 PetriNetUnfolder]: 743/1585 cut-off events. [2023-08-30 03:14:15,108 INFO L131 PetriNetUnfolder]: For 4132/4151 co-relation queries the response was YES. [2023-08-30 03:14:15,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6800 conditions, 1585 events. 743/1585 cut-off events. For 4132/4151 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 9635 event pairs, 179 based on Foata normal form. 16/1591 useless extension candidates. Maximal degree in co-relation 6778. Up to 586 conditions per place. [2023-08-30 03:14:15,114 INFO L137 encePairwiseOnDemand]: 308/320 looper letters, 148 selfloop transitions, 24 changer transitions 18/191 dead transitions. [2023-08-30 03:14:15,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 191 transitions, 1685 flow [2023-08-30 03:14:15,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 03:14:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 03:14:15,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1176 transitions. [2023-08-30 03:14:15,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3675 [2023-08-30 03:14:15,116 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1176 transitions. [2023-08-30 03:14:15,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1176 transitions. [2023-08-30 03:14:15,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:15,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1176 transitions. [2023-08-30 03:14:15,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 117.6) internal successors, (1176), 10 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:15,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 320.0) internal successors, (3520), 11 states have internal predecessors, (3520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:15,131 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 320.0) internal successors, (3520), 11 states have internal predecessors, (3520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:15,132 INFO L175 Difference]: Start difference. First operand has 81 places, 58 transitions, 433 flow. Second operand 10 states and 1176 transitions. [2023-08-30 03:14:15,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 191 transitions, 1685 flow [2023-08-30 03:14:15,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 191 transitions, 1542 flow, removed 34 selfloop flow, removed 4 redundant places. [2023-08-30 03:14:15,143 INFO L231 Difference]: Finished difference. Result has 91 places, 76 transitions, 587 flow [2023-08-30 03:14:15,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=587, PETRI_PLACES=91, PETRI_TRANSITIONS=76} [2023-08-30 03:14:15,144 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 5 predicate places. [2023-08-30 03:14:15,144 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 76 transitions, 587 flow [2023-08-30 03:14:15,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 107.0) internal successors, (963), 9 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:15,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:15,145 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-08-30 03:14:15,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 03:14:15,145 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:14:15,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:15,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1409120288, now seen corresponding path program 2 times [2023-08-30 03:14:15,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:15,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601600740] [2023-08-30 03:14:15,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:15,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:16,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:16,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:16,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601600740] [2023-08-30 03:14:16,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601600740] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:16,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:16,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-30 03:14:16,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551144291] [2023-08-30 03:14:16,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:16,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 03:14:16,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:16,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 03:14:16,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-08-30 03:14:16,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 320 [2023-08-30 03:14:16,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 76 transitions, 587 flow. Second operand has 11 states, 11 states have (on average 103.63636363636364) internal successors, (1140), 11 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:16,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:16,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 320 [2023-08-30 03:14:16,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:17,245 INFO L130 PetriNetUnfolder]: 1040/2240 cut-off events. [2023-08-30 03:14:17,246 INFO L131 PetriNetUnfolder]: For 8795/8830 co-relation queries the response was YES. [2023-08-30 03:14:17,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10360 conditions, 2240 events. 1040/2240 cut-off events. For 8795/8830 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 15046 event pairs, 202 based on Foata normal form. 34/2266 useless extension candidates. Maximal degree in co-relation 10334. Up to 720 conditions per place. [2023-08-30 03:14:17,255 INFO L137 encePairwiseOnDemand]: 308/320 looper letters, 153 selfloop transitions, 43 changer transitions 20/217 dead transitions. [2023-08-30 03:14:17,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 217 transitions, 1946 flow [2023-08-30 03:14:17,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 03:14:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 03:14:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1361 transitions. [2023-08-30 03:14:17,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35442708333333334 [2023-08-30 03:14:17,258 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1361 transitions. [2023-08-30 03:14:17,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1361 transitions. [2023-08-30 03:14:17,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:17,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1361 transitions. [2023-08-30 03:14:17,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 113.41666666666667) internal successors, (1361), 12 states have internal predecessors, (1361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:17,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 320.0) internal successors, (4160), 13 states have internal predecessors, (4160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:17,264 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 320.0) internal successors, (4160), 13 states have internal predecessors, (4160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:17,264 INFO L175 Difference]: Start difference. First operand has 91 places, 76 transitions, 587 flow. Second operand 12 states and 1361 transitions. [2023-08-30 03:14:17,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 217 transitions, 1946 flow [2023-08-30 03:14:17,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 217 transitions, 1912 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-30 03:14:17,289 INFO L231 Difference]: Finished difference. Result has 105 places, 97 transitions, 904 flow [2023-08-30 03:14:17,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=904, PETRI_PLACES=105, PETRI_TRANSITIONS=97} [2023-08-30 03:14:17,290 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 19 predicate places. [2023-08-30 03:14:17,290 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 97 transitions, 904 flow [2023-08-30 03:14:17,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 103.63636363636364) internal successors, (1140), 11 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:17,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:17,290 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-08-30 03:14:17,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 03:14:17,291 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:14:17,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:17,291 INFO L85 PathProgramCache]: Analyzing trace with hash -660580956, now seen corresponding path program 3 times [2023-08-30 03:14:17,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:17,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169828928] [2023-08-30 03:14:17,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:17,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:18,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:18,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169828928] [2023-08-30 03:14:18,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169828928] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:18,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:18,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 03:14:18,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228309065] [2023-08-30 03:14:18,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:18,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 03:14:18,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:18,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 03:14:18,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 03:14:18,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 320 [2023-08-30 03:14:18,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 97 transitions, 904 flow. Second operand has 8 states, 8 states have (on average 113.25) internal successors, (906), 8 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:18,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:18,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 320 [2023-08-30 03:14:18,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:18,952 INFO L130 PetriNetUnfolder]: 959/2253 cut-off events. [2023-08-30 03:14:18,953 INFO L131 PetriNetUnfolder]: For 12924/12927 co-relation queries the response was YES. [2023-08-30 03:14:18,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11356 conditions, 2253 events. 959/2253 cut-off events. For 12924/12927 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 16302 event pairs, 343 based on Foata normal form. 8/2246 useless extension candidates. Maximal degree in co-relation 11325. Up to 1105 conditions per place. [2023-08-30 03:14:18,968 INFO L137 encePairwiseOnDemand]: 312/320 looper letters, 148 selfloop transitions, 39 changer transitions 2/192 dead transitions. [2023-08-30 03:14:18,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 192 transitions, 2060 flow [2023-08-30 03:14:18,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 03:14:18,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 03:14:18,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1093 transitions. [2023-08-30 03:14:18,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3795138888888889 [2023-08-30 03:14:18,971 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1093 transitions. [2023-08-30 03:14:18,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1093 transitions. [2023-08-30 03:14:18,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:18,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1093 transitions. [2023-08-30 03:14:18,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.44444444444444) internal successors, (1093), 9 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:18,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 320.0) internal successors, (3200), 10 states have internal predecessors, (3200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:18,977 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 320.0) internal successors, (3200), 10 states have internal predecessors, (3200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:18,977 INFO L175 Difference]: Start difference. First operand has 105 places, 97 transitions, 904 flow. Second operand 9 states and 1093 transitions. [2023-08-30 03:14:18,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 192 transitions, 2060 flow [2023-08-30 03:14:19,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 192 transitions, 2037 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-30 03:14:19,010 INFO L231 Difference]: Finished difference. Result has 115 places, 111 transitions, 1203 flow [2023-08-30 03:14:19,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1203, PETRI_PLACES=115, PETRI_TRANSITIONS=111} [2023-08-30 03:14:19,011 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 29 predicate places. [2023-08-30 03:14:19,011 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 111 transitions, 1203 flow [2023-08-30 03:14:19,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.25) internal successors, (906), 8 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:19,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:19,011 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-08-30 03:14:19,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 03:14:19,012 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:14:19,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:19,012 INFO L85 PathProgramCache]: Analyzing trace with hash 118207954, now seen corresponding path program 4 times [2023-08-30 03:14:19,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:19,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008972747] [2023-08-30 03:14:19,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:19,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:19,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:19,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:19,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008972747] [2023-08-30 03:14:19,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008972747] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:19,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:19,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:14:19,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711784149] [2023-08-30 03:14:19,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:19,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:14:19,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:19,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:14:19,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:14:19,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 320 [2023-08-30 03:14:19,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 111 transitions, 1203 flow. Second operand has 5 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:19,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:19,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 320 [2023-08-30 03:14:19,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:19,538 INFO L130 PetriNetUnfolder]: 630/1323 cut-off events. [2023-08-30 03:14:19,538 INFO L131 PetriNetUnfolder]: For 10697/10697 co-relation queries the response was YES. [2023-08-30 03:14:19,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7412 conditions, 1323 events. 630/1323 cut-off events. For 10697/10697 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8376 event pairs, 95 based on Foata normal form. 93/1410 useless extension candidates. Maximal degree in co-relation 7377. Up to 574 conditions per place. [2023-08-30 03:14:19,546 INFO L137 encePairwiseOnDemand]: 315/320 looper letters, 91 selfloop transitions, 10 changer transitions 62/164 dead transitions. [2023-08-30 03:14:19,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 164 transitions, 2314 flow [2023-08-30 03:14:19,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:14:19,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:14:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2023-08-30 03:14:19,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3975 [2023-08-30 03:14:19,550 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 636 transitions. [2023-08-30 03:14:19,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 636 transitions. [2023-08-30 03:14:19,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:19,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 636 transitions. [2023-08-30 03:14:19,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:19,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 320.0) internal successors, (1920), 6 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:19,553 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 320.0) internal successors, (1920), 6 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:19,553 INFO L175 Difference]: Start difference. First operand has 115 places, 111 transitions, 1203 flow. Second operand 5 states and 636 transitions. [2023-08-30 03:14:19,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 164 transitions, 2314 flow [2023-08-30 03:14:19,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 164 transitions, 1987 flow, removed 99 selfloop flow, removed 18 redundant places. [2023-08-30 03:14:19,567 INFO L231 Difference]: Finished difference. Result has 94 places, 63 transitions, 619 flow [2023-08-30 03:14:19,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=619, PETRI_PLACES=94, PETRI_TRANSITIONS=63} [2023-08-30 03:14:19,568 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 8 predicate places. [2023-08-30 03:14:19,568 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 63 transitions, 619 flow [2023-08-30 03:14:19,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:19,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:19,568 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] [2023-08-30 03:14:19,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-30 03:14:19,569 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:14:19,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:19,569 INFO L85 PathProgramCache]: Analyzing trace with hash -26781979, now seen corresponding path program 1 times [2023-08-30 03:14:19,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:19,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141157342] [2023-08-30 03:14:19,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:19,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:20,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:20,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141157342] [2023-08-30 03:14:20,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141157342] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:20,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:20,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 03:14:20,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886384845] [2023-08-30 03:14:20,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:20,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 03:14:20,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:20,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 03:14:20,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 03:14:20,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 320 [2023-08-30 03:14:20,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 63 transitions, 619 flow. Second operand has 8 states, 8 states have (on average 113.5) internal successors, (908), 8 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:20,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:20,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 320 [2023-08-30 03:14:20,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:20,943 INFO L130 PetriNetUnfolder]: 196/442 cut-off events. [2023-08-30 03:14:20,943 INFO L131 PetriNetUnfolder]: For 2778/2778 co-relation queries the response was YES. [2023-08-30 03:14:20,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2456 conditions, 442 events. 196/442 cut-off events. For 2778/2778 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2119 event pairs, 59 based on Foata normal form. 1/443 useless extension candidates. Maximal degree in co-relation 2430. Up to 223 conditions per place. [2023-08-30 03:14:20,945 INFO L137 encePairwiseOnDemand]: 311/320 looper letters, 65 selfloop transitions, 21 changer transitions 18/105 dead transitions. [2023-08-30 03:14:20,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 105 transitions, 1140 flow [2023-08-30 03:14:20,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:14:20,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:14:20,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 832 transitions. [2023-08-30 03:14:20,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2023-08-30 03:14:20,947 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 832 transitions. [2023-08-30 03:14:20,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 832 transitions. [2023-08-30 03:14:20,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:20,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 832 transitions. [2023-08-30 03:14:20,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.85714285714286) internal successors, (832), 7 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:20,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 320.0) internal successors, (2560), 8 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:20,951 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 320.0) internal successors, (2560), 8 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:20,951 INFO L175 Difference]: Start difference. First operand has 94 places, 63 transitions, 619 flow. Second operand 7 states and 832 transitions. [2023-08-30 03:14:20,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 105 transitions, 1140 flow [2023-08-30 03:14:20,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 105 transitions, 985 flow, removed 43 selfloop flow, removed 9 redundant places. [2023-08-30 03:14:20,957 INFO L231 Difference]: Finished difference. Result has 83 places, 62 transitions, 573 flow [2023-08-30 03:14:20,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=573, PETRI_PLACES=83, PETRI_TRANSITIONS=62} [2023-08-30 03:14:20,958 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -3 predicate places. [2023-08-30 03:14:20,958 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 62 transitions, 573 flow [2023-08-30 03:14:20,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.5) internal successors, (908), 8 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:20,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:20,958 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] [2023-08-30 03:14:20,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-30 03:14:20,959 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:14:20,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:20,959 INFO L85 PathProgramCache]: Analyzing trace with hash -282751205, now seen corresponding path program 2 times [2023-08-30 03:14:20,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:20,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058700047] [2023-08-30 03:14:20,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:20,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:23,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:23,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058700047] [2023-08-30 03:14:23,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058700047] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:23,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:23,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-08-30 03:14:23,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386345666] [2023-08-30 03:14:23,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:23,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 03:14:23,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:23,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 03:14:23,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-08-30 03:14:23,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 320 [2023-08-30 03:14:23,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 62 transitions, 573 flow. Second operand has 13 states, 13 states have (on average 102.53846153846153) internal successors, (1333), 13 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:23,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:23,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 320 [2023-08-30 03:14:23,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:24,285 INFO L130 PetriNetUnfolder]: 217/495 cut-off events. [2023-08-30 03:14:24,285 INFO L131 PetriNetUnfolder]: For 2803/2805 co-relation queries the response was YES. [2023-08-30 03:14:24,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2477 conditions, 495 events. 217/495 cut-off events. For 2803/2805 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2511 event pairs, 66 based on Foata normal form. 1/495 useless extension candidates. Maximal degree in co-relation 2452. Up to 368 conditions per place. [2023-08-30 03:14:24,288 INFO L137 encePairwiseOnDemand]: 310/320 looper letters, 80 selfloop transitions, 19 changer transitions 9/109 dead transitions. [2023-08-30 03:14:24,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 109 transitions, 1121 flow [2023-08-30 03:14:24,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 03:14:24,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 03:14:24,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1170 transitions. [2023-08-30 03:14:24,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33238636363636365 [2023-08-30 03:14:24,290 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1170 transitions. [2023-08-30 03:14:24,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1170 transitions. [2023-08-30 03:14:24,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:24,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1170 transitions. [2023-08-30 03:14:24,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 106.36363636363636) internal successors, (1170), 11 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:24,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 320.0) internal successors, (3840), 12 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:24,295 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 320.0) internal successors, (3840), 12 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:24,295 INFO L175 Difference]: Start difference. First operand has 83 places, 62 transitions, 573 flow. Second operand 11 states and 1170 transitions. [2023-08-30 03:14:24,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 109 transitions, 1121 flow [2023-08-30 03:14:24,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 109 transitions, 1076 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-30 03:14:24,300 INFO L231 Difference]: Finished difference. Result has 91 places, 72 transitions, 727 flow [2023-08-30 03:14:24,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=727, PETRI_PLACES=91, PETRI_TRANSITIONS=72} [2023-08-30 03:14:24,301 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 5 predicate places. [2023-08-30 03:14:24,301 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 72 transitions, 727 flow [2023-08-30 03:14:24,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 102.53846153846153) internal successors, (1333), 13 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:24,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:24,302 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] [2023-08-30 03:14:24,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-30 03:14:24,302 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:14:24,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:24,302 INFO L85 PathProgramCache]: Analyzing trace with hash 21410309, now seen corresponding path program 3 times [2023-08-30 03:14:24,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:24,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975893851] [2023-08-30 03:14:24,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:24,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:26,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:26,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:26,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975893851] [2023-08-30 03:14:26,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975893851] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:26,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:26,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-08-30 03:14:26,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584612476] [2023-08-30 03:14:26,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:26,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 03:14:26,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:26,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 03:14:26,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-08-30 03:14:27,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 320 [2023-08-30 03:14:27,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 72 transitions, 727 flow. Second operand has 13 states, 13 states have (on average 102.53846153846153) internal successors, (1333), 13 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:27,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:27,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 320 [2023-08-30 03:14:27,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:27,528 INFO L130 PetriNetUnfolder]: 235/542 cut-off events. [2023-08-30 03:14:27,528 INFO L131 PetriNetUnfolder]: For 3260/3260 co-relation queries the response was YES. [2023-08-30 03:14:27,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2800 conditions, 542 events. 235/542 cut-off events. For 3260/3260 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2837 event pairs, 99 based on Foata normal form. 1/543 useless extension candidates. Maximal degree in co-relation 2772. Up to 419 conditions per place. [2023-08-30 03:14:27,530 INFO L137 encePairwiseOnDemand]: 310/320 looper letters, 75 selfloop transitions, 19 changer transitions 12/107 dead transitions. [2023-08-30 03:14:27,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 107 transitions, 1174 flow [2023-08-30 03:14:27,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 03:14:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 03:14:27,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1065 transitions. [2023-08-30 03:14:27,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3328125 [2023-08-30 03:14:27,532 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1065 transitions. [2023-08-30 03:14:27,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1065 transitions. [2023-08-30 03:14:27,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:27,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1065 transitions. [2023-08-30 03:14:27,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 106.5) internal successors, (1065), 10 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:27,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 320.0) internal successors, (3520), 11 states have internal predecessors, (3520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:27,544 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 320.0) internal successors, (3520), 11 states have internal predecessors, (3520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:27,544 INFO L175 Difference]: Start difference. First operand has 91 places, 72 transitions, 727 flow. Second operand 10 states and 1065 transitions. [2023-08-30 03:14:27,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 107 transitions, 1174 flow [2023-08-30 03:14:27,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 107 transitions, 1091 flow, removed 39 selfloop flow, removed 2 redundant places. [2023-08-30 03:14:27,552 INFO L231 Difference]: Finished difference. Result has 101 places, 74 transitions, 738 flow [2023-08-30 03:14:27,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=738, PETRI_PLACES=101, PETRI_TRANSITIONS=74} [2023-08-30 03:14:27,552 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 15 predicate places. [2023-08-30 03:14:27,552 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 74 transitions, 738 flow [2023-08-30 03:14:27,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 102.53846153846153) internal successors, (1333), 13 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:27,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:27,553 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] [2023-08-30 03:14:27,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-30 03:14:27,553 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:14:27,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:27,553 INFO L85 PathProgramCache]: Analyzing trace with hash 823730353, now seen corresponding path program 4 times [2023-08-30 03:14:27,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:27,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898422028] [2023-08-30 03:14:27,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:27,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:29,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:29,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:29,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898422028] [2023-08-30 03:14:29,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898422028] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:29,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:29,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 03:14:29,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624983808] [2023-08-30 03:14:29,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:29,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 03:14:29,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:29,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 03:14:29,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-30 03:14:29,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 320 [2023-08-30 03:14:29,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 74 transitions, 738 flow. Second operand has 9 states, 9 states have (on average 110.22222222222223) internal successors, (992), 9 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:29,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:29,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 320 [2023-08-30 03:14:29,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:29,533 INFO L130 PetriNetUnfolder]: 214/498 cut-off events. [2023-08-30 03:14:29,534 INFO L131 PetriNetUnfolder]: For 2757/2757 co-relation queries the response was YES. [2023-08-30 03:14:29,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2542 conditions, 498 events. 214/498 cut-off events. For 2757/2757 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2564 event pairs, 69 based on Foata normal form. 1/499 useless extension candidates. Maximal degree in co-relation 2510. Up to 216 conditions per place. [2023-08-30 03:14:29,537 INFO L137 encePairwiseOnDemand]: 313/320 looper letters, 64 selfloop transitions, 15 changer transitions 34/114 dead transitions. [2023-08-30 03:14:29,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 114 transitions, 1213 flow [2023-08-30 03:14:29,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 03:14:29,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 03:14:29,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 921 transitions. [2023-08-30 03:14:29,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359765625 [2023-08-30 03:14:29,540 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 921 transitions. [2023-08-30 03:14:29,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 921 transitions. [2023-08-30 03:14:29,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:29,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 921 transitions. [2023-08-30 03:14:29,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 115.125) internal successors, (921), 8 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:29,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 320.0) internal successors, (2880), 9 states have internal predecessors, (2880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:29,557 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 320.0) internal successors, (2880), 9 states have internal predecessors, (2880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:29,572 INFO L175 Difference]: Start difference. First operand has 101 places, 74 transitions, 738 flow. Second operand 8 states and 921 transitions. [2023-08-30 03:14:29,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 114 transitions, 1213 flow [2023-08-30 03:14:29,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 114 transitions, 1167 flow, removed 7 selfloop flow, removed 9 redundant places. [2023-08-30 03:14:29,581 INFO L231 Difference]: Finished difference. Result has 101 places, 62 transitions, 599 flow [2023-08-30 03:14:29,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=599, PETRI_PLACES=101, PETRI_TRANSITIONS=62} [2023-08-30 03:14:29,582 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 15 predicate places. [2023-08-30 03:14:29,582 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 62 transitions, 599 flow [2023-08-30 03:14:29,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.22222222222223) internal successors, (992), 9 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:29,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:29,583 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] [2023-08-30 03:14:29,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-30 03:14:29,583 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:14:29,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:29,583 INFO L85 PathProgramCache]: Analyzing trace with hash -457877915, now seen corresponding path program 5 times [2023-08-30 03:14:29,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:29,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907944768] [2023-08-30 03:14:29,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:29,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:14:29,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 03:14:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:14:29,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 03:14:29,827 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 03:14:29,828 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (90 of 91 remaining) [2023-08-30 03:14:29,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 91 remaining) [2023-08-30 03:14:29,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 91 remaining) [2023-08-30 03:14:29,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 91 remaining) [2023-08-30 03:14:29,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 91 remaining) [2023-08-30 03:14:29,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 91 remaining) [2023-08-30 03:14:29,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 91 remaining) [2023-08-30 03:14:29,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 91 remaining) [2023-08-30 03:14:29,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 91 remaining) [2023-08-30 03:14:29,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 91 remaining) [2023-08-30 03:14:29,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 91 remaining) [2023-08-30 03:14:29,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 91 remaining) [2023-08-30 03:14:29,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 91 remaining) [2023-08-30 03:14:29,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (77 of 91 remaining) [2023-08-30 03:14:29,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 91 remaining) [2023-08-30 03:14:29,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 91 remaining) [2023-08-30 03:14:29,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 91 remaining) [2023-08-30 03:14:29,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 91 remaining) [2023-08-30 03:14:29,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 91 remaining) [2023-08-30 03:14:29,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 91 remaining) [2023-08-30 03:14:29,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 91 remaining) [2023-08-30 03:14:29,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 91 remaining) [2023-08-30 03:14:29,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 91 remaining) [2023-08-30 03:14:29,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 91 remaining) [2023-08-30 03:14:29,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 91 remaining) [2023-08-30 03:14:29,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 91 remaining) [2023-08-30 03:14:29,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 91 remaining) [2023-08-30 03:14:29,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 91 remaining) [2023-08-30 03:14:29,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 91 remaining) [2023-08-30 03:14:29,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 91 remaining) [2023-08-30 03:14:29,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 91 remaining) [2023-08-30 03:14:29,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 91 remaining) [2023-08-30 03:14:29,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 91 remaining) [2023-08-30 03:14:29,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 91 remaining) [2023-08-30 03:14:29,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 91 remaining) [2023-08-30 03:14:29,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 91 remaining) [2023-08-30 03:14:29,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 91 remaining) [2023-08-30 03:14:29,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 91 remaining) [2023-08-30 03:14:29,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 91 remaining) [2023-08-30 03:14:29,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 91 remaining) [2023-08-30 03:14:29,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 91 remaining) [2023-08-30 03:14:29,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 91 remaining) [2023-08-30 03:14:29,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 91 remaining) [2023-08-30 03:14:29,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 91 remaining) [2023-08-30 03:14:29,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 91 remaining) [2023-08-30 03:14:29,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 91 remaining) [2023-08-30 03:14:29,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 91 remaining) [2023-08-30 03:14:29,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 91 remaining) [2023-08-30 03:14:29,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 91 remaining) [2023-08-30 03:14:29,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 91 remaining) [2023-08-30 03:14:29,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (40 of 91 remaining) [2023-08-30 03:14:29,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 91 remaining) [2023-08-30 03:14:29,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 91 remaining) [2023-08-30 03:14:29,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 91 remaining) [2023-08-30 03:14:29,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 91 remaining) [2023-08-30 03:14:29,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 91 remaining) [2023-08-30 03:14:29,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 91 remaining) [2023-08-30 03:14:29,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 91 remaining) [2023-08-30 03:14:29,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 91 remaining) [2023-08-30 03:14:29,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 91 remaining) [2023-08-30 03:14:29,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 91 remaining) [2023-08-30 03:14:29,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 91 remaining) [2023-08-30 03:14:29,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 91 remaining) [2023-08-30 03:14:29,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 91 remaining) [2023-08-30 03:14:29,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 91 remaining) [2023-08-30 03:14:29,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 91 remaining) [2023-08-30 03:14:29,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 91 remaining) [2023-08-30 03:14:29,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 91 remaining) [2023-08-30 03:14:29,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 91 remaining) [2023-08-30 03:14:29,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 91 remaining) [2023-08-30 03:14:29,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 91 remaining) [2023-08-30 03:14:29,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 91 remaining) [2023-08-30 03:14:29,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 91 remaining) [2023-08-30 03:14:29,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 91 remaining) [2023-08-30 03:14:29,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 91 remaining) [2023-08-30 03:14:29,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 91 remaining) [2023-08-30 03:14:29,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 91 remaining) [2023-08-30 03:14:29,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 91 remaining) [2023-08-30 03:14:29,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 91 remaining) [2023-08-30 03:14:29,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 91 remaining) [2023-08-30 03:14:29,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 91 remaining) [2023-08-30 03:14:29,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 91 remaining) [2023-08-30 03:14:29,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 91 remaining) [2023-08-30 03:14:29,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 91 remaining) [2023-08-30 03:14:29,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 91 remaining) [2023-08-30 03:14:29,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 91 remaining) [2023-08-30 03:14:29,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 91 remaining) [2023-08-30 03:14:29,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 91 remaining) [2023-08-30 03:14:29,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 91 remaining) [2023-08-30 03:14:29,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 91 remaining) [2023-08-30 03:14:29,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 91 remaining) [2023-08-30 03:14:29,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-30 03:14:29,844 INFO L445 BasicCegarLoop]: Path program histogram: [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:14:29,857 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 03:14:29,857 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 03:14:29,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:14:29 BasicIcfg [2023-08-30 03:14:29,925 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 03:14:29,926 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 03:14:29,926 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 03:14:29,926 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 03:14:29,926 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:13:39" (3/4) ... [2023-08-30 03:14:29,928 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 03:14:29,928 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 03:14:29,929 INFO L158 Benchmark]: Toolchain (without parser) took 52332.52ms. Allocated memory was 96.5MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 72.2MB in the beginning and 3.0GB in the end (delta: -3.0GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-08-30 03:14:29,929 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 67.1MB. Free memory was 44.5MB in the beginning and 44.4MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:14:29,929 INFO L158 Benchmark]: CACSL2BoogieTranslator took 592.83ms. Allocated memory is still 96.5MB. Free memory was 72.0MB in the beginning and 68.6MB in the end (delta: 3.4MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2023-08-30 03:14:29,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.48ms. Allocated memory is still 96.5MB. Free memory was 68.6MB in the beginning and 66.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:14:29,929 INFO L158 Benchmark]: Boogie Preprocessor took 61.96ms. Allocated memory is still 96.5MB. Free memory was 66.1MB in the beginning and 63.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 03:14:29,930 INFO L158 Benchmark]: RCFGBuilder took 1274.20ms. Allocated memory was 96.5MB in the beginning and 157.3MB in the end (delta: 60.8MB). Free memory was 63.5MB in the beginning and 110.6MB in the end (delta: -47.0MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. [2023-08-30 03:14:29,930 INFO L158 Benchmark]: TraceAbstraction took 50319.18ms. Allocated memory was 157.3MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 109.5MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-08-30 03:14:29,930 INFO L158 Benchmark]: Witness Printer took 2.67ms. Allocated memory is still 4.2GB. Free memory is still 3.0GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:14:29,931 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.14ms. Allocated memory is still 67.1MB. Free memory was 44.5MB in the beginning and 44.4MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 592.83ms. Allocated memory is still 96.5MB. Free memory was 72.0MB in the beginning and 68.6MB in the end (delta: 3.4MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.48ms. Allocated memory is still 96.5MB. Free memory was 68.6MB in the beginning and 66.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.96ms. Allocated memory is still 96.5MB. Free memory was 66.1MB in the beginning and 63.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1274.20ms. Allocated memory was 96.5MB in the beginning and 157.3MB in the end (delta: 60.8MB). Free memory was 63.5MB in the beginning and 110.6MB in the end (delta: -47.0MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. * TraceAbstraction took 50319.18ms. Allocated memory was 157.3MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 109.5MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 2.67ms. Allocated memory is still 4.2GB. Free memory is still 3.0GB. 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: 8.5s, 182 PlacesBefore, 86 PlacesAfterwards, 174 TransitionsBefore, 77 TransitionsAfterwards, 7064 CoEnabledTransitionPairs, 8 FixpointIterations, 68 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 143 TotalNumberOfCompositions, 40932 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10682, independent: 9982, independent conditional: 0, independent unconditional: 9982, dependent: 700, dependent conditional: 0, dependent unconditional: 700, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2814, independent: 2714, independent conditional: 0, independent unconditional: 2714, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10682, independent: 7268, independent conditional: 0, independent unconditional: 7268, dependent: 600, dependent conditional: 0, dependent unconditional: 600, unknown: 2814, unknown conditional: 0, unknown unconditional: 2814] , Statistics on independence cache: Total cache size (in pairs): 443, Positive cache size: 391, Positive conditional cache size: 0, Positive unconditional cache size: 391, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L718] 0 int __unbuffered_p2_EAX$mem_tmp; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L859] 0 pthread_t t2204; [L860] FCALL, FORK 0 pthread_create(&t2204, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2204, ((void *)0), P0, ((void *)0))=8, t2204={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L861] 0 pthread_t t2205; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2204={7:0}, t2205={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L862] FCALL, FORK 0 pthread_create(&t2205, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2205, ((void *)0), P1, ((void *)0))=9, t2204={7:0}, t2205={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L789] 2 x$w_buff1 = x$w_buff0 [L790] 2 x$w_buff0 = 1 [L791] 2 x$w_buff1_used = x$w_buff0_used [L792] 2 x$w_buff0_used = (_Bool)1 [L793] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L793] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L794] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L795] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L796] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L797] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L798] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L863] 0 pthread_t t2206; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2204={7:0}, t2205={5:0}, t2206={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L864] FCALL, FORK 0 pthread_create(&t2206, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2206, ((void *)0), P2, ((void *)0))=10, t2204={7:0}, t2205={5:0}, t2206={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 x$flush_delayed = weak$$choice2 [L818] EXPR 3 \read(x) [L818] 3 x$mem_tmp = x [L819] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L820] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L820] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L820] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L820] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L820] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L821] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L822] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L823] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L824] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L825] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L826] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L827] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L828] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L829] EXPR 3 \read(x) [L829] 3 __unbuffered_p2_EAX = x [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] 3 x = x$flush_delayed ? x$mem_tmp : x [L831] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L834] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L761] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EBX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L801] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L802] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L803] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L804] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L805] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 2 return 0; [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 \read(x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L838] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L839] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L840] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L841] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L844] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 3 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 \read(x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2204={7:0}, t2205={5:0}, t2206={6:0}, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L877] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L879] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 864]: 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: 860]: 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: 862]: 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 7 procedures, 238 locations, 91 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: 50.1s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 26.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3102 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2464 mSDsluCounter, 2766 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2661 mSDsCounter, 699 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9308 IncrementalHoareTripleChecker+Invalid, 10007 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 699 mSolverCounterUnsat, 105 mSDtfsCounter, 9308 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1203occurred in iteration=19, InterpolantAutomatonStates: 152, 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.8s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 358 NumberOfCodeBlocks, 358 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 313 ConstructedInterpolants, 0 QuantifiedInterpolants, 4958 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 03:14:29,956 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-wmm/safe018_power.opt.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 81ed16bb51b8da596bb3c9a2024b72d3baf359b31125524126025207d822fe2c --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 03:14:32,002 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 03:14:32,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 03:14:32,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 03:14:32,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 03:14:32,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 03:14:32,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 03:14:32,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 03:14:32,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 03:14:32,040 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 03:14:32,041 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 03:14:32,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 03:14:32,043 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 03:14:32,044 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 03:14:32,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 03:14:32,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 03:14:32,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 03:14:32,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 03:14:32,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 03:14:32,066 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 03:14:32,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 03:14:32,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 03:14:32,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 03:14:32,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 03:14:32,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 03:14:32,071 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 03:14:32,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 03:14:32,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 03:14:32,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 03:14:32,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 03:14:32,074 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 03:14:32,075 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 03:14:32,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 03:14:32,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 03:14:32,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 03:14:32,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 03:14:32,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 03:14:32,078 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 03:14:32,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 03:14:32,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 03:14:32,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 03:14:32,081 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 03:14:32,110 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 03:14:32,110 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 03:14:32,111 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 03:14:32,111 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 03:14:32,112 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 03:14:32,112 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 03:14:32,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 03:14:32,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 03:14:32,113 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 03:14:32,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 03:14:32,113 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 03:14:32,113 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 03:14:32,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 03:14:32,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 03:14:32,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 03:14:32,114 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 03:14:32,114 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 03:14:32,114 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 03:14:32,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 03:14:32,115 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 03:14:32,115 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 03:14:32,115 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 03:14:32,115 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 03:14:32,115 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 03:14:32,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 03:14:32,116 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 03:14:32,116 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 03:14:32,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:14:32,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 03:14:32,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 03:14:32,116 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 03:14:32,116 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 03:14:32,117 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 03:14:32,117 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 03:14:32,117 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 03:14:32,117 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 03:14:32,117 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 03:14:32,117 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 -> 81ed16bb51b8da596bb3c9a2024b72d3baf359b31125524126025207d822fe2c Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 03:14:32,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 03:14:32,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 03:14:32,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 03:14:32,458 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 03:14:32,459 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 03:14:32,460 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_power.opt.i [2023-08-30 03:14:33,395 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 03:14:33,621 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 03:14:33,622 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_power.opt.i [2023-08-30 03:14:33,637 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc6652b59/ab1f0fe39b48408d925232e741142f77/FLAGaccea4f95 [2023-08-30 03:14:33,646 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc6652b59/ab1f0fe39b48408d925232e741142f77 [2023-08-30 03:14:33,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 03:14:33,649 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 03:14:33,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 03:14:33,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 03:14:33,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 03:14:33,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:14:33" (1/1) ... [2023-08-30 03:14:33,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54580381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:33, skipping insertion in model container [2023-08-30 03:14:33,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:14:33" (1/1) ... [2023-08-30 03:14:33,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 03:14:33,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 03:14:33,828 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-wmm/safe018_power.opt.i[994,1007] [2023-08-30 03:14:34,014 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:14:34,032 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 03:14:34,042 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-wmm/safe018_power.opt.i[994,1007] [2023-08-30 03:14:34,110 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:14:34,140 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:14:34,140 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:14:34,145 INFO L208 MainTranslator]: Completed translation [2023-08-30 03:14:34,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:34 WrapperNode [2023-08-30 03:14:34,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 03:14:34,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 03:14:34,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 03:14:34,146 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 03:14:34,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:34" (1/1) ... [2023-08-30 03:14:34,179 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:34" (1/1) ... [2023-08-30 03:14:34,206 INFO L138 Inliner]: procedures = 180, calls = 75, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 179 [2023-08-30 03:14:34,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 03:14:34,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 03:14:34,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 03:14:34,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 03:14:34,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:34" (1/1) ... [2023-08-30 03:14:34,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:34" (1/1) ... [2023-08-30 03:14:34,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:34" (1/1) ... [2023-08-30 03:14:34,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:34" (1/1) ... [2023-08-30 03:14:34,245 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:34" (1/1) ... [2023-08-30 03:14:34,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:34" (1/1) ... [2023-08-30 03:14:34,248 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:34" (1/1) ... [2023-08-30 03:14:34,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:34" (1/1) ... [2023-08-30 03:14:34,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 03:14:34,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 03:14:34,258 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 03:14:34,258 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 03:14:34,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:34" (1/1) ... [2023-08-30 03:14:34,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:14:34,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 03:14:34,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 03:14:34,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-30 03:14:34,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 03:14:34,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 03:14:34,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 03:14:34,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 03:14:34,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 03:14:34,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 03:14:34,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 03:14:34,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-30 03:14:34,313 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 03:14:34,313 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 03:14:34,313 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 03:14:34,313 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 03:14:34,313 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 03:14:34,314 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 03:14:34,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 03:14:34,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 03:14:34,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 03:14:34,315 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 03:14:34,516 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 03:14:34,518 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 03:14:35,081 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 03:14:35,524 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 03:14:35,524 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 03:14:35,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:14:35 BoogieIcfgContainer [2023-08-30 03:14:35,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 03:14:35,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 03:14:35,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 03:14:35,537 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 03:14:35,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 03:14:33" (1/3) ... [2023-08-30 03:14:35,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5980bcde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:14:35, skipping insertion in model container [2023-08-30 03:14:35,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:34" (2/3) ... [2023-08-30 03:14:35,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5980bcde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:14:35, skipping insertion in model container [2023-08-30 03:14:35,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:14:35" (3/3) ... [2023-08-30 03:14:35,539 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_power.opt.i [2023-08-30 03:14:35,552 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 03:14:35,553 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 51 error locations. [2023-08-30 03:14:35,553 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 03:14:35,659 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 03:14:35,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 178 transitions, 371 flow [2023-08-30 03:14:35,769 INFO L130 PetriNetUnfolder]: 2/175 cut-off events. [2023-08-30 03:14:35,770 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:14:35,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 2/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 294 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2023-08-30 03:14:35,775 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 178 transitions, 371 flow [2023-08-30 03:14:35,783 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 183 places, 175 transitions, 359 flow [2023-08-30 03:14:35,786 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 03:14:35,797 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 175 transitions, 359 flow [2023-08-30 03:14:35,800 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 175 transitions, 359 flow [2023-08-30 03:14:35,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 175 transitions, 359 flow [2023-08-30 03:14:35,833 INFO L130 PetriNetUnfolder]: 2/175 cut-off events. [2023-08-30 03:14:35,833 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:14:35,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 2/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 290 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2023-08-30 03:14:35,837 INFO L119 LiptonReduction]: Number of co-enabled transitions 7064 [2023-08-30 03:14:54,307 INFO L134 LiptonReduction]: Checked pairs total: 36676 [2023-08-30 03:14:54,307 INFO L136 LiptonReduction]: Total number of compositions: 146 [2023-08-30 03:14:54,336 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 03:14:54,342 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;@17235687, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 03:14:54,343 INFO L358 AbstractCegarLoop]: Starting to check reachability of 91 error locations. [2023-08-30 03:14:54,345 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 03:14:54,345 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:14:54,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:54,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 03:14:54,346 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:14:54,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:54,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1195, now seen corresponding path program 1 times [2023-08-30 03:14:54,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:14:54,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753890988] [2023-08-30 03:14:54,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:54,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:14:54,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:14:54,369 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:14:54,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-30 03:14:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:54,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 03:14:54,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:14:54,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:54,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:14:54,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:14:54,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753890988] [2023-08-30 03:14:54,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [753890988] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:54,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:54,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 03:14:54,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647620291] [2023-08-30 03:14:54,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:54,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 03:14:54,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:14:54,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 03:14:54,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 03:14:54,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 324 [2023-08-30 03:14:54,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 77 transitions, 163 flow. Second operand has 2 states, 2 states have (on average 122.5) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:54,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:54,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 324 [2023-08-30 03:14:54,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:57,896 INFO L130 PetriNetUnfolder]: 20995/29870 cut-off events. [2023-08-30 03:14:57,897 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2023-08-30 03:14:57,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59273 conditions, 29870 events. 20995/29870 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 2434. Compared 203178 event pairs, 20995 based on Foata normal form. 540/13016 useless extension candidates. Maximal degree in co-relation 59262. Up to 29277 conditions per place. [2023-08-30 03:14:58,052 INFO L137 encePairwiseOnDemand]: 293/324 looper letters, 44 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2023-08-30 03:14:58,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 189 flow [2023-08-30 03:14:58,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 03:14:58,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 03:14:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 319 transitions. [2023-08-30 03:14:58,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49228395061728397 [2023-08-30 03:14:58,068 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 319 transitions. [2023-08-30 03:14:58,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 319 transitions. [2023-08-30 03:14:58,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:58,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 319 transitions. [2023-08-30 03:14:58,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 159.5) internal successors, (319), 2 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:58,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 324.0) internal successors, (972), 3 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:58,080 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 324.0) internal successors, (972), 3 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:58,082 INFO L175 Difference]: Start difference. First operand has 86 places, 77 transitions, 163 flow. Second operand 2 states and 319 transitions. [2023-08-30 03:14:58,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 189 flow [2023-08-30 03:14:58,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 46 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 03:14:58,089 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 98 flow [2023-08-30 03:14:58,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2023-08-30 03:14:58,093 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -32 predicate places. [2023-08-30 03:14:58,094 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 98 flow [2023-08-30 03:14:58,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 122.5) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:58,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:58,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-30 03:14:58,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-08-30 03:14:58,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:14:58,302 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:14:58,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:58,305 INFO L85 PathProgramCache]: Analyzing trace with hash 36581487, now seen corresponding path program 1 times [2023-08-30 03:14:58,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:14:58,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781857065] [2023-08-30 03:14:58,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:58,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:14:58,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:14:58,308 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:14:58,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-30 03:14:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:58,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:14:58,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:14:58,497 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-30 03:14:58,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-08-30 03:14:58,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:58,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:14:58,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:14:58,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781857065] [2023-08-30 03:14:58,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781857065] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:58,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:58,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:14:58,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367865169] [2023-08-30 03:14:58,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:58,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:14:58,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:14:58,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:14:58,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:14:58,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 324 [2023-08-30 03:14:58,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:58,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:58,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 324 [2023-08-30 03:14:58,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:00,506 INFO L130 PetriNetUnfolder]: 11471/16272 cut-off events. [2023-08-30 03:15:00,506 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:15:00,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32559 conditions, 16272 events. 11471/16272 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1025. Compared 99134 event pairs, 7295 based on Foata normal form. 0/8282 useless extension candidates. Maximal degree in co-relation 32556. Up to 8673 conditions per place. [2023-08-30 03:15:00,559 INFO L137 encePairwiseOnDemand]: 314/324 looper letters, 57 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-08-30 03:15:00,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 60 transitions, 244 flow [2023-08-30 03:15:00,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:15:00,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:15:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-08-30 03:15:00,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43621399176954734 [2023-08-30 03:15:00,563 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-08-30 03:15:00,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-08-30 03:15:00,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:00,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-08-30 03:15:00,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:00,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:00,568 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:00,568 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 98 flow. Second operand 3 states and 424 transitions. [2023-08-30 03:15:00,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 60 transitions, 244 flow [2023-08-30 03:15:00,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 244 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:15:00,569 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 112 flow [2023-08-30 03:15:00,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2023-08-30 03:15:00,570 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -31 predicate places. [2023-08-30 03:15:00,570 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 112 flow [2023-08-30 03:15:00,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:00,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:00,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-30 03:15:00,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-30 03:15:00,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:15:00,778 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:15:00,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:00,779 INFO L85 PathProgramCache]: Analyzing trace with hash 36581488, now seen corresponding path program 1 times [2023-08-30 03:15:00,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:15:00,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998291369] [2023-08-30 03:15:00,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:00,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:15:00,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:15:00,780 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:15:00,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-30 03:15:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:00,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 03:15:00,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:15:00,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 03:15:00,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-30 03:15:00,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:00,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:15:00,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:15:00,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998291369] [2023-08-30 03:15:00,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998291369] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:00,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:00,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:15:00,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966547393] [2023-08-30 03:15:00,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:00,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:15:00,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:15:00,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:15:00,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:15:00,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 324 [2023-08-30 03:15:00,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:00,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:00,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 324 [2023-08-30 03:15:00,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:01,689 INFO L130 PetriNetUnfolder]: 3178/4726 cut-off events. [2023-08-30 03:15:01,690 INFO L131 PetriNetUnfolder]: For 181/181 co-relation queries the response was YES. [2023-08-30 03:15:01,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10240 conditions, 4726 events. 3178/4726 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 25813 event pairs, 3178 based on Foata normal form. 0/3646 useless extension candidates. Maximal degree in co-relation 10235. Up to 4626 conditions per place. [2023-08-30 03:15:01,714 INFO L137 encePairwiseOnDemand]: 315/324 looper letters, 33 selfloop transitions, 1 changer transitions 0/36 dead transitions. [2023-08-30 03:15:01,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 36 transitions, 164 flow [2023-08-30 03:15:01,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:15:01,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:15:01,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-08-30 03:15:01,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41975308641975306 [2023-08-30 03:15:01,716 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-08-30 03:15:01,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-08-30 03:15:01,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:01,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-08-30 03:15:01,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:01,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:01,719 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:01,719 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 112 flow. Second operand 3 states and 408 transitions. [2023-08-30 03:15:01,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 36 transitions, 164 flow [2023-08-30 03:15:01,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 36 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:15:01,723 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 94 flow [2023-08-30 03:15:01,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2023-08-30 03:15:01,725 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -39 predicate places. [2023-08-30 03:15:01,727 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 94 flow [2023-08-30 03:15:01,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:01,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:01,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 03:15:01,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-08-30 03:15:01,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:15:01,935 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:15:01,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:01,936 INFO L85 PathProgramCache]: Analyzing trace with hash 796615777, now seen corresponding path program 1 times [2023-08-30 03:15:01,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:15:01,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837806863] [2023-08-30 03:15:01,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:01,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:15:01,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:15:01,957 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:15:01,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-30 03:15:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:02,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:15:02,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:15:02,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:02,073 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:15:02,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:15:02,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837806863] [2023-08-30 03:15:02,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837806863] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:02,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:02,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:15:02,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418252066] [2023-08-30 03:15:02,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:02,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:15:02,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:15:02,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:15:02,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:15:02,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 324 [2023-08-30 03:15:02,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:02,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:02,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 324 [2023-08-30 03:15:02,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:02,658 INFO L130 PetriNetUnfolder]: 2593/3816 cut-off events. [2023-08-30 03:15:02,659 INFO L131 PetriNetUnfolder]: For 178/178 co-relation queries the response was YES. [2023-08-30 03:15:02,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8330 conditions, 3816 events. 2593/3816 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 21350 event pairs, 350 based on Foata normal form. 0/3143 useless extension candidates. Maximal degree in co-relation 8325. Up to 3189 conditions per place. [2023-08-30 03:15:02,671 INFO L137 encePairwiseOnDemand]: 321/324 looper letters, 52 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2023-08-30 03:15:02,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 261 flow [2023-08-30 03:15:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:15:02,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:15:02,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-08-30 03:15:02,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43209876543209874 [2023-08-30 03:15:02,673 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-08-30 03:15:02,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-08-30 03:15:02,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:02,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-08-30 03:15:02,675 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-08-30 03:15:02,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:02,676 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:02,676 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 94 flow. Second operand 3 states and 420 transitions. [2023-08-30 03:15:02,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 261 flow [2023-08-30 03:15:02,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 58 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:15:02,678 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 93 flow [2023-08-30 03:15:02,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=45, 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=93, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-08-30 03:15:02,680 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -39 predicate places. [2023-08-30 03:15:02,680 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 93 flow [2023-08-30 03:15:02,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:02,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:02,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:15:02,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-30 03:15:02,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:15:02,888 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:15:02,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:02,889 INFO L85 PathProgramCache]: Analyzing trace with hash 147774835, now seen corresponding path program 1 times [2023-08-30 03:15:02,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:15:02,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433756900] [2023-08-30 03:15:02,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:02,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:15:02,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:15:02,891 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:15:02,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-30 03:15:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:02,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:15:02,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:15:03,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:03,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:15:03,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:15:03,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433756900] [2023-08-30 03:15:03,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433756900] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:03,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:03,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:15:03,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474055799] [2023-08-30 03:15:03,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:03,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:15:03,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:15:03,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:15:03,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:15:03,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 324 [2023-08-30 03:15:03,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:03,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:03,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 324 [2023-08-30 03:15:03,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:03,293 INFO L130 PetriNetUnfolder]: 976/1639 cut-off events. [2023-08-30 03:15:03,295 INFO L131 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2023-08-30 03:15:03,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3613 conditions, 1639 events. 976/1639 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 8593 event pairs, 327 based on Foata normal form. 27/1394 useless extension candidates. Maximal degree in co-relation 3608. Up to 1460 conditions per place. [2023-08-30 03:15:03,301 INFO L137 encePairwiseOnDemand]: 319/324 looper letters, 43 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2023-08-30 03:15:03,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 49 transitions, 223 flow [2023-08-30 03:15:03,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:15:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:15:03,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-08-30 03:15:03,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41358024691358025 [2023-08-30 03:15:03,303 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-08-30 03:15:03,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-08-30 03:15:03,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:03,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-08-30 03:15:03,304 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-08-30 03:15:03,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:03,306 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:03,306 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 93 flow. Second operand 3 states and 402 transitions. [2023-08-30 03:15:03,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 49 transitions, 223 flow [2023-08-30 03:15:03,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 217 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:15:03,308 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 115 flow [2023-08-30 03:15:03,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2023-08-30 03:15:03,308 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -39 predicate places. [2023-08-30 03:15:03,308 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 115 flow [2023-08-30 03:15:03,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:03,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:03,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:15:03,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-08-30 03:15:03,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:15:03,516 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:15:03,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:03,516 INFO L85 PathProgramCache]: Analyzing trace with hash -330528693, now seen corresponding path program 1 times [2023-08-30 03:15:03,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:15:03,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10829192] [2023-08-30 03:15:03,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:03,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:15:03,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:15:03,518 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:15:03,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-30 03:15:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:03,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:15:03,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:15:03,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:03,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:15:03,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:15:03,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10829192] [2023-08-30 03:15:03,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10829192] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:03,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:03,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:15:03,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208620984] [2023-08-30 03:15:03,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:03,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:15:03,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:15:03,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:15:03,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:15:03,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 324 [2023-08-30 03:15:03,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:03,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:03,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 324 [2023-08-30 03:15:03,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:03,892 INFO L130 PetriNetUnfolder]: 255/507 cut-off events. [2023-08-30 03:15:03,893 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2023-08-30 03:15:03,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 507 events. 255/507 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2056 event pairs, 91 based on Foata normal form. 27/480 useless extension candidates. Maximal degree in co-relation 1227. Up to 238 conditions per place. [2023-08-30 03:15:03,895 INFO L137 encePairwiseOnDemand]: 319/324 looper letters, 52 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2023-08-30 03:15:03,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 293 flow [2023-08-30 03:15:03,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:15:03,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:15:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 532 transitions. [2023-08-30 03:15:03,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4104938271604938 [2023-08-30 03:15:03,897 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 532 transitions. [2023-08-30 03:15:03,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 532 transitions. [2023-08-30 03:15:03,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:03,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 532 transitions. [2023-08-30 03:15:03,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:03,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:03,900 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:03,901 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 115 flow. Second operand 4 states and 532 transitions. [2023-08-30 03:15:03,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 293 flow [2023-08-30 03:15:03,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 289 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:15:03,902 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 151 flow [2023-08-30 03:15:03,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-08-30 03:15:03,903 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -36 predicate places. [2023-08-30 03:15:03,903 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 151 flow [2023-08-30 03:15:03,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:03,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:03,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:15:03,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-30 03:15:04,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:15:04,112 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:15:04,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:04,113 INFO L85 PathProgramCache]: Analyzing trace with hash 922643588, now seen corresponding path program 1 times [2023-08-30 03:15:04,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:15:04,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922535523] [2023-08-30 03:15:04,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:04,113 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:15:04,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:15:04,115 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:15:04,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-30 03:15:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:04,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 03:15:04,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:15:04,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:04,297 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:15:04,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:15:04,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922535523] [2023-08-30 03:15:04,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922535523] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:04,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:04,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:15:04,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665334956] [2023-08-30 03:15:04,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:04,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:15:04,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:15:04,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:15:04,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:15:04,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 324 [2023-08-30 03:15:04,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:04,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:04,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 324 [2023-08-30 03:15:04,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:04,555 INFO L130 PetriNetUnfolder]: 162/306 cut-off events. [2023-08-30 03:15:04,556 INFO L131 PetriNetUnfolder]: For 225/225 co-relation queries the response was YES. [2023-08-30 03:15:04,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 306 events. 162/306 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1017 event pairs, 70 based on Foata normal form. 9/310 useless extension candidates. Maximal degree in co-relation 824. Up to 134 conditions per place. [2023-08-30 03:15:04,557 INFO L137 encePairwiseOnDemand]: 319/324 looper letters, 42 selfloop transitions, 10 changer transitions 1/55 dead transitions. [2023-08-30 03:15:04,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 281 flow [2023-08-30 03:15:04,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:15:04,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:15:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 644 transitions. [2023-08-30 03:15:04,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39753086419753086 [2023-08-30 03:15:04,559 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 644 transitions. [2023-08-30 03:15:04,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 644 transitions. [2023-08-30 03:15:04,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:04,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 644 transitions. [2023-08-30 03:15:04,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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-08-30 03:15:04,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 324.0) internal successors, (1944), 6 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:04,562 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 324.0) internal successors, (1944), 6 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:04,563 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 151 flow. Second operand 5 states and 644 transitions. [2023-08-30 03:15:04,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 281 flow [2023-08-30 03:15:04,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 265 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 03:15:04,565 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 137 flow [2023-08-30 03:15:04,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-08-30 03:15:04,565 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -40 predicate places. [2023-08-30 03:15:04,565 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 137 flow [2023-08-30 03:15:04,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:04,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:04,566 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] [2023-08-30 03:15:04,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-30 03:15:04,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:15:04,773 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:15:04,774 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:04,774 INFO L85 PathProgramCache]: Analyzing trace with hash 13421208, now seen corresponding path program 1 times [2023-08-30 03:15:04,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:15:04,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838421411] [2023-08-30 03:15:04,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:04,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:15:04,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:15:04,794 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:15:04,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-30 03:15:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:04,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 03:15:04,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:15:05,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-30 03:15:05,051 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 6 treesize of output 5 [2023-08-30 03:15:06,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:06,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:15:06,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:15:06,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838421411] [2023-08-30 03:15:06,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838421411] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:06,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:06,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:15:06,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339901159] [2023-08-30 03:15:06,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:06,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:15:06,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:15:06,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:15:06,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:15:06,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 324 [2023-08-30 03:15:06,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 137 flow. Second operand has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:06,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:06,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 324 [2023-08-30 03:15:06,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:07,035 INFO L130 PetriNetUnfolder]: 229/446 cut-off events. [2023-08-30 03:15:07,036 INFO L131 PetriNetUnfolder]: For 479/479 co-relation queries the response was YES. [2023-08-30 03:15:07,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1288 conditions, 446 events. 229/446 cut-off events. For 479/479 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1787 event pairs, 78 based on Foata normal form. 0/442 useless extension candidates. Maximal degree in co-relation 1281. Up to 127 conditions per place. [2023-08-30 03:15:07,039 INFO L137 encePairwiseOnDemand]: 318/324 looper letters, 71 selfloop transitions, 10 changer transitions 0/83 dead transitions. [2023-08-30 03:15:07,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 83 transitions, 535 flow [2023-08-30 03:15:07,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 03:15:07,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 03:15:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1009 transitions. [2023-08-30 03:15:07,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38927469135802467 [2023-08-30 03:15:07,043 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1009 transitions. [2023-08-30 03:15:07,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1009 transitions. [2023-08-30 03:15:07,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:07,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1009 transitions. [2023-08-30 03:15:07,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.125) internal successors, (1009), 8 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:07,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 324.0) internal successors, (2916), 9 states have internal predecessors, (2916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:07,050 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 324.0) internal successors, (2916), 9 states have internal predecessors, (2916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:07,051 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 137 flow. Second operand 8 states and 1009 transitions. [2023-08-30 03:15:07,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 83 transitions, 535 flow [2023-08-30 03:15:07,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 83 transitions, 465 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-30 03:15:07,055 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 158 flow [2023-08-30 03:15:07,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=158, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-08-30 03:15:07,056 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -36 predicate places. [2023-08-30 03:15:07,056 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 158 flow [2023-08-30 03:15:07,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:07,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:07,057 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] [2023-08-30 03:15:07,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-30 03:15:07,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:15:07,270 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:15:07,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:07,270 INFO L85 PathProgramCache]: Analyzing trace with hash -719606114, now seen corresponding path program 1 times [2023-08-30 03:15:07,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:15:07,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241780326] [2023-08-30 03:15:07,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:07,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:15:07,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:15:07,273 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:15:07,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 (10)] Waiting until timeout for monitored process [2023-08-30 03:15:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:07,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:15:07,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:15:07,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:07,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:15:07,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:15:07,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241780326] [2023-08-30 03:15:07,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241780326] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:07,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:07,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:15:07,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371038004] [2023-08-30 03:15:07,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:07,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:15:07,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:15:07,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:15:07,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:15:07,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 324 [2023-08-30 03:15:07,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:07,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:07,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 324 [2023-08-30 03:15:07,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:07,661 INFO L130 PetriNetUnfolder]: 336/642 cut-off events. [2023-08-30 03:15:07,662 INFO L131 PetriNetUnfolder]: For 721/721 co-relation queries the response was YES. [2023-08-30 03:15:07,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2103 conditions, 642 events. 336/642 cut-off events. For 721/721 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2685 event pairs, 129 based on Foata normal form. 0/636 useless extension candidates. Maximal degree in co-relation 2094. Up to 276 conditions per place. [2023-08-30 03:15:07,664 INFO L137 encePairwiseOnDemand]: 320/324 looper letters, 66 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2023-08-30 03:15:07,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 70 transitions, 444 flow [2023-08-30 03:15:07,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:15:07,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:15:07,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 517 transitions. [2023-08-30 03:15:07,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39891975308641975 [2023-08-30 03:15:07,666 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 517 transitions. [2023-08-30 03:15:07,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 517 transitions. [2023-08-30 03:15:07,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:07,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 517 transitions. [2023-08-30 03:15:07,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:07,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:07,669 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:07,669 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 158 flow. Second operand 4 states and 517 transitions. [2023-08-30 03:15:07,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 70 transitions, 444 flow [2023-08-30 03:15:07,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 70 transitions, 443 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:15:07,672 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 171 flow [2023-08-30 03:15:07,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2023-08-30 03:15:07,673 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -33 predicate places. [2023-08-30 03:15:07,673 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 171 flow [2023-08-30 03:15:07,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:07,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:07,674 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] [2023-08-30 03:15:07,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-30 03:15:07,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:15:07,892 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:15:07,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:07,893 INFO L85 PathProgramCache]: Analyzing trace with hash -502792789, now seen corresponding path program 1 times [2023-08-30 03:15:07,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:15:07,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784383595] [2023-08-30 03:15:07,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:07,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:15:07,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:15:07,895 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:15:07,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-30 03:15:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:08,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:15:08,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:15:08,190 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 6 treesize of output 5 [2023-08-30 03:15:08,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-30 03:15:09,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:09,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:15:09,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:15:09,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784383595] [2023-08-30 03:15:09,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784383595] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:09,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:09,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:15:09,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958629086] [2023-08-30 03:15:09,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:09,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:15:09,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:15:09,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:15:09,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:15:09,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 324 [2023-08-30 03:15:09,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 171 flow. Second operand has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:09,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:09,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 324 [2023-08-30 03:15:09,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:09,622 INFO L130 PetriNetUnfolder]: 302/592 cut-off events. [2023-08-30 03:15:09,622 INFO L131 PetriNetUnfolder]: For 685/685 co-relation queries the response was YES. [2023-08-30 03:15:09,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2015 conditions, 592 events. 302/592 cut-off events. For 685/685 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2582 event pairs, 121 based on Foata normal form. 0/592 useless extension candidates. Maximal degree in co-relation 2005. Up to 155 conditions per place. [2023-08-30 03:15:09,625 INFO L137 encePairwiseOnDemand]: 317/324 looper letters, 70 selfloop transitions, 12 changer transitions 0/83 dead transitions. [2023-08-30 03:15:09,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 83 transitions, 541 flow [2023-08-30 03:15:09,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 03:15:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 03:15:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 975 transitions. [2023-08-30 03:15:09,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3761574074074074 [2023-08-30 03:15:09,644 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 975 transitions. [2023-08-30 03:15:09,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 975 transitions. [2023-08-30 03:15:09,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:09,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 975 transitions. [2023-08-30 03:15:09,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.875) internal successors, (975), 8 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:09,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 324.0) internal successors, (2916), 9 states have internal predecessors, (2916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:09,664 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 324.0) internal successors, (2916), 9 states have internal predecessors, (2916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:09,664 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 171 flow. Second operand 8 states and 975 transitions. [2023-08-30 03:15:09,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 83 transitions, 541 flow [2023-08-30 03:15:09,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 83 transitions, 535 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:15:09,668 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 191 flow [2023-08-30 03:15:09,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=191, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2023-08-30 03:15:09,670 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -29 predicate places. [2023-08-30 03:15:09,670 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 191 flow [2023-08-30 03:15:09,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:09,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:09,671 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] [2023-08-30 03:15:09,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-30 03:15:09,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:15:09,872 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:15:09,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:09,872 INFO L85 PathProgramCache]: Analyzing trace with hash -659390110, now seen corresponding path program 2 times [2023-08-30 03:15:09,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:15:09,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010690758] [2023-08-30 03:15:09,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 03:15:09,873 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:15:09,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:15:09,879 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:15:09,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-30 03:15:10,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 03:15:10,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:15:10,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 03:15:10,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:15:11,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 33 [2023-08-30 03:15:11,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-08-30 03:15:12,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 36 [2023-08-30 03:15:12,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-08-30 03:15:12,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:12,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:15:12,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:15:12,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010690758] [2023-08-30 03:15:12,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010690758] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:12,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:12,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 03:15:12,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899768361] [2023-08-30 03:15:12,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:12,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 03:15:12,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:15:12,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 03:15:12,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-30 03:15:13,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 324 [2023-08-30 03:15:13,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 191 flow. Second operand has 9 states, 9 states have (on average 110.22222222222223) internal successors, (992), 9 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:13,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:13,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 324 [2023-08-30 03:15:13,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:14,481 INFO L130 PetriNetUnfolder]: 393/808 cut-off events. [2023-08-30 03:15:14,482 INFO L131 PetriNetUnfolder]: For 1064/1064 co-relation queries the response was YES. [2023-08-30 03:15:14,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2841 conditions, 808 events. 393/808 cut-off events. For 1064/1064 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4201 event pairs, 81 based on Foata normal form. 1/809 useless extension candidates. Maximal degree in co-relation 2831. Up to 284 conditions per place. [2023-08-30 03:15:14,486 INFO L137 encePairwiseOnDemand]: 317/324 looper letters, 97 selfloop transitions, 16 changer transitions 0/114 dead transitions. [2023-08-30 03:15:14,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 114 transitions, 759 flow [2023-08-30 03:15:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:15:14,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:15:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 829 transitions. [2023-08-30 03:15:14,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3655202821869489 [2023-08-30 03:15:14,514 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 829 transitions. [2023-08-30 03:15:14,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 829 transitions. [2023-08-30 03:15:14,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:14,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 829 transitions. [2023-08-30 03:15:14,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.42857142857143) internal successors, (829), 7 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:14,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 324.0) internal successors, (2592), 8 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:14,519 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 324.0) internal successors, (2592), 8 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:14,520 INFO L175 Difference]: Start difference. First operand has 57 places, 40 transitions, 191 flow. Second operand 7 states and 829 transitions. [2023-08-30 03:15:14,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 114 transitions, 759 flow [2023-08-30 03:15:14,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 114 transitions, 733 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-30 03:15:14,527 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 268 flow [2023-08-30 03:15:14,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=268, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2023-08-30 03:15:14,528 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -25 predicate places. [2023-08-30 03:15:14,528 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 268 flow [2023-08-30 03:15:14,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.22222222222223) internal successors, (992), 9 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:14,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:14,544 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] [2023-08-30 03:15:14,571 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-08-30 03:15:14,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:15:14,754 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-08-30 03:15:14,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:14,754 INFO L85 PathProgramCache]: Analyzing trace with hash -673613338, now seen corresponding path program 3 times [2023-08-30 03:15:14,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:15:14,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343946407] [2023-08-30 03:15:14,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 03:15:14,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:15:14,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:15:14,766 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:15:14,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-30 03:15:14,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 03:15:14,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 03:15:14,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 03:15:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:15:15,153 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 03:15:15,154 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 03:15:15,154 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (90 of 91 remaining) [2023-08-30 03:15:15,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 91 remaining) [2023-08-30 03:15:15,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 91 remaining) [2023-08-30 03:15:15,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 91 remaining) [2023-08-30 03:15:15,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 91 remaining) [2023-08-30 03:15:15,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 91 remaining) [2023-08-30 03:15:15,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 91 remaining) [2023-08-30 03:15:15,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 91 remaining) [2023-08-30 03:15:15,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 91 remaining) [2023-08-30 03:15:15,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 91 remaining) [2023-08-30 03:15:15,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 91 remaining) [2023-08-30 03:15:15,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 91 remaining) [2023-08-30 03:15:15,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 91 remaining) [2023-08-30 03:15:15,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (77 of 91 remaining) [2023-08-30 03:15:15,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 91 remaining) [2023-08-30 03:15:15,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 91 remaining) [2023-08-30 03:15:15,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 91 remaining) [2023-08-30 03:15:15,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 91 remaining) [2023-08-30 03:15:15,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 91 remaining) [2023-08-30 03:15:15,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 91 remaining) [2023-08-30 03:15:15,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 91 remaining) [2023-08-30 03:15:15,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 91 remaining) [2023-08-30 03:15:15,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 91 remaining) [2023-08-30 03:15:15,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 91 remaining) [2023-08-30 03:15:15,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 91 remaining) [2023-08-30 03:15:15,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 91 remaining) [2023-08-30 03:15:15,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 91 remaining) [2023-08-30 03:15:15,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 91 remaining) [2023-08-30 03:15:15,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 91 remaining) [2023-08-30 03:15:15,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 91 remaining) [2023-08-30 03:15:15,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 91 remaining) [2023-08-30 03:15:15,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 91 remaining) [2023-08-30 03:15:15,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 91 remaining) [2023-08-30 03:15:15,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 91 remaining) [2023-08-30 03:15:15,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 91 remaining) [2023-08-30 03:15:15,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 91 remaining) [2023-08-30 03:15:15,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 91 remaining) [2023-08-30 03:15:15,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 91 remaining) [2023-08-30 03:15:15,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 91 remaining) [2023-08-30 03:15:15,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 91 remaining) [2023-08-30 03:15:15,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 91 remaining) [2023-08-30 03:15:15,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 91 remaining) [2023-08-30 03:15:15,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 91 remaining) [2023-08-30 03:15:15,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 91 remaining) [2023-08-30 03:15:15,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 91 remaining) [2023-08-30 03:15:15,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 91 remaining) [2023-08-30 03:15:15,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 91 remaining) [2023-08-30 03:15:15,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 91 remaining) [2023-08-30 03:15:15,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 91 remaining) [2023-08-30 03:15:15,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 91 remaining) [2023-08-30 03:15:15,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (40 of 91 remaining) [2023-08-30 03:15:15,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 91 remaining) [2023-08-30 03:15:15,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 91 remaining) [2023-08-30 03:15:15,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 91 remaining) [2023-08-30 03:15:15,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 91 remaining) [2023-08-30 03:15:15,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 91 remaining) [2023-08-30 03:15:15,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 91 remaining) [2023-08-30 03:15:15,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 91 remaining) [2023-08-30 03:15:15,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 91 remaining) [2023-08-30 03:15:15,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 91 remaining) [2023-08-30 03:15:15,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 91 remaining) [2023-08-30 03:15:15,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 91 remaining) [2023-08-30 03:15:15,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 91 remaining) [2023-08-30 03:15:15,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 91 remaining) [2023-08-30 03:15:15,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 91 remaining) [2023-08-30 03:15:15,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 91 remaining) [2023-08-30 03:15:15,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 91 remaining) [2023-08-30 03:15:15,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 91 remaining) [2023-08-30 03:15:15,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 91 remaining) [2023-08-30 03:15:15,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 91 remaining) [2023-08-30 03:15:15,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 91 remaining) [2023-08-30 03:15:15,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 91 remaining) [2023-08-30 03:15:15,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 91 remaining) [2023-08-30 03:15:15,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 91 remaining) [2023-08-30 03:15:15,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 91 remaining) [2023-08-30 03:15:15,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 91 remaining) [2023-08-30 03:15:15,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 91 remaining) [2023-08-30 03:15:15,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 91 remaining) [2023-08-30 03:15:15,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 91 remaining) [2023-08-30 03:15:15,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 91 remaining) [2023-08-30 03:15:15,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 91 remaining) [2023-08-30 03:15:15,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 91 remaining) [2023-08-30 03:15:15,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 91 remaining) [2023-08-30 03:15:15,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 91 remaining) [2023-08-30 03:15:15,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 91 remaining) [2023-08-30 03:15:15,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 91 remaining) [2023-08-30 03:15:15,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 91 remaining) [2023-08-30 03:15:15,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 91 remaining) [2023-08-30 03:15:15,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 91 remaining) [2023-08-30 03:15:15,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 91 remaining) [2023-08-30 03:15:15,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 91 remaining) [2023-08-30 03:15:15,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-08-30 03:15:15,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:15:15,379 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:15:15,384 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 03:15:15,384 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 03:15:15,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:15:15 BasicIcfg [2023-08-30 03:15:15,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 03:15:15,440 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 03:15:15,440 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 03:15:15,440 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 03:15:15,441 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:14:35" (3/4) ... [2023-08-30 03:15:15,443 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 03:15:15,443 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 03:15:15,443 INFO L158 Benchmark]: Toolchain (without parser) took 41794.11ms. Allocated memory was 79.7MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 55.7MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 886.1MB. Max. memory is 16.1GB. [2023-08-30 03:15:15,443 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 54.5MB. Free memory is still 32.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:15:15,444 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.04ms. Allocated memory is still 79.7MB. Free memory was 55.4MB in the beginning and 49.7MB in the end (delta: 5.7MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2023-08-30 03:15:15,444 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.80ms. Allocated memory is still 79.7MB. Free memory was 49.7MB in the beginning and 47.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:15:15,444 INFO L158 Benchmark]: Boogie Preprocessor took 49.37ms. Allocated memory is still 79.7MB. Free memory was 47.0MB in the beginning and 44.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:15:15,444 INFO L158 Benchmark]: RCFGBuilder took 1268.10ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 44.3MB in the beginning and 48.0MB in the end (delta: -3.7MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. [2023-08-30 03:15:15,444 INFO L158 Benchmark]: TraceAbstraction took 39905.46ms. Allocated memory was 117.4MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 87.0MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 877.0MB. Max. memory is 16.1GB. [2023-08-30 03:15:15,445 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 3.9GB. Free memory is still 3.0GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:15:15,446 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 54.5MB. Free memory is still 32.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 494.04ms. Allocated memory is still 79.7MB. Free memory was 55.4MB in the beginning and 49.7MB in the end (delta: 5.7MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.80ms. Allocated memory is still 79.7MB. Free memory was 49.7MB in the beginning and 47.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.37ms. Allocated memory is still 79.7MB. Free memory was 47.0MB in the beginning and 44.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1268.10ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 44.3MB in the beginning and 48.0MB in the end (delta: -3.7MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. * TraceAbstraction took 39905.46ms. Allocated memory was 117.4MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 87.0MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 877.0MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 3.9GB. Free memory is still 3.0GB. 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: 18.5s, 183 PlacesBefore, 86 PlacesAfterwards, 175 TransitionsBefore, 77 TransitionsAfterwards, 7064 CoEnabledTransitionPairs, 7 FixpointIterations, 71 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 146 TotalNumberOfCompositions, 36676 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9637, independent: 9025, independent conditional: 0, independent unconditional: 9025, dependent: 612, dependent conditional: 0, dependent unconditional: 612, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2814, independent: 2714, independent conditional: 0, independent unconditional: 2714, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9637, independent: 6311, independent conditional: 0, independent unconditional: 6311, dependent: 512, dependent conditional: 0, dependent unconditional: 512, unknown: 2814, unknown conditional: 0, unknown unconditional: 2814] , Statistics on independence cache: Total cache size (in pairs): 428, Positive cache size: 378, Positive conditional cache size: 0, Positive unconditional cache size: 378, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L718] 0 int __unbuffered_p2_EAX$mem_tmp; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L859] 0 pthread_t t2204; [L860] FCALL, FORK 0 pthread_create(&t2204, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2204, ((void *)0), P0, ((void *)0))=-2, t2204={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L861] 0 pthread_t t2205; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2204={7:0}, t2205={14:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L862] FCALL, FORK 0 pthread_create(&t2205, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2205, ((void *)0), P1, ((void *)0))=-1, t2204={7:0}, t2205={14:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L863] 0 pthread_t t2206; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2204={7:0}, t2205={14:0}, t2206={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L864] FCALL, FORK 0 pthread_create(&t2206, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2206, ((void *)0), P2, ((void *)0))=0, t2204={7:0}, t2205={14:0}, t2206={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 x$flush_delayed = weak$$choice2 [L818] EXPR 3 \read(x) [L818] 3 x$mem_tmp = x [L819] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] EXPR 3 \read(x) [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L821] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L822] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L823] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L824] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L825] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L826] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L827] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L828] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L829] EXPR 3 \read(x) [L829] 3 __unbuffered_p2_EAX = x [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] EXPR 3 \read(x) [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] 3 x = x$flush_delayed ? x$mem_tmp : x [L831] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L834] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L761] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EBX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 \read(x) [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L789] 2 x$w_buff1 = x$w_buff0 [L790] 2 x$w_buff0 = 1 [L791] 2 x$w_buff1_used = x$w_buff0_used [L792] 2 x$w_buff0_used = (_Bool)1 [L793] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L793] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L794] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L795] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L796] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L797] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L798] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 \read(x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L838] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L839] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L840] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L841] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L801] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L802] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L803] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L804] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L805] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 2 return 0; [L844] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 3 return 0; [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 \read(x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2204={7:0}, t2205={14:0}, t2206={15:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L877] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L879] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=2, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 862]: 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: 864]: 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: 860]: 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 7 procedures, 239 locations, 91 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: 39.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 18.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 790 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 577 mSDsluCounter, 234 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 203 mSDsCounter, 165 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2131 IncrementalHoareTripleChecker+Invalid, 2296 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 165 mSolverCounterUnsat, 31 mSDtfsCounter, 2131 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred in iteration=11, InterpolantAutomatonStates: 50, 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.5s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 1305 SizeOfPredicates, 49 NumberOfNonLiveVariables, 1591 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 03:15:15,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample