./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread/bigshot_s.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/bigshot_s.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 4d8c741fd238f074816319de9a9bd5d97cd9b35eb7f53a276be973ea0c31ecbe --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 02:06:16,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:06:16,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:06:16,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:06:16,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:06:16,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:06:16,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:06:16,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:06:16,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:06:16,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:06:16,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:06:16,521 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:06:16,522 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:06:16,524 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:06:16,525 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:06:16,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:06:16,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:06:16,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:06:16,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:06:16,539 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:06:16,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:06:16,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:06:16,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:06:16,544 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:06:16,551 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:06:16,552 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:06:16,552 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:06:16,554 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:06:16,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:06:16,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:06:16,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:06:16,560 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:06:16,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:06:16,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:06:16,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:06:16,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:06:16,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:06:16,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:06:16,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:06:16,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:06:16,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:06:16,568 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 02:06:16,598 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:06:16,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:06:16,600 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:06:16,600 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:06:16,601 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:06:16,601 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:06:16,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:06:16,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:06:16,602 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:06:16,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:06:16,603 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:06:16,603 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:06:16,603 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:06:16,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:06:16,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:06:16,604 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:06:16,604 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:06:16,604 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:06:16,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:06:16,604 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:06:16,605 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:06:16,605 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:06:16,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:06:16,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:06:16,605 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:06:16,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:06:16,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:06:16,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:06:16,606 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:06:16,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:06:16,607 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:06:16,607 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:06:16,607 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:06:16,607 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:06:16,607 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 -> 4d8c741fd238f074816319de9a9bd5d97cd9b35eb7f53a276be973ea0c31ecbe 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 02:06:16,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:06:16,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:06:16,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:06:16,916 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:06:16,916 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:06:16,917 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/bigshot_s.i [2023-08-30 02:06:18,075 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:06:18,333 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:06:18,333 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s.i [2023-08-30 02:06:18,362 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b9caf913/31f99509446c4ef78b6e48a2067c0a4e/FLAG987010fb1 [2023-08-30 02:06:18,380 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b9caf913/31f99509446c4ef78b6e48a2067c0a4e [2023-08-30 02:06:18,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:06:18,383 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:06:18,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:06:18,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:06:18,388 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:06:18,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:06:18" (1/1) ... [2023-08-30 02:06:18,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@81f50cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:18, skipping insertion in model container [2023-08-30 02:06:18,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:06:18" (1/1) ... [2023-08-30 02:06:18,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:06:18,438 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:06:18,856 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/bigshot_s.i[55202,55215] [2023-08-30 02:06:18,866 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:06:18,882 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:06:18,917 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/bigshot_s.i[55202,55215] [2023-08-30 02:06:18,922 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:06:18,992 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:06:18,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:18 WrapperNode [2023-08-30 02:06:18,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:06:18,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:06:18,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:06:18,994 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:06:18,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:18" (1/1) ... [2023-08-30 02:06:19,014 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:18" (1/1) ... [2023-08-30 02:06:19,032 INFO L138 Inliner]: procedures = 323, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2023-08-30 02:06:19,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:06:19,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:06:19,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:06:19,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:06:19,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:18" (1/1) ... [2023-08-30 02:06:19,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:18" (1/1) ... [2023-08-30 02:06:19,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:18" (1/1) ... [2023-08-30 02:06:19,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:18" (1/1) ... [2023-08-30 02:06:19,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:18" (1/1) ... [2023-08-30 02:06:19,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:18" (1/1) ... [2023-08-30 02:06:19,090 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:18" (1/1) ... [2023-08-30 02:06:19,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:18" (1/1) ... [2023-08-30 02:06:19,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:06:19,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:06:19,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:06:19,094 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:06:19,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:18" (1/1) ... [2023-08-30 02:06:19,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:06:19,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:06:19,125 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 02:06:19,132 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 02:06:19,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:06:19,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:06:19,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-08-30 02:06:19,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 02:06:19,157 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-30 02:06:19,158 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-30 02:06:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-30 02:06:19,158 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-30 02:06:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:06:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-30 02:06:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:06:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:06:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:06:19,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:06:19,160 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 02:06:19,297 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:06:19,299 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:06:19,608 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:06:19,614 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:06:19,616 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-08-30 02:06:19,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:06:19 BoogieIcfgContainer [2023-08-30 02:06:19,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:06:19,621 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:06:19,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:06:19,624 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:06:19,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:06:18" (1/3) ... [2023-08-30 02:06:19,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce2c8cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:06:19, skipping insertion in model container [2023-08-30 02:06:19,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:06:18" (2/3) ... [2023-08-30 02:06:19,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce2c8cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:06:19, skipping insertion in model container [2023-08-30 02:06:19,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:06:19" (3/3) ... [2023-08-30 02:06:19,627 INFO L112 eAbstractionObserver]: Analyzing ICFG bigshot_s.i [2023-08-30 02:06:19,641 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:06:19,641 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-08-30 02:06:19,642 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:06:19,751 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-30 02:06:19,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 111 transitions, 238 flow [2023-08-30 02:06:19,839 INFO L130 PetriNetUnfolder]: 5/109 cut-off events. [2023-08-30 02:06:19,840 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 02:06:19,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 109 events. 5/109 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 134 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-08-30 02:06:19,844 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 111 transitions, 238 flow [2023-08-30 02:06:19,850 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 105 transitions, 222 flow [2023-08-30 02:06:19,853 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:06:19,861 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 105 transitions, 222 flow [2023-08-30 02:06:19,863 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 105 transitions, 222 flow [2023-08-30 02:06:19,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 105 transitions, 222 flow [2023-08-30 02:06:19,883 INFO L130 PetriNetUnfolder]: 5/105 cut-off events. [2023-08-30 02:06:19,883 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 02:06:19,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 105 events. 5/105 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 134 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-30 02:06:19,884 INFO L119 LiptonReduction]: Number of co-enabled transitions 340 [2023-08-30 02:06:23,967 INFO L134 LiptonReduction]: Checked pairs total: 461 [2023-08-30 02:06:23,967 INFO L136 LiptonReduction]: Total number of compositions: 121 [2023-08-30 02:06:23,981 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:06:23,986 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;@419be806, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:06:23,987 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-08-30 02:06:23,988 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:06:23,988 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:06:23,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:23,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:06:23,989 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:23,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:23,993 INFO L85 PathProgramCache]: Analyzing trace with hash 431, now seen corresponding path program 1 times [2023-08-30 02:06:23,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:23,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728561304] [2023-08-30 02:06:23,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:24,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:24,093 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 02:06:24,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:24,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728561304] [2023-08-30 02:06:24,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728561304] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:24,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:24,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:06:24,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362339536] [2023-08-30 02:06:24,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:24,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:06:24,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:24,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:06:24,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:06:24,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 232 [2023-08-30 02:06:24,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states 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 02:06:24,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:24,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 232 [2023-08-30 02:06:24,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:24,192 INFO L130 PetriNetUnfolder]: 26/69 cut-off events. [2023-08-30 02:06:24,192 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 02:06:24,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 69 events. 26/69 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 176 event pairs, 18 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 114. Up to 69 conditions per place. [2023-08-30 02:06:24,194 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 26 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-08-30 02:06:24,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 118 flow [2023-08-30 02:06:24,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:06:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:06:24,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 238 transitions. [2023-08-30 02:06:24,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5129310344827587 [2023-08-30 02:06:24,208 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 238 transitions. [2023-08-30 02:06:24,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 238 transitions. [2023-08-30 02:06:24,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:24,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 238 transitions. [2023-08-30 02:06:24,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states 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 02:06:24,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states 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 02:06:24,221 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states 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 02:06:24,222 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 74 flow. Second operand 2 states and 238 transitions. [2023-08-30 02:06:24,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 118 flow [2023-08-30 02:06:24,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:06:24,227 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 58 flow [2023-08-30 02:06:24,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=27} [2023-08-30 02:06:24,232 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -7 predicate places. [2023-08-30 02:06:24,232 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 58 flow [2023-08-30 02:06:24,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states 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 02:06:24,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:24,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:06:24,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:06:24,234 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:24,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:24,235 INFO L85 PathProgramCache]: Analyzing trace with hash 422238, now seen corresponding path program 1 times [2023-08-30 02:06:24,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:24,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695539997] [2023-08-30 02:06:24,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:24,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:24,480 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 02:06:24,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:24,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695539997] [2023-08-30 02:06:24,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695539997] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:24,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:24,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:06:24,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293680298] [2023-08-30 02:06:24,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:24,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:06:24,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:24,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:06:24,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:06:24,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 232 [2023-08-30 02:06:24,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states 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 02:06:24,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:24,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 232 [2023-08-30 02:06:24,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:24,592 INFO L130 PetriNetUnfolder]: 25/66 cut-off events. [2023-08-30 02:06:24,592 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:06:24,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 66 events. 25/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 167 event pairs, 17 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 133. Up to 64 conditions per place. [2023-08-30 02:06:24,593 INFO L137 encePairwiseOnDemand]: 229/232 looper letters, 23 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2023-08-30 02:06:24,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 106 flow [2023-08-30 02:06:24,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:06:24,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:06:24,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-08-30 02:06:24,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4468390804597701 [2023-08-30 02:06:24,599 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-08-30 02:06:24,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-08-30 02:06:24,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:24,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-08-30 02:06:24,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states 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 02:06:24,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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 02:06:24,605 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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 02:06:24,605 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 58 flow. Second operand 3 states and 311 transitions. [2023-08-30 02:06:24,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 106 flow [2023-08-30 02:06:24,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:06:24,606 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 60 flow [2023-08-30 02:06:24,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2023-08-30 02:06:24,607 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-30 02:06:24,607 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 60 flow [2023-08-30 02:06:24,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states 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 02:06:24,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:24,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:06:24,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:06:24,608 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:24,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:24,609 INFO L85 PathProgramCache]: Analyzing trace with hash 422239, now seen corresponding path program 1 times [2023-08-30 02:06:24,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:24,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018165866] [2023-08-30 02:06:24,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:24,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:24,716 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 02:06:24,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:24,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018165866] [2023-08-30 02:06:24,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018165866] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:24,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:24,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:06:24,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992169907] [2023-08-30 02:06:24,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:24,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:06:24,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:24,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:06:24,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:06:24,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 232 [2023-08-30 02:06:24,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:06:24,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:24,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 232 [2023-08-30 02:06:24,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:24,818 INFO L130 PetriNetUnfolder]: 24/64 cut-off events. [2023-08-30 02:06:24,818 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:06:24,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 64 events. 24/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 163 event pairs, 15 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 131. Up to 61 conditions per place. [2023-08-30 02:06:24,820 INFO L137 encePairwiseOnDemand]: 229/232 looper letters, 24 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2023-08-30 02:06:24,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 114 flow [2023-08-30 02:06:24,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:06:24,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:06:24,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-08-30 02:06:24,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46120689655172414 [2023-08-30 02:06:24,822 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-08-30 02:06:24,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-08-30 02:06:24,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:24,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-08-30 02:06:24,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states 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 02:06:24,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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 02:06:24,826 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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 02:06:24,827 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 60 flow. Second operand 3 states and 321 transitions. [2023-08-30 02:06:24,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 114 flow [2023-08-30 02:06:24,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:06:24,828 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 64 flow [2023-08-30 02:06:24,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2023-08-30 02:06:24,829 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2023-08-30 02:06:24,832 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 64 flow [2023-08-30 02:06:24,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:06:24,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:24,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-30 02:06:24,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:06:24,834 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:24,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:24,834 INFO L85 PathProgramCache]: Analyzing trace with hash 13090482, now seen corresponding path program 1 times [2023-08-30 02:06:24,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:24,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118719097] [2023-08-30 02:06:24,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:24,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:24,976 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 02:06:24,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:24,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118719097] [2023-08-30 02:06:24,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118719097] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:24,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:24,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:06:24,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684574923] [2023-08-30 02:06:24,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:24,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:06:24,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:24,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:06:24,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:06:25,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 232 [2023-08-30 02:06:25,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 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 02:06:25,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:25,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 232 [2023-08-30 02:06:25,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:25,095 INFO L130 PetriNetUnfolder]: 24/63 cut-off events. [2023-08-30 02:06:25,095 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 02:06:25,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 63 events. 24/63 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 161 event pairs, 16 based on Foata normal form. 1/27 useless extension candidates. Maximal degree in co-relation 132. Up to 61 conditions per place. [2023-08-30 02:06:25,096 INFO L137 encePairwiseOnDemand]: 229/232 looper letters, 22 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2023-08-30 02:06:25,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 108 flow [2023-08-30 02:06:25,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:06:25,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:06:25,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2023-08-30 02:06:25,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2023-08-30 02:06:25,100 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2023-08-30 02:06:25,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2023-08-30 02:06:25,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:25,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2023-08-30 02:06:25,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 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 02:06:25,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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 02:06:25,103 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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 02:06:25,104 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 64 flow. Second operand 3 states and 319 transitions. [2023-08-30 02:06:25,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 108 flow [2023-08-30 02:06:25,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:06:25,105 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 58 flow [2023-08-30 02:06:25,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2023-08-30 02:06:25,106 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -7 predicate places. [2023-08-30 02:06:25,106 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 58 flow [2023-08-30 02:06:25,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 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 02:06:25,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:25,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 02:06:25,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:06:25,107 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:25,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:25,108 INFO L85 PathProgramCache]: Analyzing trace with hash -305662314, now seen corresponding path program 1 times [2023-08-30 02:06:25,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:25,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044973439] [2023-08-30 02:06:25,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:25,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:25,220 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 02:06:25,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:25,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044973439] [2023-08-30 02:06:25,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044973439] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:25,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:25,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:06:25,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684802936] [2023-08-30 02:06:25,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:25,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:06:25,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:25,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:06:25,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:06:25,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 232 [2023-08-30 02:06:25,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states 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 02:06:25,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:25,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 232 [2023-08-30 02:06:25,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:25,305 INFO L130 PetriNetUnfolder]: 17/49 cut-off events. [2023-08-30 02:06:25,306 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:06:25,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 49 events. 17/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 107 event pairs, 11 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 101. Up to 47 conditions per place. [2023-08-30 02:06:25,306 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 20 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2023-08-30 02:06:25,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 23 transitions, 98 flow [2023-08-30 02:06:25,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:06:25,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:06:25,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2023-08-30 02:06:25,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44396551724137934 [2023-08-30 02:06:25,308 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2023-08-30 02:06:25,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2023-08-30 02:06:25,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:25,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2023-08-30 02:06:25,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states 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 02:06:25,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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 02:06:25,312 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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 02:06:25,312 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 58 flow. Second operand 3 states and 309 transitions. [2023-08-30 02:06:25,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 23 transitions, 98 flow [2023-08-30 02:06:25,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:06:25,313 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 54 flow [2023-08-30 02:06:25,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=27, PETRI_TRANSITIONS=23} [2023-08-30 02:06:25,316 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -9 predicate places. [2023-08-30 02:06:25,316 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 54 flow [2023-08-30 02:06:25,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states 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 02:06:25,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:25,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 02:06:25,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:06:25,317 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:25,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:25,317 INFO L85 PathProgramCache]: Analyzing trace with hash -305662316, now seen corresponding path program 1 times [2023-08-30 02:06:25,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:25,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503337125] [2023-08-30 02:06:25,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:25,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:25,426 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 02:06:25,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:25,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503337125] [2023-08-30 02:06:25,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503337125] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:25,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:25,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:06:25,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320756966] [2023-08-30 02:06:25,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:25,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:06:25,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:25,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:06:25,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:06:25,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 232 [2023-08-30 02:06:25,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states 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 02:06:25,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:25,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 232 [2023-08-30 02:06:25,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:25,530 INFO L130 PetriNetUnfolder]: 10/35 cut-off events. [2023-08-30 02:06:25,531 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:06:25,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 35 events. 10/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 61 event pairs, 6 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 73. Up to 33 conditions per place. [2023-08-30 02:06:25,532 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 18 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2023-08-30 02:06:25,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 21 transitions, 90 flow [2023-08-30 02:06:25,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:06:25,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:06:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2023-08-30 02:06:25,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4281609195402299 [2023-08-30 02:06:25,534 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 298 transitions. [2023-08-30 02:06:25,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 298 transitions. [2023-08-30 02:06:25,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:25,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 298 transitions. [2023-08-30 02:06:25,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states 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 02:06:25,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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 02:06:25,537 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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 02:06:25,537 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 54 flow. Second operand 3 states and 298 transitions. [2023-08-30 02:06:25,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 21 transitions, 90 flow [2023-08-30 02:06:25,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:06:25,539 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 50 flow [2023-08-30 02:06:25,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2023-08-30 02:06:25,541 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -11 predicate places. [2023-08-30 02:06:25,541 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 50 flow [2023-08-30 02:06:25,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states 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 02:06:25,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:25,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:25,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:06:25,542 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:25,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:25,543 INFO L85 PathProgramCache]: Analyzing trace with hash -655080410, now seen corresponding path program 1 times [2023-08-30 02:06:25,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:25,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075337654] [2023-08-30 02:06:25,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:25,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:25,751 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 02:06:25,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:25,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075337654] [2023-08-30 02:06:25,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075337654] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:25,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:25,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:06:25,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408001607] [2023-08-30 02:06:25,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:25,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:06:25,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:25,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:06:25,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:06:25,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 232 [2023-08-30 02:06:25,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 50 flow. Second operand has 7 states, 7 states have (on average 84.28571428571429) internal successors, (590), 7 states have internal predecessors, (590), 0 states have call successors, (0), 0 states 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 02:06:25,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:25,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 232 [2023-08-30 02:06:25,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:26,012 INFO L130 PetriNetUnfolder]: 10/40 cut-off events. [2023-08-30 02:06:26,013 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:06:26,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 40 events. 10/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 93 event pairs, 2 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 85. Up to 21 conditions per place. [2023-08-30 02:06:26,013 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 22 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2023-08-30 02:06:26,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 115 flow [2023-08-30 02:06:26,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:06:26,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:06:26,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2023-08-30 02:06:26,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38685344827586204 [2023-08-30 02:06:26,018 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 359 transitions. [2023-08-30 02:06:26,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 359 transitions. [2023-08-30 02:06:26,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:26,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 359 transitions. [2023-08-30 02:06:26,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 0 states have call successors, (0), 0 states 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 02:06:26,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states 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 02:06:26,021 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states 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 02:06:26,021 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 50 flow. Second operand 4 states and 359 transitions. [2023-08-30 02:06:26,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 115 flow [2023-08-30 02:06:26,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 109 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:06:26,022 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 54 flow [2023-08-30 02:06:26,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=54, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2023-08-30 02:06:26,023 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -11 predicate places. [2023-08-30 02:06:26,023 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 54 flow [2023-08-30 02:06:26,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.28571428571429) internal successors, (590), 7 states have internal predecessors, (590), 0 states have call successors, (0), 0 states 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 02:06:26,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:26,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:26,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:06:26,024 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:26,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:26,024 INFO L85 PathProgramCache]: Analyzing trace with hash -655080315, now seen corresponding path program 1 times [2023-08-30 02:06:26,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:26,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788938978] [2023-08-30 02:06:26,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:26,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:26,081 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 02:06:26,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:26,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788938978] [2023-08-30 02:06:26,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788938978] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:26,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:26,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:06:26,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881301348] [2023-08-30 02:06:26,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:26,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:06:26,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:26,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:06:26,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:06:26,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 232 [2023-08-30 02:06:26,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states 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 02:06:26,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:26,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 232 [2023-08-30 02:06:26,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:26,219 INFO L130 PetriNetUnfolder]: 9/35 cut-off events. [2023-08-30 02:06:26,219 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 02:06:26,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 35 events. 9/35 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 66 event pairs, 1 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 77. Up to 17 conditions per place. [2023-08-30 02:06:26,219 INFO L137 encePairwiseOnDemand]: 227/232 looper letters, 20 selfloop transitions, 4 changer transitions 0/24 dead transitions. [2023-08-30 02:06:26,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 24 transitions, 109 flow [2023-08-30 02:06:26,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:06:26,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:06:26,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 407 transitions. [2023-08-30 02:06:26,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4385775862068966 [2023-08-30 02:06:26,222 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 407 transitions. [2023-08-30 02:06:26,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 407 transitions. [2023-08-30 02:06:26,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:26,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 407 transitions. [2023-08-30 02:06:26,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:06:26,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states 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 02:06:26,225 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states 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 02:06:26,225 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 54 flow. Second operand 4 states and 407 transitions. [2023-08-30 02:06:26,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 24 transitions, 109 flow [2023-08-30 02:06:26,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 24 transitions, 106 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:06:26,226 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 55 flow [2023-08-30 02:06:26,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=55, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2023-08-30 02:06:26,228 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -11 predicate places. [2023-08-30 02:06:26,228 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 55 flow [2023-08-30 02:06:26,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states 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 02:06:26,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:26,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:26,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:06:26,229 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:26,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:26,230 INFO L85 PathProgramCache]: Analyzing trace with hash -655080373, now seen corresponding path program 1 times [2023-08-30 02:06:26,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:26,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917617965] [2023-08-30 02:06:26,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:26,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:26,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 02:06:26,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:26,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917617965] [2023-08-30 02:06:26,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917617965] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:26,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:26,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:06:26,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236057880] [2023-08-30 02:06:26,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:26,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:06:26,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:26,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:06:26,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:06:26,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 232 [2023-08-30 02:06:26,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 55 flow. Second operand has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 0 states have call successors, (0), 0 states 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 02:06:26,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:26,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 232 [2023-08-30 02:06:26,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:27,061 INFO L130 PetriNetUnfolder]: 12/48 cut-off events. [2023-08-30 02:06:27,062 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2023-08-30 02:06:27,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 48 events. 12/48 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 118 event pairs, 6 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 108. Up to 33 conditions per place. [2023-08-30 02:06:27,062 INFO L137 encePairwiseOnDemand]: 227/232 looper letters, 21 selfloop transitions, 6 changer transitions 0/27 dead transitions. [2023-08-30 02:06:27,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 27 transitions, 129 flow [2023-08-30 02:06:27,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:06:27,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:06:27,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 555 transitions. [2023-08-30 02:06:27,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39870689655172414 [2023-08-30 02:06:27,066 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 555 transitions. [2023-08-30 02:06:27,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 555 transitions. [2023-08-30 02:06:27,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:27,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 555 transitions. [2023-08-30 02:06:27,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states 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 02:06:27,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states 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 02:06:27,070 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states 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 02:06:27,070 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 55 flow. Second operand 6 states and 555 transitions. [2023-08-30 02:06:27,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 27 transitions, 129 flow [2023-08-30 02:06:27,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 119 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:06:27,073 INFO L231 Difference]: Finished difference. Result has 28 places, 21 transitions, 71 flow [2023-08-30 02:06:27,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=71, PETRI_PLACES=28, PETRI_TRANSITIONS=21} [2023-08-30 02:06:27,074 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -8 predicate places. [2023-08-30 02:06:27,074 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 71 flow [2023-08-30 02:06:27,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 0 states have call successors, (0), 0 states 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 02:06:27,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:27,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:27,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:06:27,075 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:27,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:27,076 INFO L85 PathProgramCache]: Analyzing trace with hash -655080316, now seen corresponding path program 1 times [2023-08-30 02:06:27,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:27,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355315921] [2023-08-30 02:06:27,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:27,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:27,166 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 02:06:27,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:27,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355315921] [2023-08-30 02:06:27,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355315921] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:27,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:27,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:06:27,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677571991] [2023-08-30 02:06:27,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:27,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:06:27,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:27,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:06:27,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:06:27,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 232 [2023-08-30 02:06:27,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states 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 02:06:27,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:27,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 232 [2023-08-30 02:06:27,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:27,307 INFO L130 PetriNetUnfolder]: 11/42 cut-off events. [2023-08-30 02:06:27,308 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2023-08-30 02:06:27,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 42 events. 11/42 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 87 event pairs, 5 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 105. Up to 30 conditions per place. [2023-08-30 02:06:27,308 INFO L137 encePairwiseOnDemand]: 227/232 looper letters, 22 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2023-08-30 02:06:27,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 25 transitions, 130 flow [2023-08-30 02:06:27,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:06:27,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:06:27,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 407 transitions. [2023-08-30 02:06:27,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4385775862068966 [2023-08-30 02:06:27,310 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 407 transitions. [2023-08-30 02:06:27,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 407 transitions. [2023-08-30 02:06:27,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:27,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 407 transitions. [2023-08-30 02:06:27,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:06:27,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states 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 02:06:27,314 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states 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 02:06:27,314 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 71 flow. Second operand 4 states and 407 transitions. [2023-08-30 02:06:27,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 25 transitions, 130 flow [2023-08-30 02:06:27,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 129 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:06:27,315 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 78 flow [2023-08-30 02:06:27,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-08-30 02:06:27,316 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-30 02:06:27,316 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 78 flow [2023-08-30 02:06:27,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states 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 02:06:27,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:27,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:27,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:06:27,317 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:27,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:27,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1167348188, now seen corresponding path program 1 times [2023-08-30 02:06:27,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:27,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487062368] [2023-08-30 02:06:27,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:27,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:27,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:27,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487062368] [2023-08-30 02:06:27,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487062368] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:06:27,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913790947] [2023-08-30 02:06:27,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:27,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:06:27,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:06:27,595 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:06:27,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-30 02:06:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:27,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-30 02:06:27,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:06:27,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:27,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:27,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:27,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-30 02:06:27,888 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-30 02:06:27,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-30 02:06:28,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:28,008 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 02:06:28,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:28,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:06:28,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:28,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913790947] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:06:28,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:06:28,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 14 [2023-08-30 02:06:28,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076096163] [2023-08-30 02:06:28,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:06:28,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-30 02:06:28,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:28,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-30 02:06:28,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2023-08-30 02:06:29,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 232 [2023-08-30 02:06:29,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 78 flow. Second operand has 16 states, 16 states have (on average 87.875) internal successors, (1406), 16 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states 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 02:06:29,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:29,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 232 [2023-08-30 02:06:29,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:29,747 INFO L130 PetriNetUnfolder]: 21/73 cut-off events. [2023-08-30 02:06:29,747 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2023-08-30 02:06:29,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 73 events. 21/73 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 210 event pairs, 4 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 191. Up to 23 conditions per place. [2023-08-30 02:06:29,748 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 31 selfloop transitions, 13 changer transitions 0/44 dead transitions. [2023-08-30 02:06:29,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 236 flow [2023-08-30 02:06:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 02:06:29,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 02:06:29,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1079 transitions. [2023-08-30 02:06:29,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875718390804598 [2023-08-30 02:06:29,752 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1079 transitions. [2023-08-30 02:06:29,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1079 transitions. [2023-08-30 02:06:29,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:29,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1079 transitions. [2023-08-30 02:06:29,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 89.91666666666667) internal successors, (1079), 12 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states 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 02:06:29,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 232.0) internal successors, (3016), 13 states have internal predecessors, (3016), 0 states have call successors, (0), 0 states 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 02:06:29,761 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 232.0) internal successors, (3016), 13 states have internal predecessors, (3016), 0 states have call successors, (0), 0 states 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 02:06:29,761 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 78 flow. Second operand 12 states and 1079 transitions. [2023-08-30 02:06:29,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 236 flow [2023-08-30 02:06:29,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 230 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:06:29,763 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 155 flow [2023-08-30 02:06:29,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=155, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2023-08-30 02:06:29,764 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2023-08-30 02:06:29,764 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 155 flow [2023-08-30 02:06:29,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 87.875) internal successors, (1406), 16 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states 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 02:06:29,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:29,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:29,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-30 02:06:29,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-30 02:06:29,981 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:29,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:29,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1075178115, now seen corresponding path program 1 times [2023-08-30 02:06:29,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:29,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473208159] [2023-08-30 02:06:29,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:29,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:30,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:30,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:30,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473208159] [2023-08-30 02:06:30,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473208159] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:06:30,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710334751] [2023-08-30 02:06:30,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:30,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:06:30,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:06:30,094 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:06:30,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-30 02:06:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:30,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-30 02:06:30,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:06:30,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 02:06:30,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:30,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:06:30,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:30,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710334751] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:06:30,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:06:30,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-08-30 02:06:30,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839018179] [2023-08-30 02:06:30,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:06:30,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 02:06:30,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:30,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 02:06:30,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-08-30 02:06:30,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 232 [2023-08-30 02:06:30,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 155 flow. Second operand has 11 states, 11 states have (on average 94.36363636363636) internal successors, (1038), 11 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states 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 02:06:30,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:30,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 232 [2023-08-30 02:06:30,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:30,700 INFO L130 PetriNetUnfolder]: 17/65 cut-off events. [2023-08-30 02:06:30,701 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2023-08-30 02:06:30,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 65 events. 17/65 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 170 event pairs, 4 based on Foata normal form. 6/71 useless extension candidates. Maximal degree in co-relation 215. Up to 24 conditions per place. [2023-08-30 02:06:30,702 INFO L137 encePairwiseOnDemand]: 227/232 looper letters, 35 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2023-08-30 02:06:30,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 275 flow [2023-08-30 02:06:30,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:06:30,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:06:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 689 transitions. [2023-08-30 02:06:30,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42426108374384236 [2023-08-30 02:06:30,705 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 689 transitions. [2023-08-30 02:06:30,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 689 transitions. [2023-08-30 02:06:30,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:30,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 689 transitions. [2023-08-30 02:06:30,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.42857142857143) internal successors, (689), 7 states have internal predecessors, (689), 0 states have call successors, (0), 0 states 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 02:06:30,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 02:06:30,710 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 02:06:30,710 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 155 flow. Second operand 7 states and 689 transitions. [2023-08-30 02:06:30,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 275 flow [2023-08-30 02:06:30,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 249 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-30 02:06:30,713 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 137 flow [2023-08-30 02:06:30,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=137, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2023-08-30 02:06:30,713 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2023-08-30 02:06:30,713 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 26 transitions, 137 flow [2023-08-30 02:06:30,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 94.36363636363636) internal successors, (1038), 11 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states 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 02:06:30,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:30,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:30,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-30 02:06:30,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-30 02:06:30,920 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:30,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:30,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1827597992, now seen corresponding path program 1 times [2023-08-30 02:06:30,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:30,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059132599] [2023-08-30 02:06:30,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:30,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:30,947 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 02:06:30,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:30,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059132599] [2023-08-30 02:06:30,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059132599] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:30,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:30,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:06:30,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216978610] [2023-08-30 02:06:30,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:30,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:06:30,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:30,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:06:30,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:06:30,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 232 [2023-08-30 02:06:30,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 26 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states 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 02:06:30,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:30,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 232 [2023-08-30 02:06:30,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:30,989 INFO L130 PetriNetUnfolder]: 16/59 cut-off events. [2023-08-30 02:06:30,989 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2023-08-30 02:06:30,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 59 events. 16/59 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 150 event pairs, 11 based on Foata normal form. 2/61 useless extension candidates. Maximal degree in co-relation 197. Up to 56 conditions per place. [2023-08-30 02:06:30,990 INFO L137 encePairwiseOnDemand]: 230/232 looper letters, 24 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2023-08-30 02:06:30,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 25 transitions, 180 flow [2023-08-30 02:06:30,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:06:30,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:06:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-08-30 02:06:30,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46120689655172414 [2023-08-30 02:06:30,992 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-08-30 02:06:30,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-08-30 02:06:30,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:30,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-08-30 02:06:30,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states 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 02:06:30,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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 02:06:30,995 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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 02:06:30,995 INFO L175 Difference]: Start difference. First operand has 43 places, 26 transitions, 137 flow. Second operand 3 states and 321 transitions. [2023-08-30 02:06:30,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 25 transitions, 180 flow [2023-08-30 02:06:30,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 25 transitions, 171 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-30 02:06:30,997 INFO L231 Difference]: Finished difference. Result has 39 places, 24 transitions, 121 flow [2023-08-30 02:06:30,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2023-08-30 02:06:30,997 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2023-08-30 02:06:30,998 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 121 flow [2023-08-30 02:06:30,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states 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 02:06:30,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:30,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:30,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 02:06:30,999 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:30,999 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:30,999 INFO L85 PathProgramCache]: Analyzing trace with hash 834000325, now seen corresponding path program 1 times [2023-08-30 02:06:30,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:30,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42874237] [2023-08-30 02:06:30,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:31,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:31,154 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 02:06:31,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:31,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42874237] [2023-08-30 02:06:31,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42874237] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:31,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:31,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:06:31,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450395957] [2023-08-30 02:06:31,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:31,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:06:31,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:31,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:06:31,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:06:31,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 232 [2023-08-30 02:06:31,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 121 flow. Second operand has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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 02:06:31,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:31,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 232 [2023-08-30 02:06:31,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:31,270 INFO L130 PetriNetUnfolder]: 16/58 cut-off events. [2023-08-30 02:06:31,271 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-30 02:06:31,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 58 events. 16/58 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 9 based on Foata normal form. 1/59 useless extension candidates. Maximal degree in co-relation 186. Up to 47 conditions per place. [2023-08-30 02:06:31,271 INFO L137 encePairwiseOnDemand]: 227/232 looper letters, 25 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2023-08-30 02:06:31,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 29 transitions, 188 flow [2023-08-30 02:06:31,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:06:31,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:06:31,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 504 transitions. [2023-08-30 02:06:31,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43448275862068964 [2023-08-30 02:06:31,274 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 504 transitions. [2023-08-30 02:06:31,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 504 transitions. [2023-08-30 02:06:31,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:31,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 504 transitions. [2023-08-30 02:06:31,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.8) internal successors, (504), 5 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:06:31,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states 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 02:06:31,277 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states 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 02:06:31,277 INFO L175 Difference]: Start difference. First operand has 39 places, 24 transitions, 121 flow. Second operand 5 states and 504 transitions. [2023-08-30 02:06:31,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 29 transitions, 188 flow [2023-08-30 02:06:31,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 187 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:06:31,279 INFO L231 Difference]: Finished difference. Result has 41 places, 24 transitions, 131 flow [2023-08-30 02:06:31,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2023-08-30 02:06:31,280 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2023-08-30 02:06:31,280 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 24 transitions, 131 flow [2023-08-30 02:06:31,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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 02:06:31,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:31,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:31,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 02:06:31,281 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:31,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:31,281 INFO L85 PathProgramCache]: Analyzing trace with hash 806294685, now seen corresponding path program 1 times [2023-08-30 02:06:31,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:31,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240799776] [2023-08-30 02:06:31,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:31,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:31,517 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 02:06:31,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:31,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240799776] [2023-08-30 02:06:31,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240799776] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:31,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:31,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:06:31,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982635872] [2023-08-30 02:06:31,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:31,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:06:31,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:31,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:06:31,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:06:31,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 232 [2023-08-30 02:06:31,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 24 transitions, 131 flow. Second operand has 8 states, 8 states have (on average 90.5) internal successors, (724), 8 states have internal predecessors, (724), 0 states have call successors, (0), 0 states 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 02:06:31,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:31,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 232 [2023-08-30 02:06:31,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:31,913 INFO L130 PetriNetUnfolder]: 15/53 cut-off events. [2023-08-30 02:06:31,913 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2023-08-30 02:06:31,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 53 events. 15/53 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 110 event pairs, 1 based on Foata normal form. 2/55 useless extension candidates. Maximal degree in co-relation 188. Up to 38 conditions per place. [2023-08-30 02:06:31,914 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 22 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2023-08-30 02:06:31,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 27 transitions, 190 flow [2023-08-30 02:06:31,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:06:31,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:06:31,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2023-08-30 02:06:31,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40344827586206894 [2023-08-30 02:06:31,919 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 468 transitions. [2023-08-30 02:06:31,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 468 transitions. [2023-08-30 02:06:31,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:31,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 468 transitions. [2023-08-30 02:06:31,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.6) internal successors, (468), 5 states have internal predecessors, (468), 0 states have call successors, (0), 0 states 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 02:06:31,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states 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 02:06:31,922 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states 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 02:06:31,922 INFO L175 Difference]: Start difference. First operand has 41 places, 24 transitions, 131 flow. Second operand 5 states and 468 transitions. [2023-08-30 02:06:31,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 27 transitions, 190 flow [2023-08-30 02:06:31,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 27 transitions, 182 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-30 02:06:31,924 INFO L231 Difference]: Finished difference. Result has 42 places, 24 transitions, 137 flow [2023-08-30 02:06:31,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2023-08-30 02:06:31,924 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2023-08-30 02:06:31,925 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 24 transitions, 137 flow [2023-08-30 02:06:31,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.5) internal successors, (724), 8 states have internal predecessors, (724), 0 states have call successors, (0), 0 states 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 02:06:31,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:31,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:31,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 02:06:31,926 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:31,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:31,926 INFO L85 PathProgramCache]: Analyzing trace with hash -2130979546, now seen corresponding path program 1 times [2023-08-30 02:06:31,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:31,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716072948] [2023-08-30 02:06:31,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:31,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:32,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:32,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:32,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716072948] [2023-08-30 02:06:32,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716072948] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:06:32,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866971221] [2023-08-30 02:06:32,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:32,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:06:32,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:06:32,245 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:06:32,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-30 02:06:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:32,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-30 02:06:32,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:06:32,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:32,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:06:32,377 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-08-30 02:06:32,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-08-30 02:06:32,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:06:32,500 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-30 02:06:32,500 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 1 case distinctions, treesize of input 19 treesize of output 18 [2023-08-30 02:06:32,536 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-30 02:06:32,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-08-30 02:06:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:32,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:06:32,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:32,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866971221] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:06:32,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:06:32,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 17 [2023-08-30 02:06:32,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231379176] [2023-08-30 02:06:32,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:06:32,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-30 02:06:32,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:32,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-30 02:06:32,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-08-30 02:06:34,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 232 [2023-08-30 02:06:34,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 24 transitions, 137 flow. Second operand has 18 states, 18 states have (on average 89.05555555555556) internal successors, (1603), 18 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states 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 02:06:34,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:34,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 232 [2023-08-30 02:06:34,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:34,545 INFO L130 PetriNetUnfolder]: 22/74 cut-off events. [2023-08-30 02:06:34,545 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2023-08-30 02:06:34,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 74 events. 22/74 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 186 event pairs, 1 based on Foata normal form. 5/79 useless extension candidates. Maximal degree in co-relation 278. Up to 20 conditions per place. [2023-08-30 02:06:34,546 INFO L137 encePairwiseOnDemand]: 227/232 looper letters, 32 selfloop transitions, 10 changer transitions 0/42 dead transitions. [2023-08-30 02:06:34,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 306 flow [2023-08-30 02:06:34,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:06:34,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:06:34,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 827 transitions. [2023-08-30 02:06:34,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3960727969348659 [2023-08-30 02:06:34,553 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 827 transitions. [2023-08-30 02:06:34,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 827 transitions. [2023-08-30 02:06:34,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:34,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 827 transitions. [2023-08-30 02:06:34,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 91.88888888888889) internal successors, (827), 9 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:06:34,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states 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 02:06:34,561 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states 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 02:06:34,561 INFO L175 Difference]: Start difference. First operand has 42 places, 24 transitions, 137 flow. Second operand 9 states and 827 transitions. [2023-08-30 02:06:34,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 306 flow [2023-08-30 02:06:34,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 42 transitions, 296 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-30 02:06:34,563 INFO L231 Difference]: Finished difference. Result has 49 places, 26 transitions, 181 flow [2023-08-30 02:06:34,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=181, PETRI_PLACES=49, PETRI_TRANSITIONS=26} [2023-08-30 02:06:34,565 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2023-08-30 02:06:34,565 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 26 transitions, 181 flow [2023-08-30 02:06:34,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 89.05555555555556) internal successors, (1603), 18 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states 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 02:06:34,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:34,566 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:34,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-30 02:06:34,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:06:34,777 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:34,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:34,778 INFO L85 PathProgramCache]: Analyzing trace with hash 122921156, now seen corresponding path program 2 times [2023-08-30 02:06:34,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:34,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237647424] [2023-08-30 02:06:34,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:34,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:34,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:34,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:34,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237647424] [2023-08-30 02:06:34,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237647424] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:06:34,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847360462] [2023-08-30 02:06:34,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:06:34,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:06:34,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:06:34,948 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:06:34,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-30 02:06:35,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:06:35,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:06:35,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-30 02:06:35,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:06:35,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:35,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:35,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:35,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-30 02:06:35,092 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-30 02:06:35,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-30 02:06:35,162 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 02:06:35,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 18 [2023-08-30 02:06:35,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:35,177 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 02:06:35,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-08-30 02:06:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-30 02:06:35,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:06:35,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847360462] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:35,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 02:06:35,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 10 [2023-08-30 02:06:35,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051431339] [2023-08-30 02:06:35,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:35,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:06:35,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:35,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:06:35,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-08-30 02:06:35,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 232 [2023-08-30 02:06:35,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 26 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states 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 02:06:35,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:35,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 232 [2023-08-30 02:06:35,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:35,627 INFO L130 PetriNetUnfolder]: 19/65 cut-off events. [2023-08-30 02:06:35,628 INFO L131 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2023-08-30 02:06:35,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 65 events. 19/65 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 144 event pairs, 0 based on Foata normal form. 6/71 useless extension candidates. Maximal degree in co-relation 280. Up to 51 conditions per place. [2023-08-30 02:06:35,629 INFO L137 encePairwiseOnDemand]: 227/232 looper letters, 22 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2023-08-30 02:06:35,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 27 transitions, 233 flow [2023-08-30 02:06:35,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:06:35,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:06:35,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 594 transitions. [2023-08-30 02:06:35,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4267241379310345 [2023-08-30 02:06:35,632 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 594 transitions. [2023-08-30 02:06:35,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 594 transitions. [2023-08-30 02:06:35,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:35,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 594 transitions. [2023-08-30 02:06:35,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.0) internal successors, (594), 6 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:06:35,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states 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 02:06:35,636 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states 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 02:06:35,636 INFO L175 Difference]: Start difference. First operand has 49 places, 26 transitions, 181 flow. Second operand 6 states and 594 transitions. [2023-08-30 02:06:35,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 27 transitions, 233 flow [2023-08-30 02:06:35,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 27 transitions, 213 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-30 02:06:35,638 INFO L231 Difference]: Finished difference. Result has 49 places, 25 transitions, 165 flow [2023-08-30 02:06:35,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=49, PETRI_TRANSITIONS=25} [2023-08-30 02:06:35,639 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2023-08-30 02:06:35,639 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 25 transitions, 165 flow [2023-08-30 02:06:35,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states 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 02:06:35,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:35,639 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:35,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-30 02:06:35,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-30 02:06:35,845 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:35,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:35,845 INFO L85 PathProgramCache]: Analyzing trace with hash 122921099, now seen corresponding path program 2 times [2023-08-30 02:06:35,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:35,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042970459] [2023-08-30 02:06:35,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:35,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:36,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:36,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:36,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042970459] [2023-08-30 02:06:36,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042970459] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:06:36,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577360077] [2023-08-30 02:06:36,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:06:36,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:06:36,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:06:36,107 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:06:36,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-30 02:06:36,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 02:06:36,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:06:36,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-30 02:06:36,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:06:36,245 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-30 02:06:36,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-30 02:06:36,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-30 02:06:36,306 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 02:06:36,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 18 [2023-08-30 02:06:36,315 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 02:06:36,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 02:06:36,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:36,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:06:36,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:36,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577360077] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:06:36,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:06:36,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2023-08-30 02:06:36,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906105923] [2023-08-30 02:06:36,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:06:36,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-30 02:06:36,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:36,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-30 02:06:36,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2023-08-30 02:06:37,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 232 [2023-08-30 02:06:37,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 25 transitions, 165 flow. Second operand has 24 states, 24 states have (on average 82.625) internal successors, (1983), 24 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states 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 02:06:37,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:37,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 232 [2023-08-30 02:06:37,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:38,575 INFO L130 PetriNetUnfolder]: 21/77 cut-off events. [2023-08-30 02:06:38,575 INFO L131 PetriNetUnfolder]: For 133/133 co-relation queries the response was YES. [2023-08-30 02:06:38,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 77 events. 21/77 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 184 event pairs, 3 based on Foata normal form. 8/85 useless extension candidates. Maximal degree in co-relation 310. Up to 18 conditions per place. [2023-08-30 02:06:38,576 INFO L137 encePairwiseOnDemand]: 226/232 looper letters, 32 selfloop transitions, 17 changer transitions 0/49 dead transitions. [2023-08-30 02:06:38,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 49 transitions, 381 flow [2023-08-30 02:06:38,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-30 02:06:38,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-30 02:06:38,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1430 transitions. [2023-08-30 02:06:38,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36257606490872213 [2023-08-30 02:06:38,580 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1430 transitions. [2023-08-30 02:06:38,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1430 transitions. [2023-08-30 02:06:38,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:38,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1430 transitions. [2023-08-30 02:06:38,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 84.11764705882354) internal successors, (1430), 17 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states 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 02:06:38,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 232.0) internal successors, (4176), 18 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states 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 02:06:38,590 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 232.0) internal successors, (4176), 18 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states 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 02:06:38,590 INFO L175 Difference]: Start difference. First operand has 49 places, 25 transitions, 165 flow. Second operand 17 states and 1430 transitions. [2023-08-30 02:06:38,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 49 transitions, 381 flow [2023-08-30 02:06:38,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 49 transitions, 363 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-30 02:06:38,593 INFO L231 Difference]: Finished difference. Result has 66 places, 32 transitions, 267 flow [2023-08-30 02:06:38,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=267, PETRI_PLACES=66, PETRI_TRANSITIONS=32} [2023-08-30 02:06:38,594 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 30 predicate places. [2023-08-30 02:06:38,594 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 32 transitions, 267 flow [2023-08-30 02:06:38,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 82.625) internal successors, (1983), 24 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states 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 02:06:38,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:38,596 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:38,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-30 02:06:38,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-30 02:06:38,802 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:38,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:38,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1752828807, now seen corresponding path program 1 times [2023-08-30 02:06:38,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:38,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385026106] [2023-08-30 02:06:38,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:38,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:39,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:39,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:39,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385026106] [2023-08-30 02:06:39,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385026106] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:06:39,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187894853] [2023-08-30 02:06:39,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:39,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:06:39,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:06:39,149 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:06:39,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-30 02:06:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:39,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-30 02:06:39,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:06:39,294 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-30 02:06:39,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-30 02:06:39,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:06:39,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:39,405 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 02:06:39,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-08-30 02:06:39,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:06:39,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:39,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:06:39,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:06:39,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:39,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:06:39,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 63 treesize of output 59 [2023-08-30 02:06:39,790 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 59 treesize of output 57 [2023-08-30 02:06:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:40,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187894853] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:06:40,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:06:40,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2023-08-30 02:06:40,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346423181] [2023-08-30 02:06:40,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:06:40,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-30 02:06:40,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:40,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-30 02:06:40,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2023-08-30 02:06:42,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 232 [2023-08-30 02:06:42,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 32 transitions, 267 flow. Second operand has 20 states, 20 states have (on average 74.0) internal successors, (1480), 20 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states 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 02:06:42,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:42,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 232 [2023-08-30 02:06:42,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:42,740 INFO L130 PetriNetUnfolder]: 20/72 cut-off events. [2023-08-30 02:06:42,740 INFO L131 PetriNetUnfolder]: For 170/170 co-relation queries the response was YES. [2023-08-30 02:06:42,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 72 events. 20/72 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 161 event pairs, 2 based on Foata normal form. 2/74 useless extension candidates. Maximal degree in co-relation 339. Up to 51 conditions per place. [2023-08-30 02:06:42,741 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 27 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2023-08-30 02:06:42,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 34 transitions, 328 flow [2023-08-30 02:06:42,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:06:42,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:06:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 457 transitions. [2023-08-30 02:06:42,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32830459770114945 [2023-08-30 02:06:42,743 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 457 transitions. [2023-08-30 02:06:42,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 457 transitions. [2023-08-30 02:06:42,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:42,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 457 transitions. [2023-08-30 02:06:42,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 76.16666666666667) internal successors, (457), 6 states have internal predecessors, (457), 0 states have call successors, (0), 0 states 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 02:06:42,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states 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 02:06:42,747 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states 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 02:06:42,747 INFO L175 Difference]: Start difference. First operand has 66 places, 32 transitions, 267 flow. Second operand 6 states and 457 transitions. [2023-08-30 02:06:42,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 34 transitions, 328 flow [2023-08-30 02:06:42,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 34 transitions, 293 flow, removed 6 selfloop flow, removed 8 redundant places. [2023-08-30 02:06:42,749 INFO L231 Difference]: Finished difference. Result has 61 places, 30 transitions, 231 flow [2023-08-30 02:06:42,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=61, PETRI_TRANSITIONS=30} [2023-08-30 02:06:42,750 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2023-08-30 02:06:42,750 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 30 transitions, 231 flow [2023-08-30 02:06:42,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 74.0) internal successors, (1480), 20 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states 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 02:06:42,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:42,750 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:42,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-30 02:06:42,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:06:42,951 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:42,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:42,952 INFO L85 PathProgramCache]: Analyzing trace with hash -2133052236, now seen corresponding path program 2 times [2023-08-30 02:06:42,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:42,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658642856] [2023-08-30 02:06:42,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:42,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:43,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:43,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:43,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658642856] [2023-08-30 02:06:43,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658642856] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:06:43,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800206246] [2023-08-30 02:06:43,329 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:06:43,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:06:43,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:06:43,330 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:06:43,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-30 02:06:43,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 02:06:43,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:06:43,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-30 02:06:43,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:06:43,479 INFO L321 Elim1Store]: treesize reduction 53, result has 32.9 percent of original size [2023-08-30 02:06:43,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 53 [2023-08-30 02:06:43,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:06:43,558 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 02:06:43,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-30 02:06:43,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:06:43,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:43,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:06:43,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:43,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:06:43,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:43,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:06:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:43,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:06:43,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 63 treesize of output 59 [2023-08-30 02:06:43,828 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 59 treesize of output 57 [2023-08-30 02:06:44,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:44,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800206246] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:06:44,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:06:44,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2023-08-30 02:06:44,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751990093] [2023-08-30 02:06:44,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:06:44,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-30 02:06:44,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:44,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-30 02:06:44,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=430, Unknown=1, NotChecked=0, Total=506 [2023-08-30 02:06:46,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 232 [2023-08-30 02:06:46,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 30 transitions, 231 flow. Second operand has 23 states, 23 states have (on average 73.8695652173913) internal successors, (1699), 23 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states 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 02:06:46,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:46,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 232 [2023-08-30 02:06:46,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:47,048 INFO L130 PetriNetUnfolder]: 19/67 cut-off events. [2023-08-30 02:06:47,048 INFO L131 PetriNetUnfolder]: For 182/182 co-relation queries the response was YES. [2023-08-30 02:06:47,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 67 events. 19/67 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 138 event pairs, 2 based on Foata normal form. 2/69 useless extension candidates. Maximal degree in co-relation 291. Up to 43 conditions per place. [2023-08-30 02:06:47,049 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 26 selfloop transitions, 8 changer transitions 0/34 dead transitions. [2023-08-30 02:06:47,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 34 transitions, 299 flow [2023-08-30 02:06:47,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:06:47,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:06:47,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 531 transitions. [2023-08-30 02:06:47,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32697044334975367 [2023-08-30 02:06:47,051 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 531 transitions. [2023-08-30 02:06:47,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 531 transitions. [2023-08-30 02:06:47,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:47,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 531 transitions. [2023-08-30 02:06:47,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 75.85714285714286) internal successors, (531), 7 states have internal predecessors, (531), 0 states have call successors, (0), 0 states 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 02:06:47,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 02:06:47,054 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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 02:06:47,054 INFO L175 Difference]: Start difference. First operand has 61 places, 30 transitions, 231 flow. Second operand 7 states and 531 transitions. [2023-08-30 02:06:47,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 34 transitions, 299 flow [2023-08-30 02:06:47,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 34 transitions, 268 flow, removed 2 selfloop flow, removed 10 redundant places. [2023-08-30 02:06:47,057 INFO L231 Difference]: Finished difference. Result has 57 places, 29 transitions, 213 flow [2023-08-30 02:06:47,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=213, PETRI_PLACES=57, PETRI_TRANSITIONS=29} [2023-08-30 02:06:47,057 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2023-08-30 02:06:47,057 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 29 transitions, 213 flow [2023-08-30 02:06:47,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 73.8695652173913) internal successors, (1699), 23 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states 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 02:06:47,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:47,058 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:47,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-30 02:06:47,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:06:47,264 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:47,264 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:47,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1662643835, now seen corresponding path program 3 times [2023-08-30 02:06:47,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:47,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031786111] [2023-08-30 02:06:47,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:47,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:47,906 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:47,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:47,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031786111] [2023-08-30 02:06:47,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031786111] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:06:47,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690697487] [2023-08-30 02:06:47,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:06:47,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:06:47,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:06:47,908 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:06:47,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-30 02:06:48,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-30 02:06:48,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:06:48,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 45 conjunts are in the unsatisfiable core [2023-08-30 02:06:48,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:06:48,107 INFO L321 Elim1Store]: treesize reduction 53, result has 32.9 percent of original size [2023-08-30 02:06:48,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 53 [2023-08-30 02:06:48,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:06:48,175 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 02:06:48,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-30 02:06:48,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:06:48,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:48,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:06:48,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:48,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:06:48,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:48,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:06:48,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:48,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:06:48,506 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:48,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:06:48,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 63 treesize of output 59 [2023-08-30 02:06:48,546 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 59 treesize of output 57 [2023-08-30 02:06:48,897 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:48,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690697487] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:06:48,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:06:48,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 25 [2023-08-30 02:06:48,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568621550] [2023-08-30 02:06:48,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:06:48,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-30 02:06:48,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:48,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-30 02:06:48,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=570, Unknown=2, NotChecked=0, Total=650 [2023-08-30 02:06:50,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:06:54,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 232 [2023-08-30 02:06:54,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 29 transitions, 213 flow. Second operand has 26 states, 26 states have (on average 66.76923076923077) internal successors, (1736), 26 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states 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 02:06:54,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:54,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 232 [2023-08-30 02:06:54,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:54,775 INFO L130 PetriNetUnfolder]: 18/62 cut-off events. [2023-08-30 02:06:54,776 INFO L131 PetriNetUnfolder]: For 159/159 co-relation queries the response was YES. [2023-08-30 02:06:54,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 62 events. 18/62 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 117 event pairs, 1 based on Foata normal form. 2/64 useless extension candidates. Maximal degree in co-relation 256. Up to 35 conditions per place. [2023-08-30 02:06:54,776 INFO L137 encePairwiseOnDemand]: 227/232 looper letters, 24 selfloop transitions, 10 changer transitions 0/34 dead transitions. [2023-08-30 02:06:54,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 34 transitions, 274 flow [2023-08-30 02:06:54,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:06:54,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:06:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 615 transitions. [2023-08-30 02:06:54,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29454022988505746 [2023-08-30 02:06:54,780 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 615 transitions. [2023-08-30 02:06:54,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 615 transitions. [2023-08-30 02:06:54,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:54,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 615 transitions. [2023-08-30 02:06:54,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 68.33333333333333) internal successors, (615), 9 states have internal predecessors, (615), 0 states have call successors, (0), 0 states 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 02:06:54,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states 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 02:06:54,784 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states 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 02:06:54,784 INFO L175 Difference]: Start difference. First operand has 57 places, 29 transitions, 213 flow. Second operand 9 states and 615 transitions. [2023-08-30 02:06:54,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 34 transitions, 274 flow [2023-08-30 02:06:54,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 34 transitions, 252 flow, removed 3 selfloop flow, removed 7 redundant places. [2023-08-30 02:06:54,786 INFO L231 Difference]: Finished difference. Result has 57 places, 27 transitions, 190 flow [2023-08-30 02:06:54,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=190, PETRI_PLACES=57, PETRI_TRANSITIONS=27} [2023-08-30 02:06:54,787 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2023-08-30 02:06:54,787 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 27 transitions, 190 flow [2023-08-30 02:06:54,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 66.76923076923077) internal successors, (1736), 26 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states 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 02:06:54,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:54,788 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:54,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-30 02:06:54,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-08-30 02:06:54,994 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:54,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:54,995 INFO L85 PathProgramCache]: Analyzing trace with hash 35114698, now seen corresponding path program 2 times [2023-08-30 02:06:54,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:54,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959926266] [2023-08-30 02:06:54,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:54,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:55,775 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:55,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:55,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959926266] [2023-08-30 02:06:55,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959926266] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:06:55,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567466632] [2023-08-30 02:06:55,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:06:55,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:06:55,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:06:55,781 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:06:55,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-30 02:06:55,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 02:06:55,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:06:55,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 44 conjunts are in the unsatisfiable core [2023-08-30 02:06:55,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:06:55,934 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-30 02:06:55,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-30 02:06:55,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:06:56,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:56,030 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 02:06:56,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-08-30 02:06:56,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:06:56,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:06:56,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:06:56,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:06:56,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:06:56,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:06:56,321 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:56,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:06:56,488 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_519 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_519) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 4)))) is different from false [2023-08-30 02:06:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-08-30 02:06:56,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567466632] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:06:56,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:06:56,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2023-08-30 02:06:56,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420031798] [2023-08-30 02:06:56,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:06:56,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 02:06:56,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:56,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 02:06:56,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=729, Unknown=18, NotChecked=54, Total=870 [2023-08-30 02:06:57,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 232 [2023-08-30 02:06:57,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 27 transitions, 190 flow. Second operand has 30 states, 30 states have (on average 41.56666666666667) internal successors, (1247), 30 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states 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 02:06:57,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:57,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 232 [2023-08-30 02:06:57,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:07:04,136 WARN L222 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 64 DAG size of output: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:07:04,259 INFO L130 PetriNetUnfolder]: 17/56 cut-off events. [2023-08-30 02:07:04,260 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2023-08-30 02:07:04,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 56 events. 17/56 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 76 event pairs, 1 based on Foata normal form. 2/58 useless extension candidates. Maximal degree in co-relation 229. Up to 26 conditions per place. [2023-08-30 02:07:04,260 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 24 selfloop transitions, 10 changer transitions 0/34 dead transitions. [2023-08-30 02:07:04,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 34 transitions, 266 flow [2023-08-30 02:07:04,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 02:07:04,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 02:07:04,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 432 transitions. [2023-08-30 02:07:04,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.18620689655172415 [2023-08-30 02:07:04,266 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 432 transitions. [2023-08-30 02:07:04,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 432 transitions. [2023-08-30 02:07:04,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:07:04,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 432 transitions. [2023-08-30 02:07:04,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 43.2) internal successors, (432), 10 states have internal predecessors, (432), 0 states have call successors, (0), 0 states 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 02:07:04,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 232.0) internal successors, (2552), 11 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states 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 02:07:04,270 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 232.0) internal successors, (2552), 11 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states 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 02:07:04,270 INFO L175 Difference]: Start difference. First operand has 57 places, 27 transitions, 190 flow. Second operand 10 states and 432 transitions. [2023-08-30 02:07:04,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 34 transitions, 266 flow [2023-08-30 02:07:04,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 34 transitions, 246 flow, removed 0 selfloop flow, removed 9 redundant places. [2023-08-30 02:07:04,272 INFO L231 Difference]: Finished difference. Result has 57 places, 26 transitions, 187 flow [2023-08-30 02:07:04,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=187, PETRI_PLACES=57, PETRI_TRANSITIONS=26} [2023-08-30 02:07:04,273 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2023-08-30 02:07:04,273 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 26 transitions, 187 flow [2023-08-30 02:07:04,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 41.56666666666667) internal successors, (1247), 30 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states 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 02:07:04,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:07:04,274 INFO L208 CegarLoopForPetriNet]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:07:04,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-30 02:07:04,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:07:04,479 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:07:04,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:07:04,480 INFO L85 PathProgramCache]: Analyzing trace with hash 36363467, now seen corresponding path program 3 times [2023-08-30 02:07:04,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:07:04,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875510875] [2023-08-30 02:07:04,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:07:04,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:07:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:07:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:07:05,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:07:05,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875510875] [2023-08-30 02:07:05,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875510875] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:07:05,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542242646] [2023-08-30 02:07:05,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:07:05,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:07:05,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:07:05,205 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:07:05,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-30 02:07:05,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-08-30 02:07:05,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:07:05,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 52 conjunts are in the unsatisfiable core [2023-08-30 02:07:05,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:07:05,377 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-30 02:07:05,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-30 02:07:05,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:07:05,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:07:05,491 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 02:07:05,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-08-30 02:07:05,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:07:05,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:07:05,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:07:05,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:07:05,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:07:05,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:07:05,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:07:05,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:07:05,870 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:07:05,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:07:05,927 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_585 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_585) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 2 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)) 0)) is different from false [2023-08-30 02:07:05,971 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_585 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_585) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 4)) 0)) is different from false [2023-08-30 02:07:05,975 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_585 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_585) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 5 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)) 0)) is different from false [2023-08-30 02:07:05,978 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_585 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_585) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 6 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)) 0)) is different from false [2023-08-30 02:07:06,025 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_585 (Array Int Int))) (= (select (select (store |c_#memory_int| c_~v~0.base v_ArrVal_585) 3) 7) 0)) is different from false [2023-08-30 02:07:14,268 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 22 not checked. [2023-08-30 02:07:14,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542242646] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:07:14,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:07:14,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2023-08-30 02:07:14,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902002540] [2023-08-30 02:07:14,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:07:14,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-30 02:07:14,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:07:14,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-30 02:07:14,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=832, Unknown=31, NotChecked=310, Total=1260 [2023-08-30 02:07:14,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 232 [2023-08-30 02:07:14,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 26 transitions, 187 flow. Second operand has 36 states, 36 states have (on average 41.361111111111114) internal successors, (1489), 36 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states 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 02:07:14,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:07:14,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 232 [2023-08-30 02:07:14,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:07:15,608 INFO L130 PetriNetUnfolder]: 11/46 cut-off events. [2023-08-30 02:07:15,608 INFO L131 PetriNetUnfolder]: For 87/87 co-relation queries the response was YES. [2023-08-30 02:07:15,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 46 events. 11/46 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 1 based on Foata normal form. 2/48 useless extension candidates. Maximal degree in co-relation 183. Up to 11 conditions per place. [2023-08-30 02:07:15,608 INFO L137 encePairwiseOnDemand]: 227/232 looper letters, 21 selfloop transitions, 12 changer transitions 0/33 dead transitions. [2023-08-30 02:07:15,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 33 transitions, 233 flow [2023-08-30 02:07:15,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 02:07:15,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 02:07:15,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 594 transitions. [2023-08-30 02:07:15,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.1828817733990148 [2023-08-30 02:07:15,610 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 594 transitions. [2023-08-30 02:07:15,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 594 transitions. [2023-08-30 02:07:15,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:07:15,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 594 transitions. [2023-08-30 02:07:15,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 42.42857142857143) internal successors, (594), 14 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:07:15,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 232.0) internal successors, (3480), 15 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states 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 02:07:15,614 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 232.0) internal successors, (3480), 15 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states 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 02:07:15,615 INFO L175 Difference]: Start difference. First operand has 57 places, 26 transitions, 187 flow. Second operand 14 states and 594 transitions. [2023-08-30 02:07:15,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 33 transitions, 233 flow [2023-08-30 02:07:15,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 33 transitions, 177 flow, removed 6 selfloop flow, removed 19 redundant places. [2023-08-30 02:07:15,616 INFO L231 Difference]: Finished difference. Result has 50 places, 22 transitions, 112 flow [2023-08-30 02:07:15,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=112, PETRI_PLACES=50, PETRI_TRANSITIONS=22} [2023-08-30 02:07:15,617 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2023-08-30 02:07:15,617 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 22 transitions, 112 flow [2023-08-30 02:07:15,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 41.361111111111114) internal successors, (1489), 36 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states 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 02:07:15,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:07:15,618 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:07:15,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-30 02:07:15,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-08-30 02:07:15,824 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:07:15,824 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:07:15,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1135128259, now seen corresponding path program 3 times [2023-08-30 02:07:15,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:07:15,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443113705] [2023-08-30 02:07:15,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:07:15,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:07:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:07:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:07:16,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:07:16,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443113705] [2023-08-30 02:07:16,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443113705] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:07:16,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281093256] [2023-08-30 02:07:16,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:07:16,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:07:16,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:07:16,545 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 02:07:16,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-30 02:07:16,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-30 02:07:16,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:07:16,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 52 conjunts are in the unsatisfiable core [2023-08-30 02:07:16,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:07:16,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:07:16,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:07:16,689 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 02:07:16,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 02:07:16,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 02:07:16,817 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-08-30 02:07:16,817 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 1 case distinctions, treesize of input 19 treesize of output 18 [2023-08-30 02:07:16,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:07:16,882 INFO L321 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2023-08-30 02:07:16,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 40 [2023-08-30 02:07:16,978 INFO L321 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2023-08-30 02:07:16,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 59 [2023-08-30 02:07:17,161 INFO L321 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2023-08-30 02:07:17,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 73 [2023-08-30 02:07:17,360 INFO L321 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2023-08-30 02:07:17,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 87 [2023-08-30 02:07:17,544 INFO L321 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2023-08-30 02:07:17,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 101 [2023-08-30 02:07:17,742 INFO L321 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2023-08-30 02:07:17,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 115 [2023-08-30 02:07:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:07:17,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:09:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 7 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:09:12,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281093256] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:09:12,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:09:12,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 33 [2023-08-30 02:09:12,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336306088] [2023-08-30 02:09:12,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:09:12,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-30 02:09:12,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:09:12,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-30 02:09:12,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=933, Unknown=43, NotChecked=0, Total=1122 [2023-08-30 02:09:14,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:09:16,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:09:18,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:09:20,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:09:22,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:09:24,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:09:26,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:09:28,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:09:30,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:09:32,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:09:34,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:09:36,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:09:38,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:09:40,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:09:42,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:09:44,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:09:46,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:09:48,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:09:50,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:09:52,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:09:54,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:09:56,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:09:58,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:00,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:02,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:04,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:06,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:08,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:10,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:12,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:14,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:16,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:18,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:20,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:22,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:24,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:27,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:29,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:31,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:33,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:35,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:37,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:39,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:41,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:43,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:45,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:47,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:49,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:51,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:53,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:55,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:57,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:10:59,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:11:01,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:11:03,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:11:05,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:11:07,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:11:09,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:11:09,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 232 [2023-08-30 02:11:09,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 22 transitions, 112 flow. Second operand has 34 states, 34 states have (on average 42.5) internal successors, (1445), 34 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states 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 02:11:09,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:11:09,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 232 [2023-08-30 02:11:09,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:11:10,509 INFO L130 PetriNetUnfolder]: 10/39 cut-off events. [2023-08-30 02:11:10,509 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2023-08-30 02:11:10,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 39 events. 10/39 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 1 based on Foata normal form. 3/42 useless extension candidates. Maximal degree in co-relation 129. Up to 10 conditions per place. [2023-08-30 02:11:10,510 INFO L137 encePairwiseOnDemand]: 226/232 looper letters, 17 selfloop transitions, 10 changer transitions 0/27 dead transitions. [2023-08-30 02:11:10,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 27 transitions, 163 flow [2023-08-30 02:11:10,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 02:11:10,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 02:11:10,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 521 transitions. [2023-08-30 02:11:10,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.18714080459770116 [2023-08-30 02:11:10,518 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 521 transitions. [2023-08-30 02:11:10,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 521 transitions. [2023-08-30 02:11:10,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:11:10,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 521 transitions. [2023-08-30 02:11:10,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 43.416666666666664) internal successors, (521), 12 states have internal predecessors, (521), 0 states have call successors, (0), 0 states 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 02:11:10,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 232.0) internal successors, (3016), 13 states have internal predecessors, (3016), 0 states have call successors, (0), 0 states 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 02:11:10,522 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 232.0) internal successors, (3016), 13 states have internal predecessors, (3016), 0 states have call successors, (0), 0 states 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 02:11:10,522 INFO L175 Difference]: Start difference. First operand has 50 places, 22 transitions, 112 flow. Second operand 12 states and 521 transitions. [2023-08-30 02:11:10,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 27 transitions, 163 flow [2023-08-30 02:11:10,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 27 transitions, 136 flow, removed 0 selfloop flow, removed 13 redundant places. [2023-08-30 02:11:10,523 INFO L231 Difference]: Finished difference. Result has 44 places, 19 transitions, 86 flow [2023-08-30 02:11:10,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=86, PETRI_PLACES=44, PETRI_TRANSITIONS=19} [2023-08-30 02:11:10,523 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2023-08-30 02:11:10,523 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 19 transitions, 86 flow [2023-08-30 02:11:10,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 42.5) internal successors, (1445), 34 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states 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 02:11:10,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:11:10,524 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:11:10,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-30 02:11:10,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-08-30 02:11:10,731 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:11:10,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:11:10,732 INFO L85 PathProgramCache]: Analyzing trace with hash -829307970, now seen corresponding path program 4 times [2023-08-30 02:11:10,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:11:10,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869232499] [2023-08-30 02:11:10,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:11:10,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:11:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:11:10,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:11:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:11:10,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:11:10,845 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:11:10,847 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2023-08-30 02:11:10,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2023-08-30 02:11:10,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2023-08-30 02:11:10,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2023-08-30 02:11:10,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2023-08-30 02:11:10,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2023-08-30 02:11:10,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2023-08-30 02:11:10,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2023-08-30 02:11:10,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2023-08-30 02:11:10,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2023-08-30 02:11:10,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2023-08-30 02:11:10,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2023-08-30 02:11:10,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2023-08-30 02:11:10,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2023-08-30 02:11:10,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2023-08-30 02:11:10,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2023-08-30 02:11:10,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2023-08-30 02:11:10,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (8 of 26 remaining) [2023-08-30 02:11:10,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 26 remaining) [2023-08-30 02:11:10,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 26 remaining) [2023-08-30 02:11:10,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2023-08-30 02:11:10,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2023-08-30 02:11:10,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2023-08-30 02:11:10,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2023-08-30 02:11:10,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2023-08-30 02:11:10,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2023-08-30 02:11:10,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-30 02:11:10,853 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:11:10,859 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:11:10,860 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:11:10,873 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:11:10,874 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:11:10,874 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:11:10,875 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:11:10,875 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:11:10,875 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:11:10,875 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:11:10,875 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:11:10,875 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:11:10,875 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:11:10,876 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:11:10,876 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:11:10,876 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:11:10,876 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:11:10,876 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:11:10,877 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:11:10,877 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:11:10,877 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:11:10,877 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:11:10,877 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:11:10,878 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:11:10,878 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:11:10,878 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:11:10,878 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:11:10,878 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:11:10,879 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:11:10,879 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:11:10,879 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:11:10,879 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:11:10,879 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:11:10,880 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:11:10,880 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:11:10,880 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-30 02:11:10,880 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:11:10,880 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:11:10,881 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-30 02:11:10,881 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:11:10,881 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:11:10,881 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-30 02:11:10,881 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:11:10,881 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:11:10,882 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-30 02:11:10,882 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:11:10,882 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:11:10,882 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-30 02:11:10,882 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:11:10,883 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:11:10,883 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-30 02:11:10,883 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:11:10,883 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:11:10,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:11:10 BasicIcfg [2023-08-30 02:11:10,904 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:11:10,904 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:11:10,904 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:11:10,904 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:11:10,905 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:06:19" (3/4) ... [2023-08-30 02:11:10,907 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:11:10,907 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:11:10,911 INFO L158 Benchmark]: Toolchain (without parser) took 292524.07ms. Allocated memory was 100.7MB in the beginning and 218.1MB in the end (delta: 117.4MB). Free memory was 75.5MB in the beginning and 151.6MB in the end (delta: -76.1MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. [2023-08-30 02:11:10,911 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 65.0MB. Free memory is still 42.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:11:10,911 INFO L158 Benchmark]: CACSL2BoogieTranslator took 607.99ms. Allocated memory is still 100.7MB. Free memory was 75.2MB in the beginning and 70.0MB in the end (delta: 5.3MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2023-08-30 02:11:10,911 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.81ms. Allocated memory is still 100.7MB. Free memory was 70.0MB in the beginning and 67.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:11:10,912 INFO L158 Benchmark]: Boogie Preprocessor took 60.31ms. Allocated memory is still 100.7MB. Free memory was 67.5MB in the beginning and 65.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:11:10,912 INFO L158 Benchmark]: RCFGBuilder took 524.80ms. Allocated memory is still 100.7MB. Free memory was 65.8MB in the beginning and 49.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 02:11:10,912 INFO L158 Benchmark]: TraceAbstraction took 291283.20ms. Allocated memory was 100.7MB in the beginning and 218.1MB in the end (delta: 117.4MB). Free memory was 49.0MB in the beginning and 152.7MB in the end (delta: -103.7MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2023-08-30 02:11:10,912 INFO L158 Benchmark]: Witness Printer took 3.04ms. Allocated memory is still 218.1MB. Free memory was 152.7MB in the beginning and 151.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:11:10,913 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 65.0MB. Free memory is still 42.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 607.99ms. Allocated memory is still 100.7MB. Free memory was 75.2MB in the beginning and 70.0MB in the end (delta: 5.3MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.81ms. Allocated memory is still 100.7MB. Free memory was 70.0MB in the beginning and 67.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.31ms. Allocated memory is still 100.7MB. Free memory was 67.5MB in the beginning and 65.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 524.80ms. Allocated memory is still 100.7MB. Free memory was 65.8MB in the beginning and 49.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 291283.20ms. Allocated memory was 100.7MB in the beginning and 218.1MB in the end (delta: 117.4MB). Free memory was 49.0MB in the beginning and 152.7MB in the end (delta: -103.7MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Witness Printer took 3.04ms. Allocated memory is still 218.1MB. Free memory was 152.7MB in the beginning and 151.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 107 PlacesBefore, 36 PlacesAfterwards, 105 TransitionsBefore, 31 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 6 FixpointIterations, 63 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 7 ConcurrentYvCompositions, 3 ChoiceCompositions, 121 TotalNumberOfCompositions, 461 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 372, independent: 347, independent conditional: 0, independent unconditional: 347, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 186, independent: 176, independent conditional: 0, independent unconditional: 176, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 372, independent: 171, independent conditional: 0, independent unconditional: 171, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 186, unknown conditional: 0, unknown unconditional: 186] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 1119]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1119. Possible FailurePath: [L1108] 0 char *v; [L1121] 0 pthread_t t1, t2; [L1122] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, pthread_create(&t1, 0, thread1, 0)=2147483646, t1={16:0}, t2={15:0}, v={0:0}] [L1123] 0 \read(t1) VAL [\read(t1)=2147483646, arg={0:0}, t1={16:0}, t2={15:0}, v={0:0}] [L1111] 1 v = malloc(sizeof(char) * 8) [L1112] 1 return 0; [L1123] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=2147483646, \result={0:0}, arg={0:0}, arg={0:0}, t1={16:0}, t2={15:0}, v={9:0}] [L1124] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t2, 0, thread2, 0)=2147483647, t1={16:0}, t2={15:0}, v={9:0}] [L1125] 0 \read(t2) VAL [\read(t2)=2147483647, \result={0:0}, arg={0:0}, arg={0:0}, t1={16:0}, t2={15:0}, v={9:0}] [L1116] COND TRUE 2 \read(*v) [L1116] FCALL 2 strcpy(v, "Bigshot") [L1117] 2 return 0; [L1125] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\read(t2)=2147483647, \result={0:0}, arg={0:0}, arg={0:0}, t1={16:0}, t2={15:0}, v={9:0}] [L1126] EXPR 0 !v || v[0] == 'B' [L1126] EXPR 0 v[0] [L1126] EXPR 0 !v || v[0] == 'B' [L1126] CALL 0 __VERIFIER_assert(!v || v[0] == 'B') [L1107] COND FALSE 0 !(!expression) [L1126] RET 0 __VERIFIER_assert(!v || v[0] == 'B') [L1127] 0 return 0; [L1127] 0 return 0; [L1127] 0 return 0; - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 1107]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1124]: 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: 1122]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 142 locations, 26 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: 291.1s, OverallIterations: 25, TraceHistogramMax: 8, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 147.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 156 mSolverCounterUnknown, 7952 SdHoareTripleChecker+Valid, 135.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6665 mSDsluCounter, 7050 SdHoareTripleChecker+Invalid, 132.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 302 IncrementalHoareTripleChecker+Unchecked, 6789 mSDsCounter, 504 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33941 IncrementalHoareTripleChecker+Invalid, 34903 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 504 mSolverCounterUnsat, 261 mSDtfsCounter, 33941 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 513 GetRequests, 153 SyntacticMatches, 9 SemanticMatches, 351 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1250 ImplicationChecksByTransitivity, 136.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=267occurred in iteration=18, InterpolantAutomatonStates: 157, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 135.1s InterpolantComputationTime, 425 NumberOfCodeBlocks, 421 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 504 ConstructedInterpolants, 100 QuantifiedInterpolants, 9814 SizeOfPredicates, 82 NumberOfNonLiveVariables, 2576 ConjunctsInSsa, 421 ConjunctsInUnsatCore, 45 InterpolantComputations, 14 PerfectInterpolantSequences, 40/332 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 02:11:11,011 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/bigshot_s.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 4d8c741fd238f074816319de9a9bd5d97cd9b35eb7f53a276be973ea0c31ecbe --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 02:11:12,704 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:11:12,706 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:11:12,728 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:11:12,729 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:11:12,730 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:11:12,731 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:11:12,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:11:12,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:11:12,735 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:11:12,736 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:11:12,737 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:11:12,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:11:12,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:11:12,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:11:12,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:11:12,741 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:11:12,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:11:12,748 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:11:12,753 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:11:12,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:11:12,768 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:11:12,769 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:11:12,771 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:11:12,774 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:11:12,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:11:12,780 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:11:12,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:11:12,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:11:12,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:11:12,785 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:11:12,786 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:11:12,787 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:11:12,787 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:11:12,788 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:11:12,789 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:11:12,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:11:12,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:11:12,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:11:12,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:11:12,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:11:12,794 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 02:11:12,822 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:11:12,823 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:11:12,824 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:11:12,824 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:11:12,825 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:11:12,825 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:11:12,826 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:11:12,826 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:11:12,826 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:11:12,826 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:11:12,827 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:11:12,827 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:11:12,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:11:12,828 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:11:12,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:11:12,828 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:11:12,828 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:11:12,829 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:11:12,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:11:12,829 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:11:12,829 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 02:11:12,830 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 02:11:12,830 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:11:12,830 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:11:12,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:11:12,830 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:11:12,831 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:11:12,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:11:12,831 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:11:12,831 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:11:12,832 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 02:11:12,832 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 02:11:12,832 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:11:12,832 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:11:12,833 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:11:12,833 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 02:11:12,833 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:11:12,833 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 -> 4d8c741fd238f074816319de9a9bd5d97cd9b35eb7f53a276be973ea0c31ecbe 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 02:11:13,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:11:13,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:11:13,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:11:13,168 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:11:13,169 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:11:13,170 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/bigshot_s.i [2023-08-30 02:11:14,377 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:11:14,717 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:11:14,717 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s.i [2023-08-30 02:11:14,740 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/035e1832f/e450fcbded324976bb1646285c0d3315/FLAGcc2d4e2f9 [2023-08-30 02:11:14,751 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/035e1832f/e450fcbded324976bb1646285c0d3315 [2023-08-30 02:11:14,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:11:14,753 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:11:14,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:11:14,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:11:14,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:11:14,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:11:14" (1/1) ... [2023-08-30 02:11:14,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@464e3dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:11:14, skipping insertion in model container [2023-08-30 02:11:14,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:11:14" (1/1) ... [2023-08-30 02:11:14,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:11:14,817 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:11:15,157 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/bigshot_s.i[55202,55215] [2023-08-30 02:11:15,169 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:11:15,181 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:11:15,223 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/bigshot_s.i[55202,55215] [2023-08-30 02:11:15,228 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:11:15,290 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:11:15,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:11:15 WrapperNode [2023-08-30 02:11:15,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:11:15,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:11:15,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:11:15,292 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:11:15,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:11:15" (1/1) ... [2023-08-30 02:11:15,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:11:15" (1/1) ... [2023-08-30 02:11:15,344 INFO L138 Inliner]: procedures = 327, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2023-08-30 02:11:15,345 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:11:15,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:11:15,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:11:15,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:11:15,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:11:15" (1/1) ... [2023-08-30 02:11:15,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:11:15" (1/1) ... [2023-08-30 02:11:15,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:11:15" (1/1) ... [2023-08-30 02:11:15,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:11:15" (1/1) ... [2023-08-30 02:11:15,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:11:15" (1/1) ... [2023-08-30 02:11:15,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:11:15" (1/1) ... [2023-08-30 02:11:15,371 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:11:15" (1/1) ... [2023-08-30 02:11:15,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:11:15" (1/1) ... [2023-08-30 02:11:15,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:11:15,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:11:15,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:11:15,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:11:15,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:11:15" (1/1) ... [2023-08-30 02:11:15,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:11:15,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:11:15,405 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 02:11:15,413 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 02:11:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-08-30 02:11:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-30 02:11:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:11:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:11:15,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 02:11:15,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 02:11:15,436 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-30 02:11:15,436 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-30 02:11:15,439 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-30 02:11:15,439 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-30 02:11:15,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2023-08-30 02:11:15,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-30 02:11:15,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:11:15,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:11:15,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:11:15,441 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 02:11:15,590 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:11:15,592 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:11:15,922 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:11:15,928 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:11:15,928 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-08-30 02:11:15,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:11:15 BoogieIcfgContainer [2023-08-30 02:11:15,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:11:15,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:11:15,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:11:15,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:11:15,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:11:14" (1/3) ... [2023-08-30 02:11:15,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fdbc6e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:11:15, skipping insertion in model container [2023-08-30 02:11:15,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:11:15" (2/3) ... [2023-08-30 02:11:15,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fdbc6e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:11:15, skipping insertion in model container [2023-08-30 02:11:15,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:11:15" (3/3) ... [2023-08-30 02:11:15,937 INFO L112 eAbstractionObserver]: Analyzing ICFG bigshot_s.i [2023-08-30 02:11:15,950 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:11:15,951 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-08-30 02:11:15,951 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:11:16,062 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-30 02:11:16,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 112 transitions, 240 flow [2023-08-30 02:11:16,161 INFO L130 PetriNetUnfolder]: 5/110 cut-off events. [2023-08-30 02:11:16,162 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 02:11:16,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 110 events. 5/110 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 135 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-08-30 02:11:16,166 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 112 transitions, 240 flow [2023-08-30 02:11:16,172 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 106 transitions, 224 flow [2023-08-30 02:11:16,175 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:11:16,187 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 106 transitions, 224 flow [2023-08-30 02:11:16,191 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 106 transitions, 224 flow [2023-08-30 02:11:16,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 106 transitions, 224 flow [2023-08-30 02:11:16,230 INFO L130 PetriNetUnfolder]: 5/106 cut-off events. [2023-08-30 02:11:16,231 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 02:11:16,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 106 events. 5/106 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 133 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-30 02:11:16,233 INFO L119 LiptonReduction]: Number of co-enabled transitions 340 [2023-08-30 02:11:24,841 INFO L134 LiptonReduction]: Checked pairs total: 458 [2023-08-30 02:11:24,842 INFO L136 LiptonReduction]: Total number of compositions: 123 [2023-08-30 02:11:24,853 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:11:24,857 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;@429dbe, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:11:24,857 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-08-30 02:11:24,859 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:11:24,859 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:11:24,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:11:24,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:11:24,860 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:11:24,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:11:24,864 INFO L85 PathProgramCache]: Analyzing trace with hash 436, now seen corresponding path program 1 times [2023-08-30 02:11:24,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:11:24,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647379856] [2023-08-30 02:11:24,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:11:24,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 02:11:24,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:11:24,876 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 02:11:24,879 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 02:11:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:11:24,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 02:11:24,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:11:24,937 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 02:11:24,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:11:24,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:11:24,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647379856] [2023-08-30 02:11:24,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647379856] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:11:24,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:11:24,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:11:24,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126774524] [2023-08-30 02:11:24,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:11:24,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:11:24,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:11:24,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:11:24,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:11:24,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 235 [2023-08-30 02:11:24,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states 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 02:11:24,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:11:24,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 235 [2023-08-30 02:11:24,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:11:25,049 INFO L130 PetriNetUnfolder]: 26/69 cut-off events. [2023-08-30 02:11:25,049 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 02:11:25,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 69 events. 26/69 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 196 event pairs, 18 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 114. Up to 69 conditions per place. [2023-08-30 02:11:25,051 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 26 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-08-30 02:11:25,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 118 flow [2023-08-30 02:11:25,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:11:25,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:11:25,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 240 transitions. [2023-08-30 02:11:25,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2023-08-30 02:11:25,064 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 240 transitions. [2023-08-30 02:11:25,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 240 transitions. [2023-08-30 02:11:25,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:11:25,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 240 transitions. [2023-08-30 02:11:25,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 120.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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 02:11:25,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:11:25,080 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:11:25,081 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 74 flow. Second operand 2 states and 240 transitions. [2023-08-30 02:11:25,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 118 flow [2023-08-30 02:11:25,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:11:25,100 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 58 flow [2023-08-30 02:11:25,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=27} [2023-08-30 02:11:25,104 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -7 predicate places. [2023-08-30 02:11:25,104 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 58 flow [2023-08-30 02:11:25,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states 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 02:11:25,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:11:25,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:11:25,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-30 02:11:25,306 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 02:11:25,306 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:11:25,307 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:11:25,307 INFO L85 PathProgramCache]: Analyzing trace with hash 427108, now seen corresponding path program 1 times [2023-08-30 02:11:25,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:11:25,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867001980] [2023-08-30 02:11:25,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:11:25,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 02:11:25,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:11:25,310 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 02:11:25,321 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 02:11:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:11:25,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 02:11:25,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:11:25,444 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-30 02:11:25,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-08-30 02:11:25,473 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 02:11:25,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:11:25,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:11:25,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867001980] [2023-08-30 02:11:25,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867001980] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:11:25,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:11:25,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:11:25,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872854627] [2023-08-30 02:11:25,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:11:25,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:11:25,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:11:25,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:11:25,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:11:25,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-08-30 02:11:25,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states 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 02:11:25,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:11:25,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-08-30 02:11:25,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:11:25,667 INFO L130 PetriNetUnfolder]: 25/66 cut-off events. [2023-08-30 02:11:25,667 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:11:25,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 66 events. 25/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 186 event pairs, 17 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 133. Up to 64 conditions per place. [2023-08-30 02:11:25,668 INFO L137 encePairwiseOnDemand]: 232/235 looper letters, 23 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2023-08-30 02:11:25,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 106 flow [2023-08-30 02:11:25,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:11:25,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:11:25,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2023-08-30 02:11:25,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4453900709219858 [2023-08-30 02:11:25,672 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2023-08-30 02:11:25,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2023-08-30 02:11:25,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:11:25,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2023-08-30 02:11:25,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states 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 02:11:25,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states 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 02:11:25,678 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states 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 02:11:25,678 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 58 flow. Second operand 3 states and 314 transitions. [2023-08-30 02:11:25,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 106 flow [2023-08-30 02:11:25,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:11:25,679 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 60 flow [2023-08-30 02:11:25,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2023-08-30 02:11:25,680 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-30 02:11:25,680 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 60 flow [2023-08-30 02:11:25,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states 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 02:11:25,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:11:25,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:11:25,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-30 02:11:25,890 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 02:11:25,891 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:11:25,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:11:25,894 INFO L85 PathProgramCache]: Analyzing trace with hash 427109, now seen corresponding path program 1 times [2023-08-30 02:11:25,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:11:25,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026845396] [2023-08-30 02:11:25,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:11:25,895 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 02:11:25,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:11:25,896 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 02:11:25,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-30 02:11:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:11:25,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 02:11:25,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:11:25,994 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 02:11:25,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:11:25,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:11:25,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026845396] [2023-08-30 02:11:25,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026845396] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:11:25,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:11:25,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:11:25,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142375168] [2023-08-30 02:11:25,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:11:25,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:11:25,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:11:25,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:11:25,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:11:26,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-08-30 02:11:26,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states 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 02:11:26,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:11:26,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-08-30 02:11:26,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:11:26,359 INFO L130 PetriNetUnfolder]: 47/121 cut-off events. [2023-08-30 02:11:26,359 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:11:26,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 121 events. 47/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 466 event pairs, 30 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 246. Up to 61 conditions per place. [2023-08-30 02:11:26,361 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 42 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2023-08-30 02:11:26,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 47 transitions, 199 flow [2023-08-30 02:11:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:11:26,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:11:26,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2023-08-30 02:11:26,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475177304964539 [2023-08-30 02:11:26,365 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 335 transitions. [2023-08-30 02:11:26,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions. [2023-08-30 02:11:26,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:11:26,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions. [2023-08-30 02:11:26,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states 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 02:11:26,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states 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 02:11:26,388 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states 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 02:11:26,388 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 60 flow. Second operand 3 states and 335 transitions. [2023-08-30 02:11:26,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 47 transitions, 199 flow [2023-08-30 02:11:26,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 47 transitions, 193 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:11:26,390 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 82 flow [2023-08-30 02:11:26,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2023-08-30 02:11:26,392 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -4 predicate places. [2023-08-30 02:11:26,392 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 82 flow [2023-08-30 02:11:26,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states 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 02:11:26,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:11:26,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-30 02:11:26,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-30 02:11:26,601 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 02:11:26,602 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:11:26,603 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:11:26,603 INFO L85 PathProgramCache]: Analyzing trace with hash 13241362, now seen corresponding path program 1 times [2023-08-30 02:11:26,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:11:26,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514680095] [2023-08-30 02:11:26,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:11:26,604 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 02:11:26,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:11:26,605 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 02:11:26,611 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 02:11:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:11:26,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-30 02:11:26,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:11:26,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:11:26,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-30 02:11:26,703 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 10 treesize of output 8 [2023-08-30 02:11:26,767 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 02:11:26,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 18 [2023-08-30 02:11:26,824 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 02:11:26,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:11:26,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:11:26,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514680095] [2023-08-30 02:11:26,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514680095] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:11:26,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:11:26,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:11:26,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726769249] [2023-08-30 02:11:26,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:11:26,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:11:26,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:11:26,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:11:26,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:11:26,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 235 [2023-08-30 02:11:26,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:11:26,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:11:26,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 235 [2023-08-30 02:11:26,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:11:27,162 INFO L130 PetriNetUnfolder]: 47/120 cut-off events. [2023-08-30 02:11:27,162 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 02:11:27,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 120 events. 47/120 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 461 event pairs, 30 based on Foata normal form. 1/49 useless extension candidates. Maximal degree in co-relation 253. Up to 113 conditions per place. [2023-08-30 02:11:27,163 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 22 selfloop transitions, 4 changer transitions 0/27 dead transitions. [2023-08-30 02:11:27,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 27 transitions, 130 flow [2023-08-30 02:11:27,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:11:27,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:11:27,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 414 transitions. [2023-08-30 02:11:27,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44042553191489364 [2023-08-30 02:11:27,166 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 414 transitions. [2023-08-30 02:11:27,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 414 transitions. [2023-08-30 02:11:27,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:11:27,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 414 transitions. [2023-08-30 02:11:27,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states 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 02:11:27,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states 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 02:11:27,170 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states 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 02:11:27,170 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 82 flow. Second operand 4 states and 414 transitions. [2023-08-30 02:11:27,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 27 transitions, 130 flow [2023-08-30 02:11:27,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:11:27,172 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 78 flow [2023-08-30 02:11:27,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2023-08-30 02:11:27,172 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -4 predicate places. [2023-08-30 02:11:27,173 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 78 flow [2023-08-30 02:11:27,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:11:27,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:11:27,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 02:11:27,185 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 02:11:27,380 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 02:11:27,380 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:11:27,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:11:27,381 INFO L85 PathProgramCache]: Analyzing trace with hash -160580097, now seen corresponding path program 1 times [2023-08-30 02:11:27,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:11:27,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129840983] [2023-08-30 02:11:27,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:11:27,381 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 02:11:27,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:11:27,383 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 02:11:27,391 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 02:11:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:11:27,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:11:27,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:11:27,470 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-30 02:11:27,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 19 [2023-08-30 02:11:27,507 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-30 02:11:27,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-08-30 02:11:27,519 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 02:11:27,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:11:27,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:11:27,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129840983] [2023-08-30 02:11:27,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129840983] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:11:27,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:11:27,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:11:27,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484724322] [2023-08-30 02:11:27,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:11:27,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:11:27,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:11:27,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:11:27,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:11:27,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-08-30 02:11:27,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states 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 02:11:27,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:11:27,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-08-30 02:11:27,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:11:27,654 INFO L130 PetriNetUnfolder]: 33/92 cut-off events. [2023-08-30 02:11:27,654 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 02:11:27,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 92 events. 33/92 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 321 event pairs, 20 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 197. Up to 88 conditions per place. [2023-08-30 02:11:27,655 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 21 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2023-08-30 02:11:27,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 122 flow [2023-08-30 02:11:27,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:11:27,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:11:27,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2023-08-30 02:11:27,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4425531914893617 [2023-08-30 02:11:27,657 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 312 transitions. [2023-08-30 02:11:27,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 312 transitions. [2023-08-30 02:11:27,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:11:27,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 312 transitions. [2023-08-30 02:11:27,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states 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 02:11:27,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states 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 02:11:27,661 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states 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 02:11:27,661 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 78 flow. Second operand 3 states and 312 transitions. [2023-08-30 02:11:27,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 122 flow [2023-08-30 02:11:27,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 114 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:11:27,662 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 72 flow [2023-08-30 02:11:27,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2023-08-30 02:11:27,663 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -7 predicate places. [2023-08-30 02:11:27,663 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 72 flow [2023-08-30 02:11:27,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states 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 02:11:27,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:11:27,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 02:11:27,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-30 02:11:27,864 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 02:11:27,865 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:11:27,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:11:27,865 INFO L85 PathProgramCache]: Analyzing trace with hash -160580096, now seen corresponding path program 1 times [2023-08-30 02:11:27,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:11:27,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803987959] [2023-08-30 02:11:27,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:11:27,866 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 02:11:27,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:11:27,867 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 02:11:27,869 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 02:11:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:11:27,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 02:11:27,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:11:27,975 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-30 02:11:27,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 19 [2023-08-30 02:11:27,998 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 02:11:27,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-08-30 02:11:28,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:11:28,060 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 02:11:28,071 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-08-30 02:11:28,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-08-30 02:11:28,097 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 02:11:28,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:11:28,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:11:28,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803987959] [2023-08-30 02:11:28,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803987959] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:11:28,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:11:28,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:11:28,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079272479] [2023-08-30 02:11:28,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:11:28,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:11:28,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:11:28,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:11:28,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:11:28,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 235 [2023-08-30 02:11:28,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:11:28,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:11:28,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 235 [2023-08-30 02:11:28,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:11:28,335 INFO L130 PetriNetUnfolder]: 19/64 cut-off events. [2023-08-30 02:11:28,335 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 02:11:28,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 64 events. 19/64 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 194 event pairs, 10 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 139. Up to 60 conditions per place. [2023-08-30 02:11:28,336 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 19 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2023-08-30 02:11:28,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 23 transitions, 112 flow [2023-08-30 02:11:28,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:11:28,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:11:28,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2023-08-30 02:11:28,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4269503546099291 [2023-08-30 02:11:28,338 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 301 transitions. [2023-08-30 02:11:28,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 301 transitions. [2023-08-30 02:11:28,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:11:28,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 301 transitions. [2023-08-30 02:11:28,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states 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 02:11:28,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states 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 02:11:28,340 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states 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 02:11:28,340 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 72 flow. Second operand 3 states and 301 transitions. [2023-08-30 02:11:28,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 23 transitions, 112 flow [2023-08-30 02:11:28,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 23 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:11:28,341 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 68 flow [2023-08-30 02:11:28,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=27, PETRI_TRANSITIONS=23} [2023-08-30 02:11:28,342 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -9 predicate places. [2023-08-30 02:11:28,342 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 68 flow [2023-08-30 02:11:28,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:11:28,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:11:28,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:11:28,352 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 02:11:28,552 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 02:11:28,552 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:11:28,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:11:28,553 INFO L85 PathProgramCache]: Analyzing trace with hash 752237882, now seen corresponding path program 1 times [2023-08-30 02:11:28,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:11:28,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863552401] [2023-08-30 02:11:28,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:11:28,553 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 02:11:28,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:11:28,554 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 02:11:28,557 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 02:11:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:11:28,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 02:11:28,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:11:28,667 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-08-30 02:11:28,667 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 4 case distinctions, treesize of input 22 treesize of output 42 [2023-08-30 02:11:28,720 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-30 02:11:28,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 28 [2023-08-30 02:11:28,818 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 02:11:28,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:11:28,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:11:28,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863552401] [2023-08-30 02:11:28,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863552401] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:11:28,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:11:28,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:11:28,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717128161] [2023-08-30 02:11:28,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:11:28,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:11:28,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:11:28,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:11:28,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:11:28,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 235 [2023-08-30 02:11:28,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states 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 02:11:28,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:11:28,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 235 [2023-08-30 02:11:28,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:11:29,082 INFO L130 PetriNetUnfolder]: 19/74 cut-off events. [2023-08-30 02:11:29,082 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 02:11:29,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 74 events. 19/74 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 252 event pairs, 2 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 165. Up to 42 conditions per place. [2023-08-30 02:11:29,083 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 23 selfloop transitions, 6 changer transitions 0/29 dead transitions. [2023-08-30 02:11:29,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 29 transitions, 147 flow [2023-08-30 02:11:29,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:11:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:11:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 363 transitions. [2023-08-30 02:11:29,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3861702127659574 [2023-08-30 02:11:29,085 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 363 transitions. [2023-08-30 02:11:29,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 363 transitions. [2023-08-30 02:11:29,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:11:29,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 363 transitions. [2023-08-30 02:11:29,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states 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 02:11:29,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states 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 02:11:29,088 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states 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 02:11:29,088 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 68 flow. Second operand 4 states and 363 transitions. [2023-08-30 02:11:29,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 29 transitions, 147 flow [2023-08-30 02:11:29,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 29 transitions, 137 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:11:29,090 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 80 flow [2023-08-30 02:11:29,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2023-08-30 02:11:29,090 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -9 predicate places. [2023-08-30 02:11:29,091 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 80 flow [2023-08-30 02:11:29,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states 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 02:11:29,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:11:29,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:11:29,101 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 02:11:29,300 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 02:11:29,300 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:11:29,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:11:29,301 INFO L85 PathProgramCache]: Analyzing trace with hash 752237920, now seen corresponding path program 1 times [2023-08-30 02:11:29,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:11:29,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732005923] [2023-08-30 02:11:29,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:11:29,301 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 02:11:29,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:11:29,302 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 02:11:29,302 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 02:11:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:11:29,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-30 02:11:29,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:11:29,469 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2023-08-30 02:11:29,470 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 4 case distinctions, treesize of input 22 treesize of output 38 [2023-08-30 02:11:29,507 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-08-30 02:11:29,507 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 2 case distinctions, treesize of input 15 treesize of output 27 [2023-08-30 02:11:29,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:11:29,672 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-30 02:11:29,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2023-08-30 02:11:29,708 INFO L321 Elim1Store]: treesize reduction 6, result has 80.6 percent of original size [2023-08-30 02:11:29,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 53 [2023-08-30 02:11:29,916 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 02:11:29,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:11:29,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:11:29,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732005923] [2023-08-30 02:11:29,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732005923] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:11:29,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:11:29,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:11:29,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022471300] [2023-08-30 02:11:29,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:11:29,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:11:29,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:11:29,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:11:29,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:11:30,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-08-30 02:11:30,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states 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 02:11:30,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:11:30,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-08-30 02:11:30,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:11:30,597 INFO L130 PetriNetUnfolder]: 28/108 cut-off events. [2023-08-30 02:11:30,597 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2023-08-30 02:11:30,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 108 events. 28/108 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 473 event pairs, 12 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 241. Up to 67 conditions per place. [2023-08-30 02:11:30,598 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 25 selfloop transitions, 10 changer transitions 0/35 dead transitions. [2023-08-30 02:11:30,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 181 flow [2023-08-30 02:11:30,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:11:30,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:11:30,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 704 transitions. [2023-08-30 02:11:30,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4279635258358663 [2023-08-30 02:11:30,601 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 704 transitions. [2023-08-30 02:11:30,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 704 transitions. [2023-08-30 02:11:30,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:11:30,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 704 transitions. [2023-08-30 02:11:30,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.57142857142857) internal successors, (704), 7 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 02:11:30,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states 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 02:11:30,606 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states 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 02:11:30,607 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 80 flow. Second operand 7 states and 704 transitions. [2023-08-30 02:11:30,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 35 transitions, 181 flow [2023-08-30 02:11:30,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 174 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:11:30,608 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 115 flow [2023-08-30 02:11:30,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=115, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2023-08-30 02:11:30,609 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2023-08-30 02:11:30,609 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 115 flow [2023-08-30 02:11:30,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states 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 02:11:30,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:11:30,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:11:30,621 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 02:11:30,818 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 02:11:30,819 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:11:30,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:11:30,820 INFO L85 PathProgramCache]: Analyzing trace with hash 752237991, now seen corresponding path program 1 times [2023-08-30 02:11:30,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:11:30,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581129458] [2023-08-30 02:11:30,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:11:30,820 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 02:11:30,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:11:30,821 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 02:11:30,825 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 02:11:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:11:30,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 02:11:30,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:11:30,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 02:11:30,934 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 02:11:30,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:11:30,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:11:30,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581129458] [2023-08-30 02:11:30,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581129458] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:11:30,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:11:30,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:11:30,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799691578] [2023-08-30 02:11:30,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:11:30,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:11:30,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:11:30,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:11:30,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:11:31,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-08-30 02:11:31,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states 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 02:11:31,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:11:31,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-08-30 02:11:31,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:11:31,150 INFO L130 PetriNetUnfolder]: 26/96 cut-off events. [2023-08-30 02:11:31,150 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2023-08-30 02:11:31,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 96 events. 26/96 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 375 event pairs, 12 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 242. Up to 67 conditions per place. [2023-08-30 02:11:31,151 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 29 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2023-08-30 02:11:31,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 190 flow [2023-08-30 02:11:31,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:11:31,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:11:31,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 415 transitions. [2023-08-30 02:11:31,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44148936170212766 [2023-08-30 02:11:31,153 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 415 transitions. [2023-08-30 02:11:31,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 415 transitions. [2023-08-30 02:11:31,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:11:31,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 415 transitions. [2023-08-30 02:11:31,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.75) internal successors, (415), 4 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 02:11:31,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states 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 02:11:31,157 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states 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 02:11:31,157 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 115 flow. Second operand 4 states and 415 transitions. [2023-08-30 02:11:31,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 190 flow [2023-08-30 02:11:31,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 32 transitions, 187 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:11:31,161 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 120 flow [2023-08-30 02:11:31,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-08-30 02:11:31,162 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2023-08-30 02:11:31,162 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 120 flow [2023-08-30 02:11:31,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states 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 02:11:31,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:11:31,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:11:31,175 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 02:11:31,372 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 02:11:31,373 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:11:31,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:11:31,373 INFO L85 PathProgramCache]: Analyzing trace with hash 752237992, now seen corresponding path program 1 times [2023-08-30 02:11:31,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:11:31,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330950207] [2023-08-30 02:11:31,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:11:31,373 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 02:11:31,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:11:31,374 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 02:11:31,375 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 02:11:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:11:31,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 02:11:31,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:11:31,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-08-30 02:11:31,463 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 02:11:31,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:11:31,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:11:31,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1330950207] [2023-08-30 02:11:31,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1330950207] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:11:31,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:11:31,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:11:31,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787495776] [2023-08-30 02:11:31,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:11:31,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:11:31,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:11:31,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:11:31,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:11:31,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-08-30 02:11:31,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states 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 02:11:31,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:11:31,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-08-30 02:11:31,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:11:31,652 INFO L130 PetriNetUnfolder]: 22/78 cut-off events. [2023-08-30 02:11:31,652 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2023-08-30 02:11:31,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 78 events. 22/78 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 259 event pairs, 2 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 223. Up to 48 conditions per place. [2023-08-30 02:11:31,653 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 19 selfloop transitions, 8 changer transitions 0/27 dead transitions. [2023-08-30 02:11:31,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 177 flow [2023-08-30 02:11:31,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:11:31,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:11:31,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 409 transitions. [2023-08-30 02:11:31,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4351063829787234 [2023-08-30 02:11:31,657 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 409 transitions. [2023-08-30 02:11:31,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 409 transitions. [2023-08-30 02:11:31,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:11:31,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 409 transitions. [2023-08-30 02:11:31,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 states 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 02:11:31,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states 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 02:11:31,660 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states 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 02:11:31,660 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 120 flow. Second operand 4 states and 409 transitions. [2023-08-30 02:11:31,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 177 flow [2023-08-30 02:11:31,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 171 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:11:31,661 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 126 flow [2023-08-30 02:11:31,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-08-30 02:11:31,662 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -4 predicate places. [2023-08-30 02:11:31,662 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 126 flow [2023-08-30 02:11:31,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states 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 02:11:31,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:11:31,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:11:31,673 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 02:11:31,863 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 02:11:31,863 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:11:31,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:11:31,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1844542252, now seen corresponding path program 1 times [2023-08-30 02:11:31,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:11:31,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210575738] [2023-08-30 02:11:31,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:11:31,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:11:31,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:11:31,865 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 02:11:31,866 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 02:11:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:11:31,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-30 02:11:31,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:11:31,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:11:32,001 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-08-30 02:11:32,001 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 2 case distinctions, treesize of input 15 treesize of output 27 [2023-08-30 02:11:32,051 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2023-08-30 02:11:32,052 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 4 case distinctions, treesize of input 22 treesize of output 38 [2023-08-30 02:11:32,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:11:32,174 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-30 02:11:32,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2023-08-30 02:11:32,210 INFO L321 Elim1Store]: treesize reduction 6, result has 80.6 percent of original size [2023-08-30 02:11:32,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 53 [2023-08-30 02:11:32,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:11:32,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:11:32,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:11:32,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:11:32,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1210575738] [2023-08-30 02:11:32,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1210575738] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:11:32,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 02:11:32,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2023-08-30 02:11:32,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443836946] [2023-08-30 02:11:32,595 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 02:11:32,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 02:11:32,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:11:32,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 02:11:32,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-30 02:11:34,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:11:36,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:11:38,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:11:40,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:11:43,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:11:45,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:11:47,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:11:49,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:11:51,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:11:54,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:11:56,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:11:58,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:12:00,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:12:02,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:12:04,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:12:06,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:12:08,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:12:10,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:12:10,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 235 [2023-08-30 02:12:10,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 126 flow. Second operand has 10 states, 10 states have (on average 72.0) internal successors, (720), 10 states have internal predecessors, (720), 0 states have call successors, (0), 0 states 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 02:12:10,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:12:10,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 235 [2023-08-30 02:12:10,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:12:11,451 INFO L130 PetriNetUnfolder]: 45/140 cut-off events. [2023-08-30 02:12:11,451 INFO L131 PetriNetUnfolder]: For 116/116 co-relation queries the response was YES. [2023-08-30 02:12:11,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 140 events. 45/140 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 569 event pairs, 6 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 385. Up to 37 conditions per place. [2023-08-30 02:12:11,452 INFO L137 encePairwiseOnDemand]: 227/235 looper letters, 31 selfloop transitions, 19 changer transitions 0/50 dead transitions. [2023-08-30 02:12:11,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 322 flow [2023-08-30 02:12:11,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-30 02:12:11,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-30 02:12:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 958 transitions. [2023-08-30 02:12:11,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31358428805237315 [2023-08-30 02:12:11,456 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 958 transitions. [2023-08-30 02:12:11,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 958 transitions. [2023-08-30 02:12:11,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:12:11,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 958 transitions. [2023-08-30 02:12:11,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 73.6923076923077) internal successors, (958), 13 states have internal predecessors, (958), 0 states have call successors, (0), 0 states 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 02:12:11,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 235.0) internal successors, (3290), 14 states have internal predecessors, (3290), 0 states have call successors, (0), 0 states 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 02:12:11,463 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 235.0) internal successors, (3290), 14 states have internal predecessors, (3290), 0 states have call successors, (0), 0 states 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 02:12:11,463 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 126 flow. Second operand 13 states and 958 transitions. [2023-08-30 02:12:11,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 322 flow [2023-08-30 02:12:11,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 298 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:12:11,465 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 227 flow [2023-08-30 02:12:11,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=227, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2023-08-30 02:12:11,465 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2023-08-30 02:12:11,466 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 227 flow [2023-08-30 02:12:11,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 72.0) internal successors, (720), 10 states have internal predecessors, (720), 0 states have call successors, (0), 0 states 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 02:12:11,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:12:11,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:12:11,479 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 02:12:11,668 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 02:12:11,669 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:12:11,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:12:11,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1844542323, now seen corresponding path program 1 times [2023-08-30 02:12:11,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:12:11,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95576806] [2023-08-30 02:12:11,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:12:11,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:12:11,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:12:11,671 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 02:12:11,674 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 02:12:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:12:11,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 02:12:11,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:12:11,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 02:12:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:12:11,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:12:11,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:12:11,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:12:11,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95576806] [2023-08-30 02:12:11,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95576806] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:12:11,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 02:12:11,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-08-30 02:12:11,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597946767] [2023-08-30 02:12:11,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 02:12:11,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:12:11,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:12:11,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:12:11,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:12:12,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 235 [2023-08-30 02:12:12,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 227 flow. Second operand has 8 states, 8 states have (on average 95.125) internal successors, (761), 8 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:12:12,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:12:12,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 235 [2023-08-30 02:12:12,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:12:12,695 INFO L130 PetriNetUnfolder]: 37/124 cut-off events. [2023-08-30 02:12:12,695 INFO L131 PetriNetUnfolder]: For 170/170 co-relation queries the response was YES. [2023-08-30 02:12:12,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 124 events. 37/124 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 484 event pairs, 8 based on Foata normal form. 12/136 useless extension candidates. Maximal degree in co-relation 431. Up to 45 conditions per place. [2023-08-30 02:12:12,696 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 40 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2023-08-30 02:12:12,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 355 flow [2023-08-30 02:12:12,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:12:12,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:12:12,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 696 transitions. [2023-08-30 02:12:12,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4231003039513678 [2023-08-30 02:12:12,703 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 696 transitions. [2023-08-30 02:12:12,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 696 transitions. [2023-08-30 02:12:12,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:12:12,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 696 transitions. [2023-08-30 02:12:12,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.42857142857143) internal successors, (696), 7 states have internal predecessors, (696), 0 states have call successors, (0), 0 states 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 02:12:12,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states 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 02:12:12,708 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states 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 02:12:12,708 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 227 flow. Second operand 7 states and 696 transitions. [2023-08-30 02:12:12,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 355 flow [2023-08-30 02:12:12,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 318 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-30 02:12:12,711 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 198 flow [2023-08-30 02:12:12,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=198, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-08-30 02:12:12,712 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2023-08-30 02:12:12,712 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 198 flow [2023-08-30 02:12:12,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.125) internal successors, (761), 8 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:12:12,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:12:12,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:12:12,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-30 02:12:12,922 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 02:12:12,922 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:12:12,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:12:12,922 INFO L85 PathProgramCache]: Analyzing trace with hash 549438196, now seen corresponding path program 1 times [2023-08-30 02:12:12,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:12:12,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032132876] [2023-08-30 02:12:12,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:12:12,923 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 02:12:12,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:12:12,924 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:12:12,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-08-30 02:12:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:12:12,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-30 02:12:12,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:12:13,002 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 02:12:13,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:12:13,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:12:13,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032132876] [2023-08-30 02:12:13,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032132876] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:12:13,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:12:13,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:12:13,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135946468] [2023-08-30 02:12:13,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:12:13,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:12:13,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:12:13,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:12:13,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:12:13,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 235 [2023-08-30 02:12:13,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 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 02:12:13,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:12:13,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 235 [2023-08-30 02:12:13,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:12:13,069 INFO L130 PetriNetUnfolder]: 34/112 cut-off events. [2023-08-30 02:12:13,069 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2023-08-30 02:12:13,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 112 events. 34/112 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 402 event pairs, 22 based on Foata normal form. 4/116 useless extension candidates. Maximal degree in co-relation 390. Up to 109 conditions per place. [2023-08-30 02:12:13,071 INFO L137 encePairwiseOnDemand]: 233/235 looper letters, 28 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-08-30 02:12:13,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 29 transitions, 236 flow [2023-08-30 02:12:13,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:12:13,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:12:13,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-08-30 02:12:13,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595744680851064 [2023-08-30 02:12:13,077 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-08-30 02:12:13,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-08-30 02:12:13,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:12:13,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-08-30 02:12:13,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states 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 02:12:13,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states 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 02:12:13,080 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states 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 02:12:13,080 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 198 flow. Second operand 3 states and 324 transitions. [2023-08-30 02:12:13,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 29 transitions, 236 flow [2023-08-30 02:12:13,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 223 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-30 02:12:13,084 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 167 flow [2023-08-30 02:12:13,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-08-30 02:12:13,086 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2023-08-30 02:12:13,086 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 167 flow [2023-08-30 02:12:13,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 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 02:12:13,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:12:13,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:12:13,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-08-30 02:12:13,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:12:13,293 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:12:13,293 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:12:13,293 INFO L85 PathProgramCache]: Analyzing trace with hash -152178954, now seen corresponding path program 1 times [2023-08-30 02:12:13,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:12:13,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206032706] [2023-08-30 02:12:13,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:12:13,294 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 02:12:13,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:12:13,295 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:12:13,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-08-30 02:12:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:12:13,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-30 02:12:13,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:12:13,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-30 02:12:13,451 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 02:12:13,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:12:13,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:12:13,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206032706] [2023-08-30 02:12:13,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206032706] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:12:13,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:12:13,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:12:13,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491804157] [2023-08-30 02:12:13,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:12:13,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:12:13,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:12:13,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:12:13,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:12:13,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 235 [2023-08-30 02:12:13,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states 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 02:12:13,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:12:13,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 235 [2023-08-30 02:12:13,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:12:13,672 INFO L130 PetriNetUnfolder]: 33/110 cut-off events. [2023-08-30 02:12:13,672 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2023-08-30 02:12:13,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 110 events. 33/110 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 399 event pairs, 18 based on Foata normal form. 2/108 useless extension candidates. Maximal degree in co-relation 360. Up to 91 conditions per place. [2023-08-30 02:12:13,673 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 28 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2023-08-30 02:12:13,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 32 transitions, 228 flow [2023-08-30 02:12:13,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:12:13,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:12:13,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-08-30 02:12:13,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43319148936170215 [2023-08-30 02:12:13,676 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-08-30 02:12:13,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-08-30 02:12:13,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:12:13,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-08-30 02:12:13,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 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 02:12:13,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states 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 02:12:13,680 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states 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 02:12:13,680 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 167 flow. Second operand 5 states and 509 transitions. [2023-08-30 02:12:13,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 32 transitions, 228 flow [2023-08-30 02:12:13,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 32 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:12:13,682 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 167 flow [2023-08-30 02:12:13,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-30 02:12:13,682 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2023-08-30 02:12:13,682 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 167 flow [2023-08-30 02:12:13,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states 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 02:12:13,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:12:13,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:12:13,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-08-30 02:12:13,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:12:13,892 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:12:13,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:12:13,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1233141669, now seen corresponding path program 1 times [2023-08-30 02:12:13,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:12:13,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680926469] [2023-08-30 02:12:13,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:12:13,893 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 02:12:13,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:12:13,894 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:12:13,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-08-30 02:12:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:12:13,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-30 02:12:13,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:12:14,008 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2023-08-30 02:12:14,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 38 [2023-08-30 02:12:14,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:12:14,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:12:14,110 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 02:12:14,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:12:14,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:12:14,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680926469] [2023-08-30 02:12:14,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680926469] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:12:14,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:12:14,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:12:14,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190510524] [2023-08-30 02:12:14,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:12:14,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:12:14,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:12:14,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:12:14,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:12:14,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 235 [2023-08-30 02:12:14,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 167 flow. Second operand has 6 states, 6 states have (on average 96.0) internal successors, (576), 6 states have internal predecessors, (576), 0 states have call successors, (0), 0 states 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 02:12:14,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:12:14,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 235 [2023-08-30 02:12:14,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:12:14,456 INFO L130 PetriNetUnfolder]: 31/100 cut-off events. [2023-08-30 02:12:14,456 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2023-08-30 02:12:14,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 100 events. 31/100 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 327 event pairs, 2 based on Foata normal form. 4/100 useless extension candidates. Maximal degree in co-relation 362. Up to 75 conditions per place. [2023-08-30 02:12:14,457 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 25 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2023-08-30 02:12:14,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 230 flow [2023-08-30 02:12:14,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:12:14,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:12:14,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 398 transitions. [2023-08-30 02:12:14,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42340425531914894 [2023-08-30 02:12:14,459 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 398 transitions. [2023-08-30 02:12:14,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 398 transitions. [2023-08-30 02:12:14,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:12:14,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 398 transitions. [2023-08-30 02:12:14,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states 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 02:12:14,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states 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 02:12:14,461 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states 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 02:12:14,461 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 167 flow. Second operand 4 states and 398 transitions. [2023-08-30 02:12:14,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 230 flow [2023-08-30 02:12:14,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 30 transitions, 222 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-30 02:12:14,462 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 175 flow [2023-08-30 02:12:14,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-30 02:12:14,463 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2023-08-30 02:12:14,463 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 175 flow [2023-08-30 02:12:14,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.0) internal successors, (576), 6 states have internal predecessors, (576), 0 states have call successors, (0), 0 states 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 02:12:14,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:12:14,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:12:14,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-08-30 02:12:14,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:12:14,677 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:12:14,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:12:14,677 INFO L85 PathProgramCache]: Analyzing trace with hash -422767146, now seen corresponding path program 1 times [2023-08-30 02:12:14,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:12:14,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65858421] [2023-08-30 02:12:14,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:12:14,678 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 02:12:14,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:12:14,679 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:12:14,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-08-30 02:12:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:12:14,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-30 02:12:14,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:12:14,847 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-30 02:12:14,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-30 02:12:14,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:12:14,934 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-30 02:12:14,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 02:12:14,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:12:15,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:12:15,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:12:15,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:12:15,108 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_210 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_210) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| (_ bv1 32)))) (_ bv0 8)))) is different from false [2023-08-30 02:12:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-30 02:12:17,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:12:17,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65858421] [2023-08-30 02:12:17,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [65858421] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:12:17,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 02:12:17,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-08-30 02:12:17,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066233525] [2023-08-30 02:12:17,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 02:12:17,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 02:12:17,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:12:17,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 02:12:17,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=78, Unknown=9, NotChecked=18, Total=132 [2023-08-30 02:12:17,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 235 [2023-08-30 02:12:17,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 175 flow. Second operand has 12 states, 12 states have (on average 47.0) internal successors, (564), 12 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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 02:12:17,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:12:17,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 235 [2023-08-30 02:12:17,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:12:17,999 INFO L130 PetriNetUnfolder]: 28/88 cut-off events. [2023-08-30 02:12:17,999 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2023-08-30 02:12:18,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 88 events. 28/88 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 257 event pairs, 0 based on Foata normal form. 4/88 useless extension candidates. Maximal degree in co-relation 337. Up to 63 conditions per place. [2023-08-30 02:12:18,000 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 24 selfloop transitions, 4 changer transitions 0/28 dead transitions. [2023-08-30 02:12:18,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 28 transitions, 212 flow [2023-08-30 02:12:18,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:12:18,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:12:18,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 247 transitions. [2023-08-30 02:12:18,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2102127659574468 [2023-08-30 02:12:18,002 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 247 transitions. [2023-08-30 02:12:18,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 247 transitions. [2023-08-30 02:12:18,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:12:18,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 247 transitions. [2023-08-30 02:12:18,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 0 states have call successors, (0), 0 states 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 02:12:18,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states 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 02:12:18,007 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states 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 02:12:18,007 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 175 flow. Second operand 5 states and 247 transitions. [2023-08-30 02:12:18,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 28 transitions, 212 flow [2023-08-30 02:12:18,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 28 transitions, 202 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-30 02:12:18,008 INFO L231 Difference]: Finished difference. Result has 42 places, 25 transitions, 148 flow [2023-08-30 02:12:18,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2023-08-30 02:12:18,010 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2023-08-30 02:12:18,010 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 148 flow [2023-08-30 02:12:18,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 47.0) internal successors, (564), 12 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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 02:12:18,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:12:18,011 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:12:18,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-08-30 02:12:18,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:12:18,221 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:12:18,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:12:18,221 INFO L85 PathProgramCache]: Analyzing trace with hash 949833824, now seen corresponding path program 2 times [2023-08-30 02:12:18,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:12:18,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1580227169] [2023-08-30 02:12:18,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:12:18,222 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 02:12:18,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:12:18,223 INFO L229 MonitoredProcess]: Starting monitored process 18 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 02:12:18,235 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 (18)] Waiting until timeout for monitored process [2023-08-30 02:12:18,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 02:12:18,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:12:18,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-30 02:12:18,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:12:18,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:12:18,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:12:18,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:12:18,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-30 02:12:18,379 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-30 02:12:18,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-30 02:12:18,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:12:18,437 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 02:12:18,569 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:12:18,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:12:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:12:18,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:12:18,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1580227169] [2023-08-30 02:12:18,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1580227169] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:12:18,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 02:12:18,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2023-08-30 02:12:18,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314177629] [2023-08-30 02:12:18,775 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 02:12:18,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-30 02:12:18,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:12:18,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-30 02:12:18,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2023-08-30 02:12:21,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:12:23,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:12:25,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:12:26,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 235 [2023-08-30 02:12:26,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 148 flow. Second operand has 16 states, 16 states have (on average 79.625) internal successors, (1274), 16 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states 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 02:12:26,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:12:26,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 235 [2023-08-30 02:12:26,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:12:27,464 INFO L130 PetriNetUnfolder]: 58/182 cut-off events. [2023-08-30 02:12:27,464 INFO L131 PetriNetUnfolder]: For 160/160 co-relation queries the response was YES. [2023-08-30 02:12:27,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 182 events. 58/182 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 720 event pairs, 4 based on Foata normal form. 16/178 useless extension candidates. Maximal degree in co-relation 665. Up to 53 conditions per place. [2023-08-30 02:12:27,466 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 40 selfloop transitions, 24 changer transitions 0/64 dead transitions. [2023-08-30 02:12:27,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 64 transitions, 465 flow [2023-08-30 02:12:27,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-30 02:12:27,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-30 02:12:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1387 transitions. [2023-08-30 02:12:27,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3471839799749687 [2023-08-30 02:12:27,471 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1387 transitions. [2023-08-30 02:12:27,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1387 transitions. [2023-08-30 02:12:27,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:12:27,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1387 transitions. [2023-08-30 02:12:27,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 81.58823529411765) internal successors, (1387), 17 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states 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 02:12:27,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 235.0) internal successors, (4230), 18 states have internal predecessors, (4230), 0 states have call successors, (0), 0 states 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 02:12:27,479 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 235.0) internal successors, (4230), 18 states have internal predecessors, (4230), 0 states have call successors, (0), 0 states 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 02:12:27,479 INFO L175 Difference]: Start difference. First operand has 42 places, 25 transitions, 148 flow. Second operand 17 states and 1387 transitions. [2023-08-30 02:12:27,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 64 transitions, 465 flow [2023-08-30 02:12:27,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 457 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:12:27,482 INFO L231 Difference]: Finished difference. Result has 59 places, 39 transitions, 326 flow [2023-08-30 02:12:27,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=326, PETRI_PLACES=59, PETRI_TRANSITIONS=39} [2023-08-30 02:12:27,483 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 23 predicate places. [2023-08-30 02:12:27,483 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 39 transitions, 326 flow [2023-08-30 02:12:27,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.625) internal successors, (1274), 16 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states 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 02:12:27,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:12:27,483 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:12:27,497 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 (18)] Forceful destruction successful, exit code 0 [2023-08-30 02:12:27,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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 02:12:27,693 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:12:27,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:12:27,694 INFO L85 PathProgramCache]: Analyzing trace with hash 949833895, now seen corresponding path program 2 times [2023-08-30 02:12:27,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:12:27,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [426624389] [2023-08-30 02:12:27,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:12:27,694 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 02:12:27,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:12:27,697 INFO L229 MonitoredProcess]: Starting monitored process 19 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 02:12:27,699 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 (19)] Waiting until timeout for monitored process [2023-08-30 02:12:27,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:12:27,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:12:27,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-30 02:12:27,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:12:27,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:12:27,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:12:27,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:12:27,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-30 02:12:27,831 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-30 02:12:27,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 14 [2023-08-30 02:12:27,933 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-30 02:12:27,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:12:27,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:12:27,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [426624389] [2023-08-30 02:12:27,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [426624389] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:12:27,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:12:27,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:12:27,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559666403] [2023-08-30 02:12:27,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:12:27,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:12:27,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:12:27,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:12:27,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:12:28,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 235 [2023-08-30 02:12:28,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 39 transitions, 326 flow. Second operand has 5 states, 5 states have (on average 100.0) internal successors, (500), 5 states have internal predecessors, (500), 0 states have call successors, (0), 0 states 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 02:12:28,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:12:28,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 235 [2023-08-30 02:12:28,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:12:28,214 INFO L130 PetriNetUnfolder]: 46/154 cut-off events. [2023-08-30 02:12:28,214 INFO L131 PetriNetUnfolder]: For 178/178 co-relation queries the response was YES. [2023-08-30 02:12:28,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 154 events. 46/154 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 573 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 677. Up to 140 conditions per place. [2023-08-30 02:12:28,215 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 35 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2023-08-30 02:12:28,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 38 transitions, 386 flow [2023-08-30 02:12:28,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:12:28,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:12:28,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2023-08-30 02:12:28,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4323404255319149 [2023-08-30 02:12:28,218 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 508 transitions. [2023-08-30 02:12:28,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 508 transitions. [2023-08-30 02:12:28,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:12:28,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 508 transitions. [2023-08-30 02:12:28,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states 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 02:12:28,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states 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 02:12:28,221 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states 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 02:12:28,222 INFO L175 Difference]: Start difference. First operand has 59 places, 39 transitions, 326 flow. Second operand 5 states and 508 transitions. [2023-08-30 02:12:28,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 38 transitions, 386 flow [2023-08-30 02:12:28,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 38 transitions, 365 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-30 02:12:28,224 INFO L231 Difference]: Finished difference. Result has 57 places, 37 transitions, 293 flow [2023-08-30 02:12:28,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=293, PETRI_PLACES=57, PETRI_TRANSITIONS=37} [2023-08-30 02:12:28,225 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2023-08-30 02:12:28,225 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 37 transitions, 293 flow [2023-08-30 02:12:28,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.0) internal successors, (500), 5 states have internal predecessors, (500), 0 states have call successors, (0), 0 states 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 02:12:28,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:12:28,226 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:12:28,238 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 (19)] Forceful destruction successful, exit code 0 [2023-08-30 02:12:28,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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 02:12:28,436 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:12:28,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:12:28,436 INFO L85 PathProgramCache]: Analyzing trace with hash -221066506, now seen corresponding path program 2 times [2023-08-30 02:12:28,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:12:28,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483033914] [2023-08-30 02:12:28,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:12:28,437 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 02:12:28,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:12:28,438 INFO L229 MonitoredProcess]: Starting monitored process 20 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 02:12:28,483 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 (20)] Waiting until timeout for monitored process [2023-08-30 02:12:28,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 02:12:28,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:12:28,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-30 02:12:28,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:12:28,627 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-30 02:12:28,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-30 02:12:28,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:12:28,705 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-30 02:12:28,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 02:12:28,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 02:12:28,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:12:28,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:12:28,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:12:28,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:12:28,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:12:31,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:12:31,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:12:31,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483033914] [2023-08-30 02:12:31,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [483033914] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:12:31,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 02:12:31,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-08-30 02:12:31,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620170442] [2023-08-30 02:12:31,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 02:12:31,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 02:12:31,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:12:31,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 02:12:31,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=147, Unknown=1, NotChecked=0, Total=182 [2023-08-30 02:12:33,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:12:35,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:12:37,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:12:39,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:12:40,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:12:43,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:12:45,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:12:47,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:12:49,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:12:51,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:12:53,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:12:55,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:12:57,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:12:59,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:13:01,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:13:03,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:13:05,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:13:07,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:13:09,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:13:12,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:13:14,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:13:16,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:13:18,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:13:20,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:13:22,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:13:24,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:13:26,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:13:28,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:13:28,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 235 [2023-08-30 02:13:28,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 37 transitions, 293 flow. Second operand has 14 states, 14 states have (on average 47.857142857142854) internal successors, (670), 14 states have internal predecessors, (670), 0 states have call successors, (0), 0 states 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 02:13:28,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:13:28,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 235 [2023-08-30 02:13:28,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:13:31,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:13:33,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:13:35,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:13:37,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:13:37,986 INFO L130 PetriNetUnfolder]: 43/142 cut-off events. [2023-08-30 02:13:37,986 INFO L131 PetriNetUnfolder]: For 238/238 co-relation queries the response was YES. [2023-08-30 02:13:37,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 142 events. 43/142 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 507 event pairs, 2 based on Foata normal form. 4/146 useless extension candidates. Maximal degree in co-relation 586. Up to 65 conditions per place. [2023-08-30 02:13:37,987 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 30 selfloop transitions, 10 changer transitions 0/40 dead transitions. [2023-08-30 02:13:37,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 40 transitions, 365 flow [2023-08-30 02:13:37,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:13:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:13:37,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 395 transitions. [2023-08-30 02:13:37,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.21010638297872342 [2023-08-30 02:13:37,991 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 395 transitions. [2023-08-30 02:13:37,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 395 transitions. [2023-08-30 02:13:37,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:13:37,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 395 transitions. [2023-08-30 02:13:37,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 49.375) internal successors, (395), 8 states have internal predecessors, (395), 0 states have call successors, (0), 0 states 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 02:13:37,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states 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 02:13:37,995 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states 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 02:13:37,995 INFO L175 Difference]: Start difference. First operand has 57 places, 37 transitions, 293 flow. Second operand 8 states and 395 transitions. [2023-08-30 02:13:37,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 40 transitions, 365 flow [2023-08-30 02:13:37,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 40 transitions, 344 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-30 02:13:37,998 INFO L231 Difference]: Finished difference. Result has 58 places, 35 transitions, 274 flow [2023-08-30 02:13:37,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=274, PETRI_PLACES=58, PETRI_TRANSITIONS=35} [2023-08-30 02:13:37,999 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2023-08-30 02:13:37,999 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 35 transitions, 274 flow [2023-08-30 02:13:37,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 47.857142857142854) internal successors, (670), 14 states have internal predecessors, (670), 0 states have call successors, (0), 0 states 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 02:13:38,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:13:38,000 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:13:38,011 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 (20)] Forceful destruction successful, exit code 0 [2023-08-30 02:13:38,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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 02:13:38,210 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:13:38,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:13:38,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1551821286, now seen corresponding path program 3 times [2023-08-30 02:13:38,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:13:38,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925555252] [2023-08-30 02:13:38,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:13:38,211 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 02:13:38,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:13:38,212 INFO L229 MonitoredProcess]: Starting monitored process 21 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 02:13:38,215 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 (21)] Waiting until timeout for monitored process [2023-08-30 02:13:38,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-30 02:13:38,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:13:38,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-30 02:13:38,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:13:38,418 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-30 02:13:38,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-30 02:13:38,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:13:38,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 02:13:38,507 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-30 02:13:38,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 02:13:38,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:13:38,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:13:38,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:13:38,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:13:38,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:13:38,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:13:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:13:41,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:13:41,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925555252] [2023-08-30 02:13:41,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925555252] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:13:41,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 02:13:41,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-08-30 02:13:41,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441721991] [2023-08-30 02:13:41,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 02:13:41,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-30 02:13:41,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:13:41,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-30 02:13:41,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=199, Unknown=2, NotChecked=0, Total=240 [2023-08-30 02:13:43,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:13:45,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:13:47,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:13:48,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 235 [2023-08-30 02:13:48,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 35 transitions, 274 flow. Second operand has 16 states, 16 states have (on average 54.75) internal successors, (876), 16 states have internal predecessors, (876), 0 states have call successors, (0), 0 states 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 02:13:48,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:13:48,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 235 [2023-08-30 02:13:48,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:13:53,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:13:55,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:13:55,536 INFO L130 PetriNetUnfolder]: 40/130 cut-off events. [2023-08-30 02:13:55,536 INFO L131 PetriNetUnfolder]: For 256/256 co-relation queries the response was YES. [2023-08-30 02:13:55,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 130 events. 40/130 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 431 event pairs, 2 based on Foata normal form. 4/134 useless extension candidates. Maximal degree in co-relation 552. Up to 53 conditions per place. [2023-08-30 02:13:55,537 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 28 selfloop transitions, 13 changer transitions 0/41 dead transitions. [2023-08-30 02:13:55,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 41 transitions, 360 flow [2023-08-30 02:13:55,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 02:13:55,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 02:13:55,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 562 transitions. [2023-08-30 02:13:55,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23914893617021277 [2023-08-30 02:13:55,540 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 562 transitions. [2023-08-30 02:13:55,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 562 transitions. [2023-08-30 02:13:55,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:13:55,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 562 transitions. [2023-08-30 02:13:55,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 56.2) internal successors, (562), 10 states have internal predecessors, (562), 0 states have call successors, (0), 0 states 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 02:13:55,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 235.0) internal successors, (2585), 11 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states 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 02:13:55,545 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 235.0) internal successors, (2585), 11 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states 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 02:13:55,546 INFO L175 Difference]: Start difference. First operand has 58 places, 35 transitions, 274 flow. Second operand 10 states and 562 transitions. [2023-08-30 02:13:55,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 41 transitions, 360 flow [2023-08-30 02:13:55,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 41 transitions, 328 flow, removed 1 selfloop flow, removed 9 redundant places. [2023-08-30 02:13:55,548 INFO L231 Difference]: Finished difference. Result has 57 places, 34 transitions, 258 flow [2023-08-30 02:13:55,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=258, PETRI_PLACES=57, PETRI_TRANSITIONS=34} [2023-08-30 02:13:55,549 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2023-08-30 02:13:55,549 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 34 transitions, 258 flow [2023-08-30 02:13:55,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 54.75) internal successors, (876), 16 states have internal predecessors, (876), 0 states have call successors, (0), 0 states 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 02:13:55,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:13:55,556 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:13:55,566 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 (21)] Forceful destruction successful, exit code 0 [2023-08-30 02:13:55,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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 02:13:55,766 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:13:55,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:13:55,766 INFO L85 PathProgramCache]: Analyzing trace with hash 884869722, now seen corresponding path program 4 times [2023-08-30 02:13:55,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:13:55,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830012680] [2023-08-30 02:13:55,767 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 02:13:55,767 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 02:13:55,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:13:55,768 INFO L229 MonitoredProcess]: Starting monitored process 22 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 02:13:55,770 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 (22)] Waiting until timeout for monitored process [2023-08-30 02:13:55,900 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 02:13:55,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:13:55,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 26 conjunts are in the unsatisfiable core [2023-08-30 02:13:55,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:13:55,939 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-30 02:13:55,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-30 02:13:55,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:13:56,005 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-30 02:13:56,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 02:13:56,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:13:56,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:13:56,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:13:56,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:13:56,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:13:56,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:13:56,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:13:56,275 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_348) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| (_ bv1 32)))) (_ bv0 8)))) is different from false [2023-08-30 02:13:56,284 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_348) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (bvadd (_ bv2 32) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))))) is different from false [2023-08-30 02:13:56,342 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_348) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (bvadd (_ bv4 32) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|))) (_ bv0 8)))) is different from false [2023-08-30 02:13:58,574 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-08-30 02:13:58,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:13:58,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830012680] [2023-08-30 02:13:58,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830012680] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:13:58,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 02:13:58,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-08-30 02:13:58,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478418484] [2023-08-30 02:13:58,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 02:13:58,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-30 02:13:58,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:13:58,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-30 02:13:58,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=164, Unknown=18, NotChecked=84, Total=306 [2023-08-30 02:13:58,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 235 [2023-08-30 02:13:58,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 34 transitions, 258 flow. Second operand has 18 states, 18 states have (on average 46.666666666666664) internal successors, (840), 18 states have internal predecessors, (840), 0 states have call successors, (0), 0 states 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 02:13:58,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:13:58,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 235 [2023-08-30 02:13:58,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:13:59,850 INFO L130 PetriNetUnfolder]: 37/118 cut-off events. [2023-08-30 02:13:59,850 INFO L131 PetriNetUnfolder]: For 192/192 co-relation queries the response was YES. [2023-08-30 02:13:59,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 118 events. 37/118 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 350 event pairs, 0 based on Foata normal form. 4/122 useless extension candidates. Maximal degree in co-relation 480. Up to 75 conditions per place. [2023-08-30 02:13:59,851 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 30 selfloop transitions, 7 changer transitions 0/37 dead transitions. [2023-08-30 02:13:59,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 37 transitions, 315 flow [2023-08-30 02:13:59,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:13:59,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:13:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 387 transitions. [2023-08-30 02:13:59,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20585106382978724 [2023-08-30 02:13:59,853 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 387 transitions. [2023-08-30 02:13:59,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 387 transitions. [2023-08-30 02:13:59,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:13:59,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 387 transitions. [2023-08-30 02:13:59,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 48.375) internal successors, (387), 8 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:13:59,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states 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 02:13:59,856 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states 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 02:13:59,856 INFO L175 Difference]: Start difference. First operand has 57 places, 34 transitions, 258 flow. Second operand 8 states and 387 transitions. [2023-08-30 02:13:59,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 37 transitions, 315 flow [2023-08-30 02:13:59,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 37 transitions, 283 flow, removed 5 selfloop flow, removed 8 redundant places. [2023-08-30 02:13:59,858 INFO L231 Difference]: Finished difference. Result has 55 places, 31 transitions, 211 flow [2023-08-30 02:13:59,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=211, PETRI_PLACES=55, PETRI_TRANSITIONS=31} [2023-08-30 02:13:59,859 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2023-08-30 02:13:59,859 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 31 transitions, 211 flow [2023-08-30 02:13:59,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 46.666666666666664) internal successors, (840), 18 states have internal predecessors, (840), 0 states have call successors, (0), 0 states 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 02:13:59,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:13:59,860 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:13:59,872 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 (22)] Forceful destruction successful, exit code 0 [2023-08-30 02:14:00,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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 02:14:00,070 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:14:00,071 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:14:00,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1792975402, now seen corresponding path program 5 times [2023-08-30 02:14:00,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:14:00,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262353265] [2023-08-30 02:14:00,071 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 02:14:00,071 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 02:14:00,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:14:00,072 INFO L229 MonitoredProcess]: Starting monitored process 23 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 02:14:00,074 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 (23)] Waiting until timeout for monitored process [2023-08-30 02:14:00,220 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-08-30 02:14:00,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:14:00,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-30 02:14:00,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:14:00,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:14:00,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-30 02:14:00,293 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-30 02:14:00,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-30 02:14:00,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:14:00,447 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 02:14:00,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-08-30 02:14:00,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:14:00,484 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-08-30 02:14:00,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-08-30 02:14:00,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:14:01,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:14:01,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:14:01,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:14:01,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:14:01,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:14:01,634 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:14:01,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:14:02,591 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:14:02,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:14:02,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262353265] [2023-08-30 02:14:02,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262353265] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:14:02,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 02:14:02,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-08-30 02:14:02,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452762380] [2023-08-30 02:14:02,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 02:14:02,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-30 02:14:02,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:14:02,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-30 02:14:02,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=327, Unknown=3, NotChecked=0, Total=380 [2023-08-30 02:14:05,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:14:07,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:14:09,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:14:11,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:14:16,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:14:17,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 02:14:19,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:14:22,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 235 [2023-08-30 02:14:22,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 31 transitions, 211 flow. Second operand has 20 states, 20 states have (on average 46.6) internal successors, (932), 20 states have internal predecessors, (932), 0 states have call successors, (0), 0 states 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 02:14:22,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:14:22,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 235 [2023-08-30 02:14:22,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:14:24,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 02:14:26,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 02:14:28,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 02:14:38,243 WARN L222 SmtUtils]: Spent 6.41s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:14:40,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:14:47,004 INFO L130 PetriNetUnfolder]: 51/152 cut-off events. [2023-08-30 02:14:47,004 INFO L131 PetriNetUnfolder]: For 474/474 co-relation queries the response was YES. [2023-08-30 02:14:47,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 152 events. 51/152 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 488 event pairs, 0 based on Foata normal form. 12/164 useless extension candidates. Maximal degree in co-relation 650. Up to 38 conditions per place. [2023-08-30 02:14:47,005 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 38 selfloop transitions, 20 changer transitions 0/58 dead transitions. [2023-08-30 02:14:47,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 58 transitions, 458 flow [2023-08-30 02:14:47,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-30 02:14:47,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-30 02:14:47,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 913 transitions. [2023-08-30 02:14:47,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20447928331466966 [2023-08-30 02:14:47,008 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 913 transitions. [2023-08-30 02:14:47,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 913 transitions. [2023-08-30 02:14:47,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:14:47,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 913 transitions. [2023-08-30 02:14:47,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 48.05263157894737) internal successors, (913), 19 states have internal predecessors, (913), 0 states have call successors, (0), 0 states 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 02:14:47,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 235.0) internal successors, (4700), 20 states have internal predecessors, (4700), 0 states have call successors, (0), 0 states 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 02:14:47,014 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 235.0) internal successors, (4700), 20 states have internal predecessors, (4700), 0 states have call successors, (0), 0 states 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 02:14:47,014 INFO L175 Difference]: Start difference. First operand has 55 places, 31 transitions, 211 flow. Second operand 19 states and 913 transitions. [2023-08-30 02:14:47,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 58 transitions, 458 flow [2023-08-30 02:14:47,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 58 transitions, 442 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-30 02:14:47,017 INFO L231 Difference]: Finished difference. Result has 66 places, 35 transitions, 298 flow [2023-08-30 02:14:47,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=298, PETRI_PLACES=66, PETRI_TRANSITIONS=35} [2023-08-30 02:14:47,018 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 30 predicate places. [2023-08-30 02:14:47,018 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 35 transitions, 298 flow [2023-08-30 02:14:47,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 46.6) internal successors, (932), 20 states have internal predecessors, (932), 0 states have call successors, (0), 0 states 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 02:14:47,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:14:47,018 INFO L208 CegarLoopForPetriNet]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:14:47,029 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 (23)] Forceful destruction successful, exit code 0 [2023-08-30 02:14:47,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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 02:14:47,229 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:14:47,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:14:47,230 INFO L85 PathProgramCache]: Analyzing trace with hash 346219360, now seen corresponding path program 3 times [2023-08-30 02:14:47,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:14:47,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2066377098] [2023-08-30 02:14:47,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:14:47,231 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 02:14:47,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:14:47,232 INFO L229 MonitoredProcess]: Starting monitored process 24 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 02:14:47,233 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 (24)] Waiting until timeout for monitored process [2023-08-30 02:14:47,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-08-30 02:14:47,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:14:47,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-30 02:14:47,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:14:47,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:14:47,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:14:47,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:14:47,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-30 02:14:47,525 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-30 02:14:47,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-30 02:14:47,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:14:47,635 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-30 02:14:47,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 02:14:47,640 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 02:14:47,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:14:47,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:14:47,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:14:47,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:14:47,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:14:47,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:14:47,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:14:47,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:14:47,895 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 02:14:47,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2023-08-30 02:14:47,933 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-08-30 02:14:47,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:14:48,164 WARN L839 $PredicateComparison]: unable to prove that (forall ((|thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| (_ BitVec 32)) (v_ArrVal_428 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)) (.cse0 (select |c_#length| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|))) (or (bvult (bvadd |thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| (_ bv1 32)) .cse0) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_428) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) .cse1)) (_ bv0 8)) (not (bvult .cse1 .cse0))))) is different from false [2023-08-30 02:14:50,909 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 14 not checked. [2023-08-30 02:14:50,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:14:50,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2066377098] [2023-08-30 02:14:50,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2066377098] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:14:50,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 02:14:50,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2023-08-30 02:14:50,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012137622] [2023-08-30 02:14:50,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 02:14:50,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 02:14:50,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:14:50,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 02:14:50,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=123, Unknown=3, NotChecked=22, Total=182 [2023-08-30 02:14:51,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 235 [2023-08-30 02:14:51,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 35 transitions, 298 flow. Second operand has 14 states, 14 states have (on average 44.714285714285715) internal successors, (626), 14 states have internal predecessors, (626), 0 states have call successors, (0), 0 states 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 02:14:51,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:14:51,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 235 [2023-08-30 02:14:51,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:14:57,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:14:57,962 INFO L130 PetriNetUnfolder]: 49/162 cut-off events. [2023-08-30 02:14:57,962 INFO L131 PetriNetUnfolder]: For 826/826 co-relation queries the response was YES. [2023-08-30 02:14:57,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 162 events. 49/162 cut-off events. For 826/826 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 585 event pairs, 0 based on Foata normal form. 24/186 useless extension candidates. Maximal degree in co-relation 692. Up to 88 conditions per place. [2023-08-30 02:14:57,963 INFO L137 encePairwiseOnDemand]: 227/235 looper letters, 36 selfloop transitions, 15 changer transitions 0/51 dead transitions. [2023-08-30 02:14:57,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 51 transitions, 484 flow [2023-08-30 02:14:57,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:14:57,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:14:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 411 transitions. [2023-08-30 02:14:57,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.19432624113475178 [2023-08-30 02:14:57,965 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 411 transitions. [2023-08-30 02:14:57,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 411 transitions. [2023-08-30 02:14:57,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:14:57,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 411 transitions. [2023-08-30 02:14:57,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 45.666666666666664) internal successors, (411), 9 states have internal predecessors, (411), 0 states have call successors, (0), 0 states 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 02:14:57,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states 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 02:14:57,968 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states 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 02:14:57,968 INFO L175 Difference]: Start difference. First operand has 66 places, 35 transitions, 298 flow. Second operand 9 states and 411 transitions. [2023-08-30 02:14:57,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 51 transitions, 484 flow [2023-08-30 02:14:57,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 51 transitions, 258 flow, removed 44 selfloop flow, removed 24 redundant places. [2023-08-30 02:14:57,971 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 179 flow [2023-08-30 02:14:57,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=179, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-08-30 02:14:57,971 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2023-08-30 02:14:57,971 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 179 flow [2023-08-30 02:14:57,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 44.714285714285715) internal successors, (626), 14 states have internal predecessors, (626), 0 states have call successors, (0), 0 states 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 02:14:57,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:14:57,972 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:14:57,989 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 (24)] Forceful destruction successful, exit code 0 [2023-08-30 02:14:58,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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 02:14:58,183 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:14:58,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:14:58,183 INFO L85 PathProgramCache]: Analyzing trace with hash 252150518, now seen corresponding path program 6 times [2023-08-30 02:14:58,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:14:58,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [852414444] [2023-08-30 02:14:58,183 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 02:14:58,183 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 02:14:58,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:14:58,184 INFO L229 MonitoredProcess]: Starting monitored process 25 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 02:14:58,188 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 (25)] Waiting until timeout for monitored process [2023-08-30 02:14:58,364 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-08-30 02:14:58,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:14:58,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-30 02:14:58,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:14:58,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:14:58,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:14:58,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:14:58,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-30 02:14:58,427 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-30 02:14:58,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-30 02:14:58,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:14:58,543 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-30 02:14:58,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 02:14:58,556 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 02:14:58,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:14:58,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:14:58,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:14:58,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:14:58,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:14:58,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:14:59,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-30 02:14:59,133 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:14:59,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:15:02,479 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:15:02,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:15:02,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [852414444] [2023-08-30 02:15:02,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [852414444] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:15:02,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 02:15:02,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2023-08-30 02:15:02,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405637853] [2023-08-30 02:15:02,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 02:15:02,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-30 02:15:02,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:15:02,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-30 02:15:02,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=384, Unknown=9, NotChecked=0, Total=462 [2023-08-30 02:15:05,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 02:15:07,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 235 [2023-08-30 02:15:07,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 179 flow. Second operand has 22 states, 22 states have (on average 47.54545454545455) internal successors, (1046), 22 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states 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 02:15:07,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:15:07,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 235 [2023-08-30 02:15:07,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:15:20,368 WARN L222 SmtUtils]: Spent 10.66s on a formula simplification that was a NOOP. DAG size: 129 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 02:15:23,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:15:25,392 INFO L130 PetriNetUnfolder]: 44/166 cut-off events. [2023-08-30 02:15:25,392 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2023-08-30 02:15:25,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 166 events. 44/166 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 535 event pairs, 0 based on Foata normal form. 30/196 useless extension candidates. Maximal degree in co-relation 493. Up to 47 conditions per place. [2023-08-30 02:15:25,393 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 35 selfloop transitions, 20 changer transitions 0/55 dead transitions. [2023-08-30 02:15:25,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 55 transitions, 353 flow [2023-08-30 02:15:25,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-30 02:15:25,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-30 02:15:25,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 928 transitions. [2023-08-30 02:15:25,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20783874580067188 [2023-08-30 02:15:25,395 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 928 transitions. [2023-08-30 02:15:25,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 928 transitions. [2023-08-30 02:15:25,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:15:25,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 928 transitions. [2023-08-30 02:15:25,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 48.8421052631579) internal successors, (928), 19 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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 02:15:25,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 235.0) internal successors, (4700), 20 states have internal predecessors, (4700), 0 states have call successors, (0), 0 states 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 02:15:25,401 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 235.0) internal successors, (4700), 20 states have internal predecessors, (4700), 0 states have call successors, (0), 0 states 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 02:15:25,402 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 179 flow. Second operand 19 states and 928 transitions. [2023-08-30 02:15:25,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 55 transitions, 353 flow [2023-08-30 02:15:25,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 55 transitions, 314 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-08-30 02:15:25,403 INFO L231 Difference]: Finished difference. Result has 61 places, 36 transitions, 179 flow [2023-08-30 02:15:25,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=179, PETRI_PLACES=61, PETRI_TRANSITIONS=36} [2023-08-30 02:15:25,404 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2023-08-30 02:15:25,404 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 36 transitions, 179 flow [2023-08-30 02:15:25,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 47.54545454545455) internal successors, (1046), 22 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states 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 02:15:25,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:15:25,405 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:15:25,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-08-30 02:15:25,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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 02:15:25,616 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:15:25,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:15:25,616 INFO L85 PathProgramCache]: Analyzing trace with hash -773455402, now seen corresponding path program 7 times [2023-08-30 02:15:25,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:15:25,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156295445] [2023-08-30 02:15:25,617 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-30 02:15:25,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:15:25,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:15:25,618 INFO L229 MonitoredProcess]: Starting monitored process 26 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 02:15:25,618 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 (26)] Waiting until timeout for monitored process [2023-08-30 02:15:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:15:25,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:15:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:15:25,953 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 02:15:25,953 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:15:25,954 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2023-08-30 02:15:25,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2023-08-30 02:15:25,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2023-08-30 02:15:25,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2023-08-30 02:15:25,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2023-08-30 02:15:25,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2023-08-30 02:15:25,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2023-08-30 02:15:25,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2023-08-30 02:15:25,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2023-08-30 02:15:25,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2023-08-30 02:15:25,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2023-08-30 02:15:25,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2023-08-30 02:15:25,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2023-08-30 02:15:25,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2023-08-30 02:15:25,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2023-08-30 02:15:25,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2023-08-30 02:15:25,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2023-08-30 02:15:25,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (8 of 26 remaining) [2023-08-30 02:15:25,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 26 remaining) [2023-08-30 02:15:25,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 26 remaining) [2023-08-30 02:15:25,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2023-08-30 02:15:25,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2023-08-30 02:15:25,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2023-08-30 02:15:25,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2023-08-30 02:15:25,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2023-08-30 02:15:25,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2023-08-30 02:15:25,980 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 (26)] Forceful destruction successful, exit code 0 [2023-08-30 02:15:26,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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 02:15:26,162 INFO L445 BasicCegarLoop]: Path program histogram: [7, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:15:26,167 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:15:26,167 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:15:26,190 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:26,190 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:26,190 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:26,190 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:26,191 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:26,191 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:26,191 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:26,191 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:26,191 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:26,191 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:26,192 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:26,192 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:26,192 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:26,192 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:26,192 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:26,192 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:26,193 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:26,193 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:26,193 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:26,193 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:26,193 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:26,193 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:26,194 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:26,194 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:26,194 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:26,194 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:26,194 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:26,194 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:26,195 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:26,195 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:26,195 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:26,195 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:26,195 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-30 02:15:26,196 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-30 02:15:26,196 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:26,196 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:26,196 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:26,196 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:26,196 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-30 02:15:26,196 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-30 02:15:26,197 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:26,197 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:26,197 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:26,197 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:26,197 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-30 02:15:26,197 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-30 02:15:26,197 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:26,197 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:26,198 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:26,198 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:26,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:15:26 BasicIcfg [2023-08-30 02:15:26,230 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:15:26,230 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:15:26,230 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:15:26,231 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:15:26,231 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:11:15" (3/4) ... [2023-08-30 02:15:26,233 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:15:26,233 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:15:26,233 INFO L158 Benchmark]: Toolchain (without parser) took 251480.03ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 57.3MB in the beginning and 66.1MB in the end (delta: -8.8MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2023-08-30 02:15:26,234 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 62.9MB. Free memory is still 40.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:15:26,234 INFO L158 Benchmark]: CACSL2BoogieTranslator took 535.93ms. Allocated memory is still 81.8MB. Free memory was 57.3MB in the beginning and 43.2MB in the end (delta: 14.1MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2023-08-30 02:15:26,234 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.82ms. Allocated memory is still 81.8MB. Free memory was 43.2MB in the beginning and 40.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:15:26,235 INFO L158 Benchmark]: Boogie Preprocessor took 29.46ms. Allocated memory is still 81.8MB. Free memory was 40.5MB in the beginning and 38.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:15:26,235 INFO L158 Benchmark]: RCFGBuilder took 554.93ms. Allocated memory is still 81.8MB. Free memory was 38.8MB in the beginning and 48.9MB in the end (delta: -10.2MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2023-08-30 02:15:26,235 INFO L158 Benchmark]: TraceAbstraction took 250297.68ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 48.5MB in the beginning and 66.1MB in the end (delta: -17.6MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2023-08-30 02:15:26,235 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 98.6MB. Free memory is still 66.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:15:26,238 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.16ms. Allocated memory is still 62.9MB. Free memory is still 40.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 535.93ms. Allocated memory is still 81.8MB. Free memory was 57.3MB in the beginning and 43.2MB in the end (delta: 14.1MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.82ms. Allocated memory is still 81.8MB. Free memory was 43.2MB in the beginning and 40.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.46ms. Allocated memory is still 81.8MB. Free memory was 40.5MB in the beginning and 38.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 554.93ms. Allocated memory is still 81.8MB. Free memory was 38.8MB in the beginning and 48.9MB in the end (delta: -10.2MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * TraceAbstraction took 250297.68ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 48.5MB in the beginning and 66.1MB in the end (delta: -17.6MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 98.6MB. Free memory is still 66.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.7s, 108 PlacesBefore, 36 PlacesAfterwards, 106 TransitionsBefore, 31 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 6 FixpointIterations, 64 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 6 ConcurrentYvCompositions, 3 ChoiceCompositions, 123 TotalNumberOfCompositions, 458 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 372, independent: 347, independent conditional: 0, independent unconditional: 347, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 188, independent: 178, independent conditional: 0, independent unconditional: 178, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 372, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 188, unknown conditional: 0, unknown unconditional: 188] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 11, Positive conditional cache size: 0, Positive unconditional cache size: 11, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 1119]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1119. Possible FailurePath: [L1108] 0 char *v; [L1121] 0 pthread_t t1, t2; [L1122] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, pthread_create(&t1, 0, thread1, 0)=127, t1={10:0}, t2={12:0}, v={0:0}] [L1111] 1 v = malloc(sizeof(char) * 8) [L1112] 1 return 0; [L1123] 0 \read(t1) VAL [\read(t1)=127, \result={0:0}, arg={0:0}, arg={0:0}, t1={10:0}, t2={12:0}, v={6:0}] [L1123] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=127, \result={0:0}, arg={0:0}, arg={0:0}, t1={10:0}, t2={12:0}, v={6:0}] [L1124] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t2, 0, thread2, 0)=128, t1={10:0}, t2={12:0}, v={6:0}] [L1125] 0 \read(t2) VAL [\read(t2)=128, \result={0:0}, arg={0:0}, arg={0:0}, t1={10:0}, t2={12:0}, v={6:0}] [L1116] COND TRUE 2 \read(*v) [L1116] FCALL 2 strcpy(v, "Bigshot") [L1117] 2 return 0; [L1125] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\read(t2)=128, \result={0:0}, arg={0:0}, arg={0:0}, t1={10:0}, t2={12:0}, v={6:0}] [L1126] EXPR 0 !v || v[0] == 'B' [L1126] EXPR 0 v[0] [L1126] EXPR 0 !v || v[0] == 'B' [L1126] CALL 0 __VERIFIER_assert(!v || v[0] == 'B') [L1107] COND FALSE 0 !(!expression) [L1126] RET 0 __VERIFIER_assert(!v || v[0] == 'B') [L1127] 0 return 0; [L1127] 0 return 0; [L1127] 0 return 0; - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 1107]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1122]: 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: 1124]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 143 locations, 26 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: 250.1s, OverallIterations: 25, TraceHistogramMax: 8, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 209.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.8s, HoareTripleCheckerStatistics: 331 mSolverCounterUnknown, 4453 SdHoareTripleChecker+Valid, 170.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3447 mSDsluCounter, 3088 SdHoareTripleChecker+Invalid, 168.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 275 IncrementalHoareTripleChecker+Unchecked, 3027 mSDsCounter, 360 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9965 IncrementalHoareTripleChecker+Invalid, 10931 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 360 mSolverCounterUnsat, 61 mSDtfsCounter, 9965 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 455 GetRequests, 199 SyntacticMatches, 5 SemanticMatches, 251 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 55.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=326occurred in iteration=17, InterpolantAutomatonStates: 169, 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, 1.3s SatisfiabilityAnalysisTime, 23.6s InterpolantComputationTime, 269 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 359 ConstructedInterpolants, 139 QuantifiedInterpolants, 7092 SizeOfPredicates, 114 NumberOfNonLiveVariables, 2502 ConjunctsInSsa, 350 ConjunctsInUnsatCore, 34 InterpolantComputations, 14 PerfectInterpolantSequences, 52/218 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 02:15:26,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample