./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread/bigshot_s2.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_s2.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 fa644cc26c2bb4f900e6af52233648196eb4dff503d36a50559ddcf2a4270ffb --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,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:06:16,492 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:06:16,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:06:16,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:06:16,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:06:16,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:06:16,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:06:16,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:06:16,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:06:16,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:06:16,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:06:16,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:06:16,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:06:16,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:06:16,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:06:16,550 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:06:16,551 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:06:16,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:06:16,558 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:06:16,566 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:06:16,567 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:06:16,568 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:06:16,569 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:06:16,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:06:16,575 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:06:16,575 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:06:16,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:06:16,577 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:06:16,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:06:16,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:06:16,583 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:06:16,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:06:16,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:06:16,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:06:16,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:06:16,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:06:16,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:06:16,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:06:16,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:06:16,587 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:06:16,589 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,610 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:06:16,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:06:16,611 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:06:16,611 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:06:16,612 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:06:16,612 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:06:16,613 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:06:16,613 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:06:16,613 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:06:16,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:06:16,614 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:06:16,614 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:06:16,614 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:06:16,614 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:06:16,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:06:16,615 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:06:16,615 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:06:16,615 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:06:16,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:06:16,615 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:06:16,615 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:06:16,615 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:06:16,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:06:16,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:06:16,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:06:16,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:06:16,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:06:16,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:06:16,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:06:16,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:06:16,617 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:06:16,617 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:06:16,617 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:06:16,617 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:06:16,618 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 -> fa644cc26c2bb4f900e6af52233648196eb4dff503d36a50559ddcf2a4270ffb 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,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:06:16,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:06:16,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:06:16,935 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:06:16,935 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:06:16,937 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/bigshot_s2.i [2023-08-30 02:06:17,866 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:06:18,106 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:06:18,107 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s2.i [2023-08-30 02:06:18,119 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0fc3afbe/9d6b467def1e4a67b53ef9598a6d278d/FLAGd21f58420 [2023-08-30 02:06:18,132 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0fc3afbe/9d6b467def1e4a67b53ef9598a6d278d [2023-08-30 02:06:18,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:06:18,137 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:06:18,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:06:18,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:06:18,154 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:06:18,155 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,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f7ae34 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,156 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,161 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:06:18,202 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:06:18,489 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_s2.i[55203,55216] [2023-08-30 02:06:18,507 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:06:18,519 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:06:18,599 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_s2.i[55203,55216] [2023-08-30 02:06:18,607 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:06:18,662 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:06:18,662 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,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:06:18,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:06:18,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:06:18,664 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:06:18,668 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:18,687 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:18,700 INFO L138 Inliner]: procedures = 323, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 75 [2023-08-30 02:06:18,705 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:06:18,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:06:18,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:06:18,705 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:06:18,711 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:18,711 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:18,722 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:18,722 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:18,726 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:18,728 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:18,737 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:18,738 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:18,739 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:06:18,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:06:18,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:06:18,740 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:06:18,741 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:18,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:06:18,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:06:18,775 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:18,795 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:18,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:06:18,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:06:18,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-08-30 02:06:18,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 02:06:18,806 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-30 02:06:18,806 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-30 02:06:18,806 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-30 02:06:18,806 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-30 02:06:18,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:06:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-30 02:06:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:06:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:06:18,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:06:18,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:06:18,821 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:18,949 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:06:18,970 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:06:19,152 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:06:19,157 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:06:19,157 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-08-30 02:06:19,159 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,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:06:19,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:06:19,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:06:19,162 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:06:19,163 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,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7679246a 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,164 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,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7679246a 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,164 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,165 INFO L112 eAbstractionObserver]: Analyzing ICFG bigshot_s2.i [2023-08-30 02:06:19,175 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:06:19,175 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-08-30 02:06:19,176 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:06:19,254 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-30 02:06:19,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 106 transitions, 228 flow [2023-08-30 02:06:19,326 INFO L130 PetriNetUnfolder]: 4/104 cut-off events. [2023-08-30 02:06:19,326 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 02:06:19,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 104 events. 4/104 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 125 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-08-30 02:06:19,330 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 106 transitions, 228 flow [2023-08-30 02:06:19,333 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 100 transitions, 212 flow [2023-08-30 02:06:19,336 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:06:19,349 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 100 transitions, 212 flow [2023-08-30 02:06:19,352 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 100 transitions, 212 flow [2023-08-30 02:06:19,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 100 transitions, 212 flow [2023-08-30 02:06:19,379 INFO L130 PetriNetUnfolder]: 4/100 cut-off events. [2023-08-30 02:06:19,379 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 02:06:19,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 100 events. 4/100 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 126 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2023-08-30 02:06:19,381 INFO L119 LiptonReduction]: Number of co-enabled transitions 340 [2023-08-30 02:06:22,417 INFO L134 LiptonReduction]: Checked pairs total: 458 [2023-08-30 02:06:22,417 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-08-30 02:06:22,428 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:06:22,435 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;@5522d1fb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:06:22,436 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-08-30 02:06:22,439 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:06:22,439 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:06:22,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:22,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:06:22,441 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:06:22,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:22,446 INFO L85 PathProgramCache]: Analyzing trace with hash 409, now seen corresponding path program 1 times [2023-08-30 02:06:22,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:22,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603870513] [2023-08-30 02:06:22,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:22,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:22,545 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:22,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:22,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603870513] [2023-08-30 02:06:22,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603870513] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:22,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:22,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:06:22,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833052079] [2023-08-30 02:06:22,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:22,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:06:22,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:22,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:06:22,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:06:22,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 221 [2023-08-30 02:06:22,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 99.5) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have 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:22,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:22,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 221 [2023-08-30 02:06:22,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:22,629 INFO L130 PetriNetUnfolder]: 26/72 cut-off events. [2023-08-30 02:06:22,630 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 02:06:22,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 72 events. 26/72 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 209 event pairs, 18 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 117. Up to 69 conditions per place. [2023-08-30 02:06:22,631 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 26 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-08-30 02:06:22,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 118 flow [2023-08-30 02:06:22,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:06:22,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:06:22,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 228 transitions. [2023-08-30 02:06:22,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5158371040723982 [2023-08-30 02:06:22,643 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 228 transitions. [2023-08-30 02:06:22,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 228 transitions. [2023-08-30 02:06:22,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:22,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 228 transitions. [2023-08-30 02:06:22,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 114.0) internal successors, (228), 2 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have 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:22,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have 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:22,654 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have 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:22,655 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 74 flow. Second operand 2 states and 228 transitions. [2023-08-30 02:06:22,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 118 flow [2023-08-30 02:06:22,657 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:22,658 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 58 flow [2023-08-30 02:06:22,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, 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:22,661 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -7 predicate places. [2023-08-30 02:06:22,661 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 58 flow [2023-08-30 02:06:22,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 99.5) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have 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:22,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:22,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:06:22,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:06:22,662 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:22,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:22,664 INFO L85 PathProgramCache]: Analyzing trace with hash 402564, now seen corresponding path program 1 times [2023-08-30 02:06:22,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:22,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368110263] [2023-08-30 02:06:22,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:22,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:22,815 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:22,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:22,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368110263] [2023-08-30 02:06:22,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368110263] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:22,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:22,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:06:22,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359486286] [2023-08-30 02:06:22,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:22,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:06:22,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:22,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:06:22,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:06:22,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 221 [2023-08-30 02:06:22,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have 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:22,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:22,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 221 [2023-08-30 02:06:22,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:22,899 INFO L130 PetriNetUnfolder]: 25/69 cut-off events. [2023-08-30 02:06:22,899 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:06:22,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 69 events. 25/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 200 event pairs, 17 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 136. Up to 64 conditions per place. [2023-08-30 02:06:22,900 INFO L137 encePairwiseOnDemand]: 218/221 looper letters, 23 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2023-08-30 02:06:22,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 106 flow [2023-08-30 02:06:22,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:06:22,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:06:22,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-08-30 02:06:22,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4464555052790347 [2023-08-30 02:06:22,902 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-08-30 02:06:22,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-08-30 02:06:22,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:22,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-08-30 02:06:22,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have 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:22,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have 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:22,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have 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:22,905 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 58 flow. Second operand 3 states and 296 transitions. [2023-08-30 02:06:22,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 106 flow [2023-08-30 02:06:22,906 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:22,906 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 60 flow [2023-08-30 02:06:22,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, 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:22,907 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-30 02:06:22,907 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 60 flow [2023-08-30 02:06:22,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have 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:22,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:22,908 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:06:22,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:06:22,908 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:22,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:22,908 INFO L85 PathProgramCache]: Analyzing trace with hash 402565, now seen corresponding path program 1 times [2023-08-30 02:06:22,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:22,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384990486] [2023-08-30 02:06:22,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:22,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:23,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:23,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:23,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384990486] [2023-08-30 02:06:23,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384990486] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:23,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:23,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:06:23,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273217625] [2023-08-30 02:06:23,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:23,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:06:23,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:23,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:06:23,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:06:23,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 221 [2023-08-30 02:06:23,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have 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:23,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:23,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 221 [2023-08-30 02:06:23,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:23,087 INFO L130 PetriNetUnfolder]: 24/67 cut-off events. [2023-08-30 02:06:23,088 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:06:23,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 67 events. 24/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 195 event pairs, 15 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 134. Up to 61 conditions per place. [2023-08-30 02:06:23,088 INFO L137 encePairwiseOnDemand]: 218/221 looper letters, 24 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2023-08-30 02:06:23,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 114 flow [2023-08-30 02:06:23,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:06:23,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:06:23,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2023-08-30 02:06:23,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2023-08-30 02:06:23,097 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 306 transitions. [2023-08-30 02:06:23,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions. [2023-08-30 02:06:23,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:23,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions. [2023-08-30 02:06:23,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have 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:23,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have 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:23,102 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have 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:23,102 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 60 flow. Second operand 3 states and 306 transitions. [2023-08-30 02:06:23,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 114 flow [2023-08-30 02:06:23,103 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:23,103 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 64 flow [2023-08-30 02:06:23,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, 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:23,104 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2023-08-30 02:06:23,105 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 64 flow [2023-08-30 02:06:23,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have 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:23,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:23,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-30 02:06:23,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:06:23,107 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:23,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:23,108 INFO L85 PathProgramCache]: Analyzing trace with hash 12480382, now seen corresponding path program 1 times [2023-08-30 02:06:23,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:23,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303990182] [2023-08-30 02:06:23,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:23,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:23,269 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:23,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:23,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303990182] [2023-08-30 02:06:23,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303990182] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:23,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:23,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:06:23,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602654959] [2023-08-30 02:06:23,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:23,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:06:23,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:23,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:06:23,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:06:23,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 221 [2023-08-30 02:06:23,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have 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:23,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:23,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 221 [2023-08-30 02:06:23,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:23,362 INFO L130 PetriNetUnfolder]: 24/66 cut-off events. [2023-08-30 02:06:23,363 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 02:06:23,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 66 events. 24/66 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 193 event pairs, 16 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 135. Up to 61 conditions per place. [2023-08-30 02:06:23,365 INFO L137 encePairwiseOnDemand]: 218/221 looper letters, 22 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2023-08-30 02:06:23,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 108 flow [2023-08-30 02:06:23,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:06:23,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:06:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-08-30 02:06:23,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45852187028657615 [2023-08-30 02:06:23,367 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-08-30 02:06:23,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-08-30 02:06:23,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:23,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-08-30 02:06:23,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have 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:23,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have 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:23,374 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have 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:23,374 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 64 flow. Second operand 3 states and 304 transitions. [2023-08-30 02:06:23,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 108 flow [2023-08-30 02:06:23,374 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:23,375 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 58 flow [2023-08-30 02:06:23,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, 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:23,376 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -7 predicate places. [2023-08-30 02:06:23,376 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 58 flow [2023-08-30 02:06:23,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have 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:23,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:23,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 02:06:23,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:06:23,377 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:23,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:23,378 INFO L85 PathProgramCache]: Analyzing trace with hash -891795905, now seen corresponding path program 1 times [2023-08-30 02:06:23,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:23,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061516279] [2023-08-30 02:06:23,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:23,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:23,460 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:23,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:23,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061516279] [2023-08-30 02:06:23,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061516279] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:23,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:23,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:06:23,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279846291] [2023-08-30 02:06:23,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:23,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:06:23,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:23,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:06:23,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:06:23,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 221 [2023-08-30 02:06:23,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have 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:23,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:23,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 221 [2023-08-30 02:06:23,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:23,534 INFO L130 PetriNetUnfolder]: 17/51 cut-off events. [2023-08-30 02:06:23,534 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:06:23,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 51 events. 17/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 128 event pairs, 11 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 103. Up to 47 conditions per place. [2023-08-30 02:06:23,535 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 20 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2023-08-30 02:06:23,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 23 transitions, 98 flow [2023-08-30 02:06:23,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:06:23,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:06:23,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2023-08-30 02:06:23,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4434389140271493 [2023-08-30 02:06:23,536 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 294 transitions. [2023-08-30 02:06:23,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 294 transitions. [2023-08-30 02:06:23,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:23,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 294 transitions. [2023-08-30 02:06:23,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:06:23,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have 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:23,539 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have 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:23,539 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 58 flow. Second operand 3 states and 294 transitions. [2023-08-30 02:06:23,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 23 transitions, 98 flow [2023-08-30 02:06:23,539 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:23,540 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 54 flow [2023-08-30 02:06:23,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, 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:23,542 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -9 predicate places. [2023-08-30 02:06:23,542 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 54 flow [2023-08-30 02:06:23,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have 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:23,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:23,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 02:06:23,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:06:23,543 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:23,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:23,544 INFO L85 PathProgramCache]: Analyzing trace with hash -891795903, now seen corresponding path program 1 times [2023-08-30 02:06:23,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:23,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785701494] [2023-08-30 02:06:23,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:23,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:23,640 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:23,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:23,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785701494] [2023-08-30 02:06:23,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785701494] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:23,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:23,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:06:23,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027923553] [2023-08-30 02:06:23,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:23,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:06:23,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:23,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:06:23,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:06:23,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 221 [2023-08-30 02:06:23,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have 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:23,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:23,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 221 [2023-08-30 02:06:23,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:23,736 INFO L130 PetriNetUnfolder]: 10/36 cut-off events. [2023-08-30 02:06:23,736 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:06:23,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 36 events. 10/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 71 event pairs, 6 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 74. Up to 33 conditions per place. [2023-08-30 02:06:23,737 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 18 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2023-08-30 02:06:23,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 21 transitions, 90 flow [2023-08-30 02:06:23,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:06:23,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:06:23,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2023-08-30 02:06:23,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42684766214177977 [2023-08-30 02:06:23,738 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 283 transitions. [2023-08-30 02:06:23,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 283 transitions. [2023-08-30 02:06:23,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:23,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 283 transitions. [2023-08-30 02:06:23,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have 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:23,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have 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:23,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have 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:23,741 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 54 flow. Second operand 3 states and 283 transitions. [2023-08-30 02:06:23,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 21 transitions, 90 flow [2023-08-30 02:06:23,741 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:23,742 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 50 flow [2023-08-30 02:06:23,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, 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:23,742 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -11 predicate places. [2023-08-30 02:06:23,742 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 50 flow [2023-08-30 02:06:23,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have 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:23,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:23,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:23,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:06:23,743 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:23,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:23,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1176181263, now seen corresponding path program 1 times [2023-08-30 02:06:23,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:23,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165106563] [2023-08-30 02:06:23,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:23,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:23,876 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:23,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:23,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165106563] [2023-08-30 02:06:23,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165106563] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:23,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:23,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:06:23,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930969779] [2023-08-30 02:06:23,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:23,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:06:23,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:23,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:06:23,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:06:24,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 221 [2023-08-30 02:06:24,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 50 flow. Second operand has 7 states, 7 states have (on average 79.28571428571429) internal successors, (555), 7 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:24,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:24,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 221 [2023-08-30 02:06:24,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:24,121 INFO L130 PetriNetUnfolder]: 10/40 cut-off events. [2023-08-30 02:06:24,121 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:06:24,122 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 79 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:24,122 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 22 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2023-08-30 02:06:24,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 115 flow [2023-08-30 02:06:24,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:06:24,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:06:24,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 339 transitions. [2023-08-30 02:06:24,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3834841628959276 [2023-08-30 02:06:24,124 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 339 transitions. [2023-08-30 02:06:24,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 339 transitions. [2023-08-30 02:06:24,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:24,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 339 transitions. [2023-08-30 02:06:24,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have 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 L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have 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 L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have 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 L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 50 flow. Second operand 4 states and 339 transitions. [2023-08-30 02:06:24,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 115 flow [2023-08-30 02:06:24,128 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:24,128 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 54 flow [2023-08-30 02:06:24,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, 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:24,129 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -11 predicate places. [2023-08-30 02:06:24,129 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 54 flow [2023-08-30 02:06:24,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.28571428571429) internal successors, (555), 7 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:24,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:24,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:24,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:06:24,130 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:06:24,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:24,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1176181298, now seen corresponding path program 1 times [2023-08-30 02:06:24,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:24,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701394929] [2023-08-30 02:06:24,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:24,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:24,376 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,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:24,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701394929] [2023-08-30 02:06:24,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701394929] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:24,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:24,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:06:24,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518944722] [2023-08-30 02:06:24,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:24,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:06:24,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:24,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:06:24,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:06:24,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 221 [2023-08-30 02:06:24,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 54 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:24,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:24,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 221 [2023-08-30 02:06:24,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:24,719 INFO L130 PetriNetUnfolder]: 14/57 cut-off events. [2023-08-30 02:06:24,720 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 02:06:24,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 57 events. 14/57 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 173 event pairs, 7 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 122. Up to 38 conditions per place. [2023-08-30 02:06:24,720 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 25 selfloop transitions, 6 changer transitions 0/31 dead transitions. [2023-08-30 02:06:24,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 31 transitions, 139 flow [2023-08-30 02:06:24,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:06:24,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:06:24,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 529 transitions. [2023-08-30 02:06:24,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39894419306184015 [2023-08-30 02:06:24,722 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 529 transitions. [2023-08-30 02:06:24,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 529 transitions. [2023-08-30 02:06:24,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:24,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 529 transitions. [2023-08-30 02:06:24,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have 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,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have 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,725 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have 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,725 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 54 flow. Second operand 6 states and 529 transitions. [2023-08-30 02:06:24,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 31 transitions, 139 flow [2023-08-30 02:06:24,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:06:24,727 INFO L231 Difference]: Finished difference. Result has 30 places, 23 transitions, 75 flow [2023-08-30 02:06:24,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=75, PETRI_PLACES=30, PETRI_TRANSITIONS=23} [2023-08-30 02:06:24,728 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-30 02:06:24,729 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 75 flow [2023-08-30 02:06:24,729 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:24,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:24,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:24,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:06:24,730 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:24,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:24,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1176181353, now seen corresponding path program 1 times [2023-08-30 02:06:24,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:24,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860964285] [2023-08-30 02:06:24,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:24,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:24,784 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,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:24,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860964285] [2023-08-30 02:06:24,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860964285] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:24,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:24,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:06:24,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269964126] [2023-08-30 02:06:24,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:24,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:06:24,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:24,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:06:24,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:06:24,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 221 [2023-08-30 02:06:24,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:06:24,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:24,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 221 [2023-08-30 02:06:24,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:24,895 INFO L130 PetriNetUnfolder]: 12/48 cut-off events. [2023-08-30 02:06:24,896 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-08-30 02:06:24,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 48 events. 12/48 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 1 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 116. Up to 29 conditions per place. [2023-08-30 02:06:24,897 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 21 selfloop transitions, 5 changer transitions 0/26 dead transitions. [2023-08-30 02:06:24,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 26 transitions, 134 flow [2023-08-30 02:06:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:06:24,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:06:24,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 387 transitions. [2023-08-30 02:06:24,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43778280542986425 [2023-08-30 02:06:24,899 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 387 transitions. [2023-08-30 02:06:24,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 387 transitions. [2023-08-30 02:06:24,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:24,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 387 transitions. [2023-08-30 02:06:24,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.75) internal successors, (387), 4 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:06:24,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have 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,902 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have 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,902 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 75 flow. Second operand 4 states and 387 transitions. [2023-08-30 02:06:24,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 26 transitions, 134 flow [2023-08-30 02:06:24,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 133 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:06:24,903 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 80 flow [2023-08-30 02:06:24,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2023-08-30 02:06:24,903 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-30 02:06:24,904 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 80 flow [2023-08-30 02:06:24,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:06:24,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:24,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:24,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:06:24,904 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:24,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:24,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1176181352, now seen corresponding path program 1 times [2023-08-30 02:06:24,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:24,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500969459] [2023-08-30 02:06:24,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:24,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:24,988 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,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:24,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500969459] [2023-08-30 02:06:24,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500969459] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:24,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:24,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:06:24,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50376584] [2023-08-30 02:06:24,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:24,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:06:24,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:24,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:06:24,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:06:25,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 221 [2023-08-30 02:06:25,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:06:25,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:25,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 221 [2023-08-30 02:06:25,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:25,131 INFO L130 PetriNetUnfolder]: 11/42 cut-off events. [2023-08-30 02:06:25,131 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2023-08-30 02:06:25,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 42 events. 11/42 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 100 event pairs, 5 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 111. Up to 30 conditions per place. [2023-08-30 02:06:25,132 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 22 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2023-08-30 02:06:25,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 139 flow [2023-08-30 02:06:25,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:06:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:06:25,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 387 transitions. [2023-08-30 02:06:25,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43778280542986425 [2023-08-30 02:06:25,134 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 387 transitions. [2023-08-30 02:06:25,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 387 transitions. [2023-08-30 02:06:25,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:25,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 387 transitions. [2023-08-30 02:06:25,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.75) internal successors, (387), 4 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:06:25,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have 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,136 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have 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,136 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 80 flow. Second operand 4 states and 387 transitions. [2023-08-30 02:06:25,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 139 flow [2023-08-30 02:06:25,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 129 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:06:25,137 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 78 flow [2023-08-30 02:06:25,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, 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:25,138 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-30 02:06:25,138 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 78 flow [2023-08-30 02:06:25,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:06:25,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:25,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:25,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:06:25,139 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:25,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:25,139 INFO L85 PathProgramCache]: Analyzing trace with hash 2101885032, now seen corresponding path program 1 times [2023-08-30 02:06:25,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:25,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796488231] [2023-08-30 02:06:25,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:25,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:25,362 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:25,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:25,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796488231] [2023-08-30 02:06:25,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796488231] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:06:25,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887944251] [2023-08-30 02:06:25,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:25,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:06:25,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:06:25,401 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:25,467 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:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:25,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-30 02:06:25,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:06:25,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:25,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:25,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:25,688 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:25,722 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-30 02:06:25,722 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:25,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:25,820 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:25,888 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:25,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:06:25,963 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:25,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887944251] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:06:25,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:06:25,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 14 [2023-08-30 02:06:25,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895448945] [2023-08-30 02:06:25,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:06:25,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-30 02:06:25,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:25,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-30 02:06:25,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2023-08-30 02:06:26,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 221 [2023-08-30 02:06:26,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 78 flow. Second operand has 16 states, 16 states have (on average 82.875) internal successors, (1326), 16 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have 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,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:26,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 221 [2023-08-30 02:06:26,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:27,362 INFO L130 PetriNetUnfolder]: 24/85 cut-off events. [2023-08-30 02:06:27,362 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2023-08-30 02:06:27,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 85 events. 24/85 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 278 event pairs, 4 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 220. Up to 23 conditions per place. [2023-08-30 02:06:27,363 INFO L137 encePairwiseOnDemand]: 214/221 looper letters, 36 selfloop transitions, 15 changer transitions 0/51 dead transitions. [2023-08-30 02:06:27,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 272 flow [2023-08-30 02:06:27,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 02:06:27,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 02:06:27,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1189 transitions. [2023-08-30 02:06:27,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3842921784098255 [2023-08-30 02:06:27,366 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1189 transitions. [2023-08-30 02:06:27,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1189 transitions. [2023-08-30 02:06:27,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:27,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1189 transitions. [2023-08-30 02:06:27,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 84.92857142857143) internal successors, (1189), 14 states have internal predecessors, (1189), 0 states have call successors, (0), 0 states have 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,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 221.0) internal successors, (3315), 15 states have internal predecessors, (3315), 0 states have call successors, (0), 0 states have 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,376 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 221.0) internal successors, (3315), 15 states have internal predecessors, (3315), 0 states have call successors, (0), 0 states have 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,376 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 78 flow. Second operand 14 states and 1189 transitions. [2023-08-30 02:06:27,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 51 transitions, 272 flow [2023-08-30 02:06:27,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 266 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:06:27,378 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 173 flow [2023-08-30 02:06:27,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, 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=14, PETRI_FLOW=173, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2023-08-30 02:06:27,379 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2023-08-30 02:06:27,379 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 173 flow [2023-08-30 02:06:27,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 82.875) internal successors, (1326), 16 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have 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,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:27,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:27,403 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:27,585 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:27,585 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:27,586 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:27,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1172842328, now seen corresponding path program 1 times [2023-08-30 02:06:27,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:27,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214114518] [2023-08-30 02:06:27,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:27,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:27,674 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,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:27,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214114518] [2023-08-30 02:06:27,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214114518] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:06:27,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661664104] [2023-08-30 02:06:27,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:27,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:06:27,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:06:27,694 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:27,709 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:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:27,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-30 02:06:27,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:06:27,790 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:27,826 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,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:06:27,869 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,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661664104] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:06:27,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:06:27,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-08-30 02:06:27,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287412279] [2023-08-30 02:06:27,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:06:27,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 02:06:27,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:27,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 02:06:27,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-08-30 02:06:28,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 221 [2023-08-30 02:06:28,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 173 flow. Second operand has 11 states, 11 states have (on average 89.36363636363636) internal successors, (983), 11 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have 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:28,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:28,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 221 [2023-08-30 02:06:28,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:28,281 INFO L130 PetriNetUnfolder]: 21/76 cut-off events. [2023-08-30 02:06:28,281 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2023-08-30 02:06:28,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 76 events. 21/76 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 201 event pairs, 5 based on Foata normal form. 6/82 useless extension candidates. Maximal degree in co-relation 254. Up to 29 conditions per place. [2023-08-30 02:06:28,283 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 38 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2023-08-30 02:06:28,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 311 flow [2023-08-30 02:06:28,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:06:28,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:06:28,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 654 transitions. [2023-08-30 02:06:28,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4227537168713639 [2023-08-30 02:06:28,285 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 654 transitions. [2023-08-30 02:06:28,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 654 transitions. [2023-08-30 02:06:28,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:28,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 654 transitions. [2023-08-30 02:06:28,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have 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:28,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have 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:28,289 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have 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:28,289 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 173 flow. Second operand 7 states and 654 transitions. [2023-08-30 02:06:28,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 311 flow [2023-08-30 02:06:28,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 283 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-30 02:06:28,293 INFO L231 Difference]: Finished difference. Result has 51 places, 30 transitions, 186 flow [2023-08-30 02:06:28,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=186, PETRI_PLACES=51, PETRI_TRANSITIONS=30} [2023-08-30 02:06:28,294 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2023-08-30 02:06:28,294 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 30 transitions, 186 flow [2023-08-30 02:06:28,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.36363636363636) internal successors, (983), 11 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have 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:28,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:28,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:28,317 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:28,517 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:28,518 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:28,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:28,518 INFO L85 PathProgramCache]: Analyzing trace with hash 733306717, now seen corresponding path program 1 times [2023-08-30 02:06:28,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:28,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397265622] [2023-08-30 02:06:28,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:28,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:28,536 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:28,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:28,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397265622] [2023-08-30 02:06:28,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397265622] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:28,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:28,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:06:28,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997925164] [2023-08-30 02:06:28,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:28,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:06:28,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:28,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:06:28,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:06:28,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 221 [2023-08-30 02:06:28,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 30 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:06:28,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:28,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 221 [2023-08-30 02:06:28,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:28,574 INFO L130 PetriNetUnfolder]: 20/70 cut-off events. [2023-08-30 02:06:28,574 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2023-08-30 02:06:28,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 70 events. 20/70 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 176 event pairs, 13 based on Foata normal form. 2/72 useless extension candidates. Maximal degree in co-relation 264. Up to 67 conditions per place. [2023-08-30 02:06:28,575 INFO L137 encePairwiseOnDemand]: 219/221 looper letters, 28 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-08-30 02:06:28,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 29 transitions, 237 flow [2023-08-30 02:06:28,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:06:28,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:06:28,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2023-08-30 02:06:28,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2023-08-30 02:06:28,577 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 306 transitions. [2023-08-30 02:06:28,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions. [2023-08-30 02:06:28,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:28,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions. [2023-08-30 02:06:28,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have 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:28,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have 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:28,579 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have 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:28,579 INFO L175 Difference]: Start difference. First operand has 51 places, 30 transitions, 186 flow. Second operand 3 states and 306 transitions. [2023-08-30 02:06:28,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 29 transitions, 237 flow [2023-08-30 02:06:28,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 29 transitions, 224 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-30 02:06:28,580 INFO L231 Difference]: Finished difference. Result has 46 places, 28 transitions, 166 flow [2023-08-30 02:06:28,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=46, PETRI_TRANSITIONS=28} [2023-08-30 02:06:28,581 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2023-08-30 02:06:28,581 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 28 transitions, 166 flow [2023-08-30 02:06:28,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:06:28,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:28,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:28,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 02:06:28,582 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:28,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:28,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1258283604, now seen corresponding path program 1 times [2023-08-30 02:06:28,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:28,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549238967] [2023-08-30 02:06:28,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:28,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:28,683 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:28,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:28,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549238967] [2023-08-30 02:06:28,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549238967] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:28,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:28,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:06:28,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140938772] [2023-08-30 02:06:28,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:28,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:06:28,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:28,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:06:28,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:06:28,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 221 [2023-08-30 02:06:28,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 28 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have 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:28,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:28,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 221 [2023-08-30 02:06:28,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:28,797 INFO L130 PetriNetUnfolder]: 20/69 cut-off events. [2023-08-30 02:06:28,797 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2023-08-30 02:06:28,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 69 events. 20/69 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 179 event pairs, 12 based on Foata normal form. 1/70 useless extension candidates. Maximal degree in co-relation 247. Up to 61 conditions per place. [2023-08-30 02:06:28,798 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 28 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2023-08-30 02:06:28,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 32 transitions, 239 flow [2023-08-30 02:06:28,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:06:28,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:06:28,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2023-08-30 02:06:28,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.432579185520362 [2023-08-30 02:06:28,799 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 478 transitions. [2023-08-30 02:06:28,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 478 transitions. [2023-08-30 02:06:28,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:28,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 478 transitions. [2023-08-30 02:06:28,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have 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:28,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have 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:28,802 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have 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:28,802 INFO L175 Difference]: Start difference. First operand has 46 places, 28 transitions, 166 flow. Second operand 5 states and 478 transitions. [2023-08-30 02:06:28,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 32 transitions, 239 flow [2023-08-30 02:06:28,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 32 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:06:28,804 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 178 flow [2023-08-30 02:06:28,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=43, 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=178, PETRI_PLACES=48, PETRI_TRANSITIONS=28} [2023-08-30 02:06:28,804 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2023-08-30 02:06:28,804 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 178 flow [2023-08-30 02:06:28,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have 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:28,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:28,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:28,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 02:06:28,805 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:28,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:28,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1258283588, now seen corresponding path program 1 times [2023-08-30 02:06:28,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:28,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808194398] [2023-08-30 02:06:28,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:28,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:29,004 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:29,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:29,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808194398] [2023-08-30 02:06:29,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808194398] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:29,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:06:29,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:06:29,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374649713] [2023-08-30 02:06:29,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:29,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:06:29,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:29,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:06:29,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:06:29,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 221 [2023-08-30 02:06:29,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 28 transitions, 178 flow. Second operand has 8 states, 8 states have (on average 85.5) internal successors, (684), 8 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have 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,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:29,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 221 [2023-08-30 02:06:29,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:29,364 INFO L130 PetriNetUnfolder]: 19/64 cut-off events. [2023-08-30 02:06:29,364 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2023-08-30 02:06:29,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 64 events. 19/64 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 151 event pairs, 1 based on Foata normal form. 2/66 useless extension candidates. Maximal degree in co-relation 246. Up to 45 conditions per place. [2023-08-30 02:06:29,364 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 22 selfloop transitions, 9 changer transitions 0/31 dead transitions. [2023-08-30 02:06:29,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 31 transitions, 245 flow [2023-08-30 02:06:29,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:06:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:06:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 527 transitions. [2023-08-30 02:06:29,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3974358974358974 [2023-08-30 02:06:29,366 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 527 transitions. [2023-08-30 02:06:29,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 527 transitions. [2023-08-30 02:06:29,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:29,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 527 transitions. [2023-08-30 02:06:29,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.83333333333333) internal successors, (527), 6 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have 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,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have 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,369 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have 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,369 INFO L175 Difference]: Start difference. First operand has 48 places, 28 transitions, 178 flow. Second operand 6 states and 527 transitions. [2023-08-30 02:06:29,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 31 transitions, 245 flow [2023-08-30 02:06:29,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 31 transitions, 237 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-30 02:06:29,371 INFO L231 Difference]: Finished difference. Result has 50 places, 28 transitions, 192 flow [2023-08-30 02:06:29,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=50, PETRI_TRANSITIONS=28} [2023-08-30 02:06:29,371 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2023-08-30 02:06:29,371 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 28 transitions, 192 flow [2023-08-30 02:06:29,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 85.5) internal successors, (684), 8 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have 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,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:29,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:29,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 02:06:29,372 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:06:29,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:29,373 INFO L85 PathProgramCache]: Analyzing trace with hash 351953142, now seen corresponding path program 1 times [2023-08-30 02:06:29,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:29,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686195320] [2023-08-30 02:06:29,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:29,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:29,575 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:29,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:29,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686195320] [2023-08-30 02:06:29,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686195320] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:06:29,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850445853] [2023-08-30 02:06:29,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:29,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:06:29,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:06:29,589 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:29,664 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:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:29,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-30 02:06:29,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:06:29,749 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-30 02:06:29,749 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:29,754 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:29,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:29,843 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 02:06:29,843 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:29,866 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:29,908 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:29,925 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:29,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:06:29,940 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_225) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 1)))) is different from false [2023-08-30 02:06:30,043 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:06:30,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850445853] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:06:30,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:06:30,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2023-08-30 02:06:30,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311444600] [2023-08-30 02:06:30,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:06:30,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-30 02:06:30,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:30,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-30 02:06:30,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=172, Unknown=2, NotChecked=26, Total=240 [2023-08-30 02:06:30,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 221 [2023-08-30 02:06:30,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 28 transitions, 192 flow. Second operand has 16 states, 16 states have (on average 38.1875) internal successors, (611), 16 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have 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,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:30,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 221 [2023-08-30 02:06:30,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:30,320 INFO L130 PetriNetUnfolder]: 18/58 cut-off events. [2023-08-30 02:06:30,320 INFO L131 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2023-08-30 02:06:30,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 58 events. 18/58 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 2 based on Foata normal form. 2/60 useless extension candidates. Maximal degree in co-relation 234. Up to 40 conditions per place. [2023-08-30 02:06:30,321 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 24 selfloop transitions, 6 changer transitions 0/30 dead transitions. [2023-08-30 02:06:30,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 30 transitions, 249 flow [2023-08-30 02:06:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:06:30,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:06:30,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 204 transitions. [2023-08-30 02:06:30,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.18461538461538463 [2023-08-30 02:06:30,322 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 204 transitions. [2023-08-30 02:06:30,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 204 transitions. [2023-08-30 02:06:30,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:30,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 204 transitions. [2023-08-30 02:06:30,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have 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,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have 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,325 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have 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,325 INFO L175 Difference]: Start difference. First operand has 50 places, 28 transitions, 192 flow. Second operand 5 states and 204 transitions. [2023-08-30 02:06:30,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 30 transitions, 249 flow [2023-08-30 02:06:30,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 30 transitions, 236 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-30 02:06:30,327 INFO L231 Difference]: Finished difference. Result has 50 places, 27 transitions, 189 flow [2023-08-30 02:06:30,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=50, PETRI_TRANSITIONS=27} [2023-08-30 02:06:30,328 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2023-08-30 02:06:30,328 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 27 transitions, 189 flow [2023-08-30 02:06:30,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 38.1875) internal successors, (611), 16 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have 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,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:30,329 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:30,351 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:30,534 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:30,534 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:30,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:30,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1175254242, now seen corresponding path program 2 times [2023-08-30 02:06:30,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:30,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7868690] [2023-08-30 02:06:30,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:30,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:30,713 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:30,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:30,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7868690] [2023-08-30 02:06:30,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7868690] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:06:30,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032062879] [2023-08-30 02:06:30,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:06:30,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:06:30,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:06:30,742 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:30,743 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:30,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:06:30,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:06:30,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-30 02:06:30,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:06:30,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:30,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:30,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:30,829 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:30,857 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-30 02:06:30,858 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:30,911 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-30 02:06:30,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 02:06:30,916 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:31,017 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-30 02:06:31,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:06:31,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032062879] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:06:31,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 02:06:31,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 11 [2023-08-30 02:06:31,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364265051] [2023-08-30 02:06:31,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:06:31,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:06:31,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:31,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:06:31,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-08-30 02:06:31,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 221 [2023-08-30 02:06:31,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 27 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have 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,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:31,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 221 [2023-08-30 02:06:31,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:31,291 INFO L130 PetriNetUnfolder]: 15/53 cut-off events. [2023-08-30 02:06:31,292 INFO L131 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2023-08-30 02:06:31,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 53 events. 15/53 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 106 event pairs, 0 based on Foata normal form. 4/57 useless extension candidates. Maximal degree in co-relation 220. Up to 40 conditions per place. [2023-08-30 02:06:31,293 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 21 selfloop transitions, 6 changer transitions 0/27 dead transitions. [2023-08-30 02:06:31,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 27 transitions, 229 flow [2023-08-30 02:06:31,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:06:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:06:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 564 transitions. [2023-08-30 02:06:31,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4253393665158371 [2023-08-30 02:06:31,295 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 564 transitions. [2023-08-30 02:06:31,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 564 transitions. [2023-08-30 02:06:31,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:31,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 564 transitions. [2023-08-30 02:06:31,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.0) internal successors, (564), 6 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:06:31,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have 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,298 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have 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,298 INFO L175 Difference]: Start difference. First operand has 50 places, 27 transitions, 189 flow. Second operand 6 states and 564 transitions. [2023-08-30 02:06:31,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 27 transitions, 229 flow [2023-08-30 02:06:31,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 27 transitions, 208 flow, removed 2 selfloop flow, removed 7 redundant places. [2023-08-30 02:06:31,301 INFO L231 Difference]: Finished difference. Result has 47 places, 25 transitions, 162 flow [2023-08-30 02:06:31,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=47, PETRI_TRANSITIONS=25} [2023-08-30 02:06:31,301 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2023-08-30 02:06:31,302 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 25 transitions, 162 flow [2023-08-30 02:06:31,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have 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,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:31,302 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:31,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-30 02:06:31,507 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:31,507 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:31,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:31,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1974487420, now seen corresponding path program 1 times [2023-08-30 02:06:31,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:31,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681403784] [2023-08-30 02:06:31,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:31,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:31,762 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:31,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:31,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681403784] [2023-08-30 02:06:31,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681403784] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:06:31,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141621834] [2023-08-30 02:06:31,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:31,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:06:31,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:06:31,764 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:31,766 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:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:31,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-30 02:06:31,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:06:31,883 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-30 02:06:31,884 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:31,894 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:31,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:31,975 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 02:06:31,975 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:32,003 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,049 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,076 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,096 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:32,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:06:32,112 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_314 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_314) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 1)))) is different from false [2023-08-30 02:06:32,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-30 02:06:32,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141621834] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:06:32,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:06:32,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2023-08-30 02:06:32,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623929587] [2023-08-30 02:06:32,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:06:32,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-30 02:06:32,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:32,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-30 02:06:32,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=321, Unknown=6, NotChecked=36, Total=420 [2023-08-30 02:06:32,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 221 [2023-08-30 02:06:32,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 25 transitions, 162 flow. Second operand has 21 states, 21 states have (on average 37.80952380952381) internal successors, (794), 21 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:06:32,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:32,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 221 [2023-08-30 02:06:32,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:34,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:06:36,864 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:06:38,892 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:06:39,077 INFO L130 PetriNetUnfolder]: 15/50 cut-off events. [2023-08-30 02:06:39,077 INFO L131 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2023-08-30 02:06:39,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 50 events. 15/50 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 83 event pairs, 1 based on Foata normal form. 3/53 useless extension candidates. Maximal degree in co-relation 202. Up to 28 conditions per place. [2023-08-30 02:06:39,077 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 20 selfloop transitions, 11 changer transitions 0/31 dead transitions. [2023-08-30 02:06:39,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 31 transitions, 245 flow [2023-08-30 02:06:39,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:06:39,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:06:39,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 354 transitions. [2023-08-30 02:06:39,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.1779788838612368 [2023-08-30 02:06:39,080 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 354 transitions. [2023-08-30 02:06:39,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 354 transitions. [2023-08-30 02:06:39,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:39,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 354 transitions. [2023-08-30 02:06:39,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 39.333333333333336) internal successors, (354), 9 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have 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:39,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 221.0) internal successors, (2210), 10 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have 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:39,083 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 221.0) internal successors, (2210), 10 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have 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:39,083 INFO L175 Difference]: Start difference. First operand has 47 places, 25 transitions, 162 flow. Second operand 9 states and 354 transitions. [2023-08-30 02:06:39,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 31 transitions, 245 flow [2023-08-30 02:06:39,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 31 transitions, 228 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-08-30 02:06:39,085 INFO L231 Difference]: Finished difference. Result has 50 places, 27 transitions, 185 flow [2023-08-30 02:06:39,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=185, PETRI_PLACES=50, PETRI_TRANSITIONS=27} [2023-08-30 02:06:39,086 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2023-08-30 02:06:39,086 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 27 transitions, 185 flow [2023-08-30 02:06:39,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 37.80952380952381) internal successors, (794), 21 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:06:39,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:39,086 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:39,092 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:39,292 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:39,292 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:39,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:39,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1175254296, now seen corresponding path program 2 times [2023-08-30 02:06:39,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:39,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784667800] [2023-08-30 02:06:39,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:39,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:39,654 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:39,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:39,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784667800] [2023-08-30 02:06:39,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784667800] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:06:39,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547823141] [2023-08-30 02:06:39,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:06:39,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:06:39,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:06:39,655 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,657 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,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 02:06:39,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:06:39,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-30 02:06:39,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:06:39,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:39,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:39,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:39,770 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:39,793 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-30 02:06:39,793 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,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:39,836 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:39,990 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:39,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:06:40,185 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:40,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547823141] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:06:40,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:06:40,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 26 [2023-08-30 02:06:40,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990947573] [2023-08-30 02:06:40,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:06:40,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-30 02:06:40,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:40,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-30 02:06:40,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2023-08-30 02:06:42,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 221 [2023-08-30 02:06:42,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 27 transitions, 185 flow. Second operand has 28 states, 28 states have (on average 76.5) internal successors, (2142), 28 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have 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,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:06:42,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 221 [2023-08-30 02:06:42,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:06:43,673 INFO L130 PetriNetUnfolder]: 21/77 cut-off events. [2023-08-30 02:06:43,674 INFO L131 PetriNetUnfolder]: For 158/158 co-relation queries the response was YES. [2023-08-30 02:06:43,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 77 events. 21/77 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 186 event pairs, 3 based on Foata normal form. 6/83 useless extension candidates. Maximal degree in co-relation 325. Up to 19 conditions per place. [2023-08-30 02:06:43,676 INFO L137 encePairwiseOnDemand]: 215/221 looper letters, 33 selfloop transitions, 18 changer transitions 0/51 dead transitions. [2023-08-30 02:06:43,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 51 transitions, 401 flow [2023-08-30 02:06:43,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-30 02:06:43,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-30 02:06:43,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1251 transitions. [2023-08-30 02:06:43,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353789592760181 [2023-08-30 02:06:43,701 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1251 transitions. [2023-08-30 02:06:43,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1251 transitions. [2023-08-30 02:06:43,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:06:43,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1251 transitions. [2023-08-30 02:06:43,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 78.1875) internal successors, (1251), 16 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have 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:43,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 221.0) internal successors, (3757), 17 states have internal predecessors, (3757), 0 states have call successors, (0), 0 states have 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:43,708 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 221.0) internal successors, (3757), 17 states have internal predecessors, (3757), 0 states have call successors, (0), 0 states have 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:43,708 INFO L175 Difference]: Start difference. First operand has 50 places, 27 transitions, 185 flow. Second operand 16 states and 1251 transitions. [2023-08-30 02:06:43,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 51 transitions, 401 flow [2023-08-30 02:06:43,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 51 transitions, 345 flow, removed 12 selfloop flow, removed 9 redundant places. [2023-08-30 02:06:43,710 INFO L231 Difference]: Finished difference. Result has 60 places, 34 transitions, 241 flow [2023-08-30 02:06:43,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=241, PETRI_PLACES=60, PETRI_TRANSITIONS=34} [2023-08-30 02:06:43,711 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 24 predicate places. [2023-08-30 02:06:43,711 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 34 transitions, 241 flow [2023-08-30 02:06:43,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 76.5) internal successors, (2142), 28 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have 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:43,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:06:43,712 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:06:43,736 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:43,918 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:43,919 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:06:43,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:06:43,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1079700314, now seen corresponding path program 2 times [2023-08-30 02:06:43,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:06:43,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858153938] [2023-08-30 02:06:43,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:06:43,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:06:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:06:44,240 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,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:06:44,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858153938] [2023-08-30 02:06:44,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858153938] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:06:44,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620817542] [2023-08-30 02:06:44,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:06:44,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:06:44,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:06:44,257 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:44,305 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:44,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 02:06:44,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:06:44,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-30 02:06:44,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:06:44,377 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-08-30 02:06:44,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:44,381 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:44,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:44,493 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-30 02:06:44,493 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:44,527 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-30 02:06:44,528 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:44,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:44,575 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-30 02:06:44,575 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:44,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:06:44,610 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-30 02:06:44,610 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:44,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:44,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:06:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:06:58,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620817542] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:06:58,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:06:58,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2023-08-30 02:06:58,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122420740] [2023-08-30 02:06:58,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:06:58,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-30 02:06:58,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:06:58,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-30 02:06:58,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=459, Unknown=5, NotChecked=0, Total=552 [2023-08-30 02:07:00,574 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:07:02,587 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:07:04,612 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:07:06,717 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:07:08,836 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:07:10,862 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:07:12,873 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:07:14,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:07:17,025 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:07:19,085 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:07:21,192 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:07:23,216 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:07:25,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:07:27,351 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:07:29,457 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:07:31,584 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:07:33,889 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:07:35,914 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:07:38,043 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:07:40,160 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:07:42,186 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:07:44,196 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:07:46,305 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:07:48,372 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:07:50,433 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:07:52,706 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:07:54,760 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:07:56,818 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:07:58,917 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:08:00,937 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:08:02,958 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:08:04,982 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:08:07,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:08:09,171 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:08:11,239 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:08:13,321 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:08:15,414 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:08:17,498 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:08:19,587 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:08:22,003 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:08:24,088 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:08:26,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:08:28,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:08:30,423 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:08:32,510 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:08:32,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 221 [2023-08-30 02:08:32,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 34 transitions, 241 flow. Second operand has 24 states, 24 states have (on average 38.75) internal successors, (930), 24 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have 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:08:32,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:08:32,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 221 [2023-08-30 02:08:32,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:08:32,904 INFO L130 PetriNetUnfolder]: 19/66 cut-off events. [2023-08-30 02:08:32,905 INFO L131 PetriNetUnfolder]: For 91/91 co-relation queries the response was YES. [2023-08-30 02:08:32,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 66 events. 19/66 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 131 event pairs, 1 based on Foata normal form. 7/73 useless extension candidates. Maximal degree in co-relation 299. Up to 39 conditions per place. [2023-08-30 02:08:32,905 INFO L137 encePairwiseOnDemand]: 215/221 looper letters, 22 selfloop transitions, 12 changer transitions 0/34 dead transitions. [2023-08-30 02:08:32,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 34 transitions, 307 flow [2023-08-30 02:08:32,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:08:32,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:08:32,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 358 transitions. [2023-08-30 02:08:32,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.17998994469582705 [2023-08-30 02:08:32,907 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 358 transitions. [2023-08-30 02:08:32,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 358 transitions. [2023-08-30 02:08:32,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:08:32,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 358 transitions. [2023-08-30 02:08:32,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 39.77777777777778) internal successors, (358), 9 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have 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:08:32,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 221.0) internal successors, (2210), 10 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have 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:08:32,910 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 221.0) internal successors, (2210), 10 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have 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:08:32,910 INFO L175 Difference]: Start difference. First operand has 60 places, 34 transitions, 241 flow. Second operand 9 states and 358 transitions. [2023-08-30 02:08:32,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 34 transitions, 307 flow [2023-08-30 02:08:32,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 34 transitions, 274 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-08-30 02:08:32,911 INFO L231 Difference]: Finished difference. Result has 58 places, 30 transitions, 214 flow [2023-08-30 02:08:32,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=214, PETRI_PLACES=58, PETRI_TRANSITIONS=30} [2023-08-30 02:08:32,912 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2023-08-30 02:08:32,912 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 30 transitions, 214 flow [2023-08-30 02:08:32,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 38.75) internal successors, (930), 24 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have 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:08:32,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:08:32,912 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:08:32,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-30 02:08:33,117 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:08:33,117 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:08:33,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:08:33,118 INFO L85 PathProgramCache]: Analyzing trace with hash 888896212, now seen corresponding path program 2 times [2023-08-30 02:08:33,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:08:33,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009723874] [2023-08-30 02:08:33,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:08:33,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:08:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:08:33,461 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:08:33,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:08:33,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009723874] [2023-08-30 02:08:33,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009723874] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:08:33,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034166902] [2023-08-30 02:08:33,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:08:33,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:08:33,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:08:33,471 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:08:33,500 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:08:33,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 02:08:33,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:08:33,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-30 02:08:33,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:08:33,612 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-30 02:08:33,613 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:08:33,622 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:08:33,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:08:33,722 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 02:08:33,722 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:08:33,759 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:08:33,817 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:08:33,843 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:08:33,880 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:08:33,917 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:08:33,945 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:08:33,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:08:34,079 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_466) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 4)))) is different from false [2023-08-30 02:08:34,206 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-08-30 02:08:34,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034166902] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:08:34,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:08:34,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2023-08-30 02:08:34,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630187741] [2023-08-30 02:08:34,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:08:34,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-30 02:08:34,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:08:34,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-30 02:08:34,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=477, Unknown=15, NotChecked=44, Total=600 [2023-08-30 02:08:34,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 221 [2023-08-30 02:08:34,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 30 transitions, 214 flow. Second operand has 25 states, 25 states have (on average 37.76) internal successors, (944), 25 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have 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:08:34,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:08:34,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 221 [2023-08-30 02:08:34,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:08:34,649 INFO L130 PetriNetUnfolder]: 18/61 cut-off events. [2023-08-30 02:08:34,650 INFO L131 PetriNetUnfolder]: For 123/123 co-relation queries the response was YES. [2023-08-30 02:08:34,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 61 events. 18/61 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 109 event pairs, 2 based on Foata normal form. 2/63 useless extension candidates. Maximal degree in co-relation 265. Up to 32 conditions per place. [2023-08-30 02:08:34,650 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 23 selfloop transitions, 11 changer transitions 0/34 dead transitions. [2023-08-30 02:08:34,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 34 transitions, 294 flow [2023-08-30 02:08:34,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:08:34,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:08:34,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 316 transitions. [2023-08-30 02:08:34,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.17873303167420815 [2023-08-30 02:08:34,652 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 316 transitions. [2023-08-30 02:08:34,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 316 transitions. [2023-08-30 02:08:34,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:08:34,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 316 transitions. [2023-08-30 02:08:34,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 39.5) internal successors, (316), 8 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have 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:08:34,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have 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:08:34,655 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have 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:08:34,655 INFO L175 Difference]: Start difference. First operand has 58 places, 30 transitions, 214 flow. Second operand 8 states and 316 transitions. [2023-08-30 02:08:34,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 34 transitions, 294 flow [2023-08-30 02:08:34,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 34 transitions, 267 flow, removed 1 selfloop flow, removed 8 redundant places. [2023-08-30 02:08:34,658 INFO L231 Difference]: Finished difference. Result has 57 places, 29 transitions, 208 flow [2023-08-30 02:08:34,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=208, PETRI_PLACES=57, PETRI_TRANSITIONS=29} [2023-08-30 02:08:34,659 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2023-08-30 02:08:34,659 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 29 transitions, 208 flow [2023-08-30 02:08:34,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 37.76) internal successors, (944), 25 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have 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:08:34,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:08:34,659 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:08:34,665 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:08:34,865 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:08:34,865 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:08:34,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:08:34,865 INFO L85 PathProgramCache]: Analyzing trace with hash 574975110, now seen corresponding path program 3 times [2023-08-30 02:08:34,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:08:34,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410618353] [2023-08-30 02:08:34,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:08:34,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:08:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:08:35,435 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:08:35,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:08:35,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410618353] [2023-08-30 02:08:35,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410618353] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:08:35,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038622892] [2023-08-30 02:08:35,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:08:35,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:08:35,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:08:35,452 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:08:35,453 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:08:35,555 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-30 02:08:35,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:08:35,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 02:08:35,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:08:35,606 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-30 02:08:35,606 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:08:35,611 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:08:35,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:08:35,680 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 02:08:35,680 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:08:35,708 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:08:35,765 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:08:35,814 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:08:35,850 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:08:35,883 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:08:35,935 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:08:35,980 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:08:35,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:08:36,237 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_526 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_526) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 5 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2023-08-30 02:08:36,362 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:08:36,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038622892] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:08:36,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:08:36,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2023-08-30 02:08:36,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401095694] [2023-08-30 02:08:36,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:08:36,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-30 02:08:36,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:08:36,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-30 02:08:36,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=617, Unknown=26, NotChecked=50, Total=756 [2023-08-30 02:08:36,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 221 [2023-08-30 02:08:36,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 29 transitions, 208 flow. Second operand has 28 states, 28 states have (on average 37.67857142857143) internal successors, (1055), 28 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have 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:08:36,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:08:36,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 221 [2023-08-30 02:08:36,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:08:37,429 INFO L130 PetriNetUnfolder]: 17/56 cut-off events. [2023-08-30 02:08:37,429 INFO L131 PetriNetUnfolder]: For 128/128 co-relation queries the response was YES. [2023-08-30 02:08:37,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 56 events. 17/56 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 82 event pairs, 2 based on Foata normal form. 2/58 useless extension candidates. Maximal degree in co-relation 244. Up to 24 conditions per place. [2023-08-30 02:08:37,429 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 22 selfloop transitions, 12 changer transitions 0/34 dead transitions. [2023-08-30 02:08:37,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 34 transitions, 288 flow [2023-08-30 02:08:37,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:08:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:08:37,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 354 transitions. [2023-08-30 02:08:37,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.1779788838612368 [2023-08-30 02:08:37,439 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 354 transitions. [2023-08-30 02:08:37,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 354 transitions. [2023-08-30 02:08:37,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:08:37,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 354 transitions. [2023-08-30 02:08:37,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 39.333333333333336) internal successors, (354), 9 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have 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:08:37,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 221.0) internal successors, (2210), 10 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have 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:08:37,441 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 221.0) internal successors, (2210), 10 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have 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:08:37,441 INFO L175 Difference]: Start difference. First operand has 57 places, 29 transitions, 208 flow. Second operand 9 states and 354 transitions. [2023-08-30 02:08:37,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 34 transitions, 288 flow [2023-08-30 02:08:37,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 34 transitions, 264 flow, removed 2 selfloop flow, removed 7 redundant places. [2023-08-30 02:08:37,443 INFO L231 Difference]: Finished difference. Result has 58 places, 28 transitions, 203 flow [2023-08-30 02:08:37,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=203, PETRI_PLACES=58, PETRI_TRANSITIONS=28} [2023-08-30 02:08:37,443 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2023-08-30 02:08:37,443 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 28 transitions, 203 flow [2023-08-30 02:08:37,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 37.67857142857143) internal successors, (1055), 28 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have 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:08:37,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:08:37,444 INFO L208 CegarLoopForPetriNet]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:08:37,449 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:08:37,644 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:08:37,644 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:08:37,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:08:37,644 INFO L85 PathProgramCache]: Analyzing trace with hash 575804722, now seen corresponding path program 3 times [2023-08-30 02:08:37,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:08:37,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446259271] [2023-08-30 02:08:37,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:08:37,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:08:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:08:38,263 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:08:38,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:08:38,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446259271] [2023-08-30 02:08:38,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446259271] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:08:38,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672259227] [2023-08-30 02:08:38,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:08:38,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:08:38,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:08:38,269 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:08:38,300 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:08:38,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-08-30 02:08:38,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:08:38,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 65 conjunts are in the unsatisfiable core [2023-08-30 02:08:38,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:08:38,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:08:38,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:08:38,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:08:38,425 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:08:38,458 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-30 02:08:38,458 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:08:38,470 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:08:38,588 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 02:08:38,588 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:08:38,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:08:38,601 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-30 02:08:38,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 21 [2023-08-30 02:08:38,650 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:08:38,721 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:08:38,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 14 treesize of output 16 [2023-08-30 02:08:38,786 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:08:38,834 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:08:38,872 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:08:38,914 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:08:38,955 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:08:38,979 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:08:38,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:08:39,493 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:08:39,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672259227] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:08:39,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:08:39,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2023-08-30 02:08:39,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486109855] [2023-08-30 02:08:39,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:08:39,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-30 02:08:39,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:08:39,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-30 02:08:39,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1183, Unknown=17, NotChecked=0, Total=1332 [2023-08-30 02:08:41,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 221 [2023-08-30 02:08:41,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 28 transitions, 203 flow. Second operand has 37 states, 37 states have (on average 37.351351351351354) internal successors, (1382), 37 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have 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:08:41,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:08:41,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 221 [2023-08-30 02:08:41,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:08:42,072 INFO L130 PetriNetUnfolder]: 11/46 cut-off events. [2023-08-30 02:08:42,072 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2023-08-30 02:08:42,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 46 events. 11/46 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 1 based on Foata normal form. 2/48 useless extension candidates. Maximal degree in co-relation 200. Up to 14 conditions per place. [2023-08-30 02:08:42,072 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 19 selfloop transitions, 13 changer transitions 0/32 dead transitions. [2023-08-30 02:08:42,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 32 transitions, 257 flow [2023-08-30 02:08:42,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-30 02:08:42,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-30 02:08:42,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 499 transitions. [2023-08-30 02:08:42,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.173686042464323 [2023-08-30 02:08:42,074 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 499 transitions. [2023-08-30 02:08:42,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 499 transitions. [2023-08-30 02:08:42,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:08:42,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 499 transitions. [2023-08-30 02:08:42,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 38.38461538461539) internal successors, (499), 13 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have 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:08:42,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 221.0) internal successors, (3094), 14 states have internal predecessors, (3094), 0 states have call successors, (0), 0 states have 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:08:42,077 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 221.0) internal successors, (3094), 14 states have internal predecessors, (3094), 0 states have call successors, (0), 0 states have 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:08:42,077 INFO L175 Difference]: Start difference. First operand has 58 places, 28 transitions, 203 flow. Second operand 13 states and 499 transitions. [2023-08-30 02:08:42,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 32 transitions, 257 flow [2023-08-30 02:08:42,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 32 transitions, 203 flow, removed 3 selfloop flow, removed 17 redundant places. [2023-08-30 02:08:42,078 INFO L231 Difference]: Finished difference. Result has 52 places, 24 transitions, 134 flow [2023-08-30 02:08:42,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=134, PETRI_PLACES=52, PETRI_TRANSITIONS=24} [2023-08-30 02:08:42,078 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2023-08-30 02:08:42,078 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 24 transitions, 134 flow [2023-08-30 02:08:42,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 37.351351351351354) internal successors, (1382), 37 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have 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:08:42,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:08:42,079 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:08:42,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-08-30 02:08:42,279 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:08:42,279 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:08:42,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:08:42,280 INFO L85 PathProgramCache]: Analyzing trace with hash -473485548, now seen corresponding path program 4 times [2023-08-30 02:08:42,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:08:42,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196692756] [2023-08-30 02:08:42,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:08:42,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:08:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:08:42,825 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:08:42,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:08:42,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196692756] [2023-08-30 02:08:42,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196692756] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 02:08:42,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901822224] [2023-08-30 02:08:42,826 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 02:08:42,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 02:08:42,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:08:42,827 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:08:42,829 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:08:42,931 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 02:08:42,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:08:42,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 48 conjunts are in the unsatisfiable core [2023-08-30 02:08:42,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:08:42,965 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-30 02:08:42,967 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:08:42,973 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:08:43,034 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-30 02:08:43,034 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 16 treesize of output 18 [2023-08-30 02:08:43,063 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:08:43,128 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:08:43,156 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:08:43,222 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:08:43,261 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:08:43,294 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:08:43,329 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:08:43,357 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:08:43,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:08:43,382 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_660) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 1)))) is different from false [2023-08-30 02:08:43,386 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_660) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 2 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2023-08-30 02:08:43,425 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_660) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 4)))) is different from false [2023-08-30 02:08:43,428 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_660) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 5 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2023-08-30 02:08:43,588 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2023-08-30 02:08:43,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901822224] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:08:43,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 02:08:43,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30 [2023-08-30 02:08:43,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946860042] [2023-08-30 02:08:43,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 02:08:43,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 02:08:43,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:08:43,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 02:08:43,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=633, Unknown=18, NotChecked=212, Total=930 [2023-08-30 02:08:43,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 221 [2023-08-30 02:08:43,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 24 transitions, 134 flow. Second operand has 31 states, 31 states have (on average 37.61290322580645) internal successors, (1166), 31 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have 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:08:43,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:08:43,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 221 [2023-08-30 02:08:43,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:08:50,532 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:08:52,608 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 [0, 1] [2023-08-30 02:08:52,890 INFO L130 PetriNetUnfolder]: 10/44 cut-off events. [2023-08-30 02:08:52,890 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2023-08-30 02:08:52,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 44 events. 10/44 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 1 based on Foata normal form. 3/47 useless extension candidates. Maximal degree in co-relation 166. Up to 13 conditions per place. [2023-08-30 02:08:52,890 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 17 selfloop transitions, 16 changer transitions 0/33 dead transitions. [2023-08-30 02:08:52,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 33 transitions, 236 flow [2023-08-30 02:08:52,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 02:08:52,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 02:08:52,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 537 transitions. [2023-08-30 02:08:52,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.1735617323852618 [2023-08-30 02:08:52,892 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 537 transitions. [2023-08-30 02:08:52,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 537 transitions. [2023-08-30 02:08:52,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:08:52,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 537 transitions. [2023-08-30 02:08:52,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 38.357142857142854) internal successors, (537), 14 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have 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:08:52,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 221.0) internal successors, (3315), 15 states have internal predecessors, (3315), 0 states have call successors, (0), 0 states have 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:08:52,895 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 221.0) internal successors, (3315), 15 states have internal predecessors, (3315), 0 states have call successors, (0), 0 states have 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:08:52,895 INFO L175 Difference]: Start difference. First operand has 52 places, 24 transitions, 134 flow. Second operand 14 states and 537 transitions. [2023-08-30 02:08:52,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 33 transitions, 236 flow [2023-08-30 02:08:52,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 33 transitions, 196 flow, removed 2 selfloop flow, removed 12 redundant places. [2023-08-30 02:08:52,897 INFO L231 Difference]: Finished difference. Result has 52 places, 26 transitions, 139 flow [2023-08-30 02:08:52,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=139, PETRI_PLACES=52, PETRI_TRANSITIONS=26} [2023-08-30 02:08:52,897 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2023-08-30 02:08:52,897 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 26 transitions, 139 flow [2023-08-30 02:08:52,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 37.61290322580645) internal successors, (1166), 31 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have 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:08:52,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:08:52,898 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:08:52,905 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:08:53,103 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:08:53,103 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:08:53,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:08:53,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1793283018, now seen corresponding path program 5 times [2023-08-30 02:08:53,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:08:53,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974030092] [2023-08-30 02:08:53,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:08:53,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:08:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:08:53,118 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:08:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:08:53,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:08:53,173 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:08:53,175 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2023-08-30 02:08:53,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2023-08-30 02:08:53,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2023-08-30 02:08:53,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2023-08-30 02:08:53,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2023-08-30 02:08:53,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2023-08-30 02:08:53,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2023-08-30 02:08:53,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2023-08-30 02:08:53,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2023-08-30 02:08:53,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2023-08-30 02:08:53,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2023-08-30 02:08:53,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2023-08-30 02:08:53,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2023-08-30 02:08:53,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2023-08-30 02:08:53,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2023-08-30 02:08:53,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2023-08-30 02:08:53,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2023-08-30 02:08:53,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (8 of 26 remaining) [2023-08-30 02:08:53,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 26 remaining) [2023-08-30 02:08:53,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 26 remaining) [2023-08-30 02:08:53,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2023-08-30 02:08:53,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2023-08-30 02:08:53,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2023-08-30 02:08:53,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2023-08-30 02:08:53,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2023-08-30 02:08:53,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2023-08-30 02:08:53,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-30 02:08:53,180 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:08:53,184 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:08:53,184 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:08:53,192 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:08:53,192 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:08:53,192 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:08:53,192 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:08:53,193 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:08:53,193 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:08:53,193 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:08:53,193 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:08:53,193 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:08:53,193 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:08:53,195 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:08:53,195 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:08:53,195 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:08:53,195 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:08:53,195 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:08:53,195 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:08:53,196 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:08:53,196 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:08:53,196 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:08:53,196 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:08:53,196 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:08:53,197 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:08:53,197 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:08:53,197 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:08:53,197 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:08:53,197 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:08:53,197 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:08:53,198 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:08:53,198 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:08:53,198 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:08:53,198 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:08:53,198 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:08:53,198 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:08:53,199 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-30 02:08:53,199 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:08:53,199 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:08:53,199 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:08:53,199 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-30 02:08:53,199 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:08:53,199 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-30 02:08:53,200 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:08:53,200 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:08:53,200 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:08:53,200 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-30 02:08:53,200 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:08:53,200 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-30 02:08:53,200 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:08:53,201 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:08:53,201 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:08:53,201 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-30 02:08:53,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:08:53 BasicIcfg [2023-08-30 02:08:53,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:08:53,214 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:08:53,214 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:08:53,214 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:08:53,215 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:08:53,216 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:08:53,216 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:08:53,217 INFO L158 Benchmark]: Toolchain (without parser) took 155079.41ms. Allocated memory was 90.2MB in the beginning and 232.8MB in the end (delta: 142.6MB). Free memory was 65.6MB in the beginning and 88.0MB in the end (delta: -22.4MB). Peak memory consumption was 121.9MB. Max. memory is 16.1GB. [2023-08-30 02:08:53,217 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 71.3MB. Free memory is still 49.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:08:53,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.59ms. Allocated memory is still 90.2MB. Free memory was 65.4MB in the beginning and 53.0MB in the end (delta: 12.4MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2023-08-30 02:08:53,217 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.40ms. Allocated memory is still 90.2MB. Free memory was 53.0MB in the beginning and 50.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:08:53,217 INFO L158 Benchmark]: Boogie Preprocessor took 34.39ms. Allocated memory is still 90.2MB. Free memory was 50.5MB in the beginning and 49.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:08:53,217 INFO L158 Benchmark]: RCFGBuilder took 419.26ms. Allocated memory is still 90.2MB. Free memory was 48.7MB in the beginning and 57.3MB in the end (delta: -8.6MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2023-08-30 02:08:53,218 INFO L158 Benchmark]: TraceAbstraction took 154053.45ms. Allocated memory was 90.2MB in the beginning and 232.8MB in the end (delta: 142.6MB). Free memory was 56.9MB in the beginning and 89.0MB in the end (delta: -32.2MB). Peak memory consumption was 110.2MB. Max. memory is 16.1GB. [2023-08-30 02:08:53,218 INFO L158 Benchmark]: Witness Printer took 2.16ms. Allocated memory is still 232.8MB. Free memory was 89.0MB in the beginning and 88.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:08:53,218 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.72ms. Allocated memory is still 71.3MB. Free memory is still 49.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 524.59ms. Allocated memory is still 90.2MB. Free memory was 65.4MB in the beginning and 53.0MB in the end (delta: 12.4MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.40ms. Allocated memory is still 90.2MB. Free memory was 53.0MB in the beginning and 50.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.39ms. Allocated memory is still 90.2MB. Free memory was 50.5MB in the beginning and 49.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 419.26ms. Allocated memory is still 90.2MB. Free memory was 48.7MB in the beginning and 57.3MB in the end (delta: -8.6MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * TraceAbstraction took 154053.45ms. Allocated memory was 90.2MB in the beginning and 232.8MB in the end (delta: 142.6MB). Free memory was 56.9MB in the beginning and 89.0MB in the end (delta: -32.2MB). Peak memory consumption was 110.2MB. Max. memory is 16.1GB. * Witness Printer took 2.16ms. Allocated memory is still 232.8MB. Free memory was 89.0MB in the beginning and 88.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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_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_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_#res#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_#res#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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 103 PlacesBefore, 36 PlacesAfterwards, 100 TransitionsBefore, 31 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 6 FixpointIterations, 62 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 115 TotalNumberOfCompositions, 458 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 355, independent: 330, independent conditional: 0, independent unconditional: 330, 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: 183, independent: 172, independent conditional: 0, independent unconditional: 172, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 355, independent: 158, independent conditional: 0, independent unconditional: 158, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 183, unknown conditional: 0, unknown unconditional: 183] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 10, Positive conditional cache size: 0, Positive unconditional cache size: 10, 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)=-2, t1={15:0}, t2={16:0}, v={0:0}] [L1123] 0 \read(t1) VAL [\read(t1)=-2, arg={0:0}, t1={15:0}, t2={16: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)=-2, \result={0:0}, arg={0:0}, arg={0:0}, t1={15:0}, t2={16: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)=-1, t1={15:0}, t2={16:0}, v={9:0}] [L1125] 0 \read(t2) VAL [\read(t2)=-1, \result={0:0}, arg={0:0}, arg={0:0}, t1={15:0}, t2={16: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)=-1, \result={0:0}, arg={0:0}, arg={0:0}, t1={15:0}, t2={16:0}, v={9:0}] [L1126] EXPR 0 v[0] [L1126] CALL 0 __VERIFIER_assert(v[0] == 'B') [L1107] COND FALSE 0 !(!expression) [L1126] RET 0 __VERIFIER_assert(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, 138 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: 153.9s, OverallIterations: 25, TraceHistogramMax: 8, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 122.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 193 mSolverCounterUnknown, 6010 SdHoareTripleChecker+Valid, 113.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4811 mSDsluCounter, 9363 SdHoareTripleChecker+Invalid, 111.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 493 IncrementalHoareTripleChecker+Unchecked, 9212 mSDsCounter, 489 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22680 IncrementalHoareTripleChecker+Invalid, 23855 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 489 mSolverCounterUnsat, 151 mSDtfsCounter, 22680 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 518 GetRequests, 156 SyntacticMatches, 8 SemanticMatches, 354 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1231 ImplicationChecksByTransitivity, 25.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241occurred in iteration=19, InterpolantAutomatonStates: 159, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 23.9s InterpolantComputationTime, 429 NumberOfCodeBlocks, 424 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 509 ConstructedInterpolants, 111 QuantifiedInterpolants, 8726 SizeOfPredicates, 77 NumberOfNonLiveVariables, 2604 ConjunctsInSsa, 418 ConjunctsInUnsatCore, 45 InterpolantComputations, 14 PerfectInterpolantSequences, 34/357 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:08:53,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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_s2.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 fa644cc26c2bb4f900e6af52233648196eb4dff503d36a50559ddcf2a4270ffb --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:08:55,019 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:08:55,021 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:08:55,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:08:55,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:08:55,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:08:55,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:08:55,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:08:55,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:08:55,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:08:55,067 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:08:55,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:08:55,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:08:55,071 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:08:55,073 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:08:55,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:08:55,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:08:55,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:08:55,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:08:55,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:08:55,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:08:55,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:08:55,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:08:55,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:08:55,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:08:55,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:08:55,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:08:55,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:08:55,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:08:55,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:08:55,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:08:55,104 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:08:55,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:08:55,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:08:55,106 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:08:55,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:08:55,107 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:08:55,108 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:08:55,108 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:08:55,108 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:08:55,109 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:08:55,110 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:08:55,130 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:08:55,138 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:08:55,139 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:08:55,139 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:08:55,140 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:08:55,140 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:08:55,141 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:08:55,141 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:08:55,141 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:08:55,141 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:08:55,142 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:08:55,142 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:08:55,142 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:08:55,142 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:08:55,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:08:55,143 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:08:55,143 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:08:55,143 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:08:55,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:08:55,143 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:08:55,143 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 02:08:55,143 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 02:08:55,144 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:08:55,144 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:08:55,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:08:55,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:08:55,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:08:55,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:08:55,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:08:55,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:08:55,145 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 02:08:55,145 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 02:08:55,145 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:08:55,145 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:08:55,145 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:08:55,146 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 02:08:55,146 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:08:55,146 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 -> fa644cc26c2bb4f900e6af52233648196eb4dff503d36a50559ddcf2a4270ffb 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:08:55,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:08:55,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:08:55,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:08:55,444 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:08:55,444 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:08:55,445 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/bigshot_s2.i [2023-08-30 02:08:56,529 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:08:56,825 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:08:56,829 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s2.i [2023-08-30 02:08:56,847 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3a351f6/729acdce1841429f86567cc4b368dd5f/FLAG27ed6db43 [2023-08-30 02:08:56,865 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3a351f6/729acdce1841429f86567cc4b368dd5f [2023-08-30 02:08:56,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:08:56,868 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:08:56,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:08:56,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:08:56,872 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:08:56,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:08:56" (1/1) ... [2023-08-30 02:08:56,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@180371b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:08:56, skipping insertion in model container [2023-08-30 02:08:56,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:08:56" (1/1) ... [2023-08-30 02:08:56,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:08:56,920 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:08:57,307 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_s2.i[55203,55216] [2023-08-30 02:08:57,323 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:08:57,339 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:08:57,371 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_s2.i[55203,55216] [2023-08-30 02:08:57,375 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:08:57,440 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:08:57,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:08:57 WrapperNode [2023-08-30 02:08:57,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:08:57,441 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:08:57,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:08:57,442 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:08:57,446 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:08:57" (1/1) ... [2023-08-30 02:08:57,471 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:08:57" (1/1) ... [2023-08-30 02:08:57,498 INFO L138 Inliner]: procedures = 327, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2023-08-30 02:08:57,498 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:08:57,499 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:08:57,499 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:08:57,500 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:08:57,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:08:57" (1/1) ... [2023-08-30 02:08:57,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:08:57" (1/1) ... [2023-08-30 02:08:57,515 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:08:57" (1/1) ... [2023-08-30 02:08:57,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:08:57" (1/1) ... [2023-08-30 02:08:57,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:08:57" (1/1) ... [2023-08-30 02:08:57,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:08:57" (1/1) ... [2023-08-30 02:08:57,535 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:08:57" (1/1) ... [2023-08-30 02:08:57,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:08:57" (1/1) ... [2023-08-30 02:08:57,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:08:57,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:08:57,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:08:57,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:08:57,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:08:57" (1/1) ... [2023-08-30 02:08:57,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:08:57,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:08:57,581 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:08:57,589 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:08:57,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-08-30 02:08:57,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-30 02:08:57,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:08:57,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:08:57,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 02:08:57,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 02:08:57,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-30 02:08:57,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-30 02:08:57,619 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-30 02:08:57,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-30 02:08:57,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2023-08-30 02:08:57,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-30 02:08:57,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:08:57,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:08:57,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:08:57,621 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:08:57,787 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:08:57,788 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:08:58,042 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:08:58,049 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:08:58,050 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-08-30 02:08:58,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:08:58 BoogieIcfgContainer [2023-08-30 02:08:58,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:08:58,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:08:58,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:08:58,056 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:08:58,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:08:56" (1/3) ... [2023-08-30 02:08:58,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3863ebb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:08:58, skipping insertion in model container [2023-08-30 02:08:58,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:08:57" (2/3) ... [2023-08-30 02:08:58,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3863ebb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:08:58, skipping insertion in model container [2023-08-30 02:08:58,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:08:58" (3/3) ... [2023-08-30 02:08:58,058 INFO L112 eAbstractionObserver]: Analyzing ICFG bigshot_s2.i [2023-08-30 02:08:58,068 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:08:58,068 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-08-30 02:08:58,068 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:08:58,164 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-30 02:08:58,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 107 transitions, 230 flow [2023-08-30 02:08:58,243 INFO L130 PetriNetUnfolder]: 4/105 cut-off events. [2023-08-30 02:08:58,244 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 02:08:58,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 105 events. 4/105 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 125 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-08-30 02:08:58,248 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 107 transitions, 230 flow [2023-08-30 02:08:58,253 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 101 transitions, 214 flow [2023-08-30 02:08:58,256 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:08:58,269 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 101 transitions, 214 flow [2023-08-30 02:08:58,272 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 101 transitions, 214 flow [2023-08-30 02:08:58,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 101 transitions, 214 flow [2023-08-30 02:08:58,301 INFO L130 PetriNetUnfolder]: 4/101 cut-off events. [2023-08-30 02:08:58,301 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 02:08:58,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 101 events. 4/101 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 124 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2023-08-30 02:08:58,302 INFO L119 LiptonReduction]: Number of co-enabled transitions 340 [2023-08-30 02:09:04,380 INFO L134 LiptonReduction]: Checked pairs total: 458 [2023-08-30 02:09:04,380 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-30 02:09:04,401 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:09:04,407 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;@4d8b6952, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:09:04,408 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-08-30 02:09:04,409 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:09:04,409 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:09:04,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:09:04,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:09:04,411 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:09:04,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:09:04,416 INFO L85 PathProgramCache]: Analyzing trace with hash 410, now seen corresponding path program 1 times [2023-08-30 02:09:04,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:09:04,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031872014] [2023-08-30 02:09:04,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:09:04,429 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:09:04,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:09:04,434 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:09:04,435 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:09:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:09:04,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 02:09:04,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:09:04,490 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:09:04,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:09:04,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:09:04,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031872014] [2023-08-30 02:09:04,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031872014] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:09:04,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:09:04,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:09:04,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831711292] [2023-08-30 02:09:04,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:09:04,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:09:04,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:09:04,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:09:04,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:09:04,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 219 [2023-08-30 02:09:04,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have 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:09:04,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:09:04,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 219 [2023-08-30 02:09:04,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:09:04,608 INFO L130 PetriNetUnfolder]: 26/72 cut-off events. [2023-08-30 02:09:04,608 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 02:09:04,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 72 events. 26/72 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 212 event pairs, 18 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 117. Up to 69 conditions per place. [2023-08-30 02:09:04,609 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 26 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-08-30 02:09:04,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 118 flow [2023-08-30 02:09:04,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:09:04,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:09:04,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 230 transitions. [2023-08-30 02:09:04,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5251141552511416 [2023-08-30 02:09:04,620 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 230 transitions. [2023-08-30 02:09:04,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 230 transitions. [2023-08-30 02:09:04,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:09:04,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 230 transitions. [2023-08-30 02:09:04,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 115.0) internal successors, (230), 2 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have 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:09:04,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have 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:09:04,630 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have 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:09:04,631 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 74 flow. Second operand 2 states and 230 transitions. [2023-08-30 02:09:04,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 118 flow [2023-08-30 02:09:04,633 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:09:04,634 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 58 flow [2023-08-30 02:09:04,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, 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:09:04,637 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -7 predicate places. [2023-08-30 02:09:04,640 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 58 flow [2023-08-30 02:09:04,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have 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:09:04,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:09:04,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:09:04,665 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:09:04,847 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:09:04,847 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:09:04,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:09:04,848 INFO L85 PathProgramCache]: Analyzing trace with hash 403585, now seen corresponding path program 1 times [2023-08-30 02:09:04,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:09:04,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009608566] [2023-08-30 02:09:04,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:09:04,849 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:09:04,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:09:04,855 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:09:04,858 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:09:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:09:04,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:09:04,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:09:04,965 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-30 02:09:04,966 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:09:04,984 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:09:04,985 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:09:04,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:09:04,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009608566] [2023-08-30 02:09:04,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009608566] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:09:04,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:09:04,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:09:04,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857818625] [2023-08-30 02:09:04,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:09:04,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:09:04,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:09:04,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:09:04,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:09:05,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2023-08-30 02:09:05,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have 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:09:05,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:09:05,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2023-08-30 02:09:05,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:09:05,147 INFO L130 PetriNetUnfolder]: 25/69 cut-off events. [2023-08-30 02:09:05,147 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:09:05,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 69 events. 25/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 202 event pairs, 17 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 136. Up to 64 conditions per place. [2023-08-30 02:09:05,148 INFO L137 encePairwiseOnDemand]: 216/219 looper letters, 23 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2023-08-30 02:09:05,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 106 flow [2023-08-30 02:09:05,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:09:05,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:09:05,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2023-08-30 02:09:05,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4550989345509893 [2023-08-30 02:09:05,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 299 transitions. [2023-08-30 02:09:05,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 299 transitions. [2023-08-30 02:09:05,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:09:05,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 299 transitions. [2023-08-30 02:09:05,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:09:05,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 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:09:05,155 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 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:09:05,155 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 58 flow. Second operand 3 states and 299 transitions. [2023-08-30 02:09:05,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 106 flow [2023-08-30 02:09:05,155 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:09:05,156 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 60 flow [2023-08-30 02:09:05,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, 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:09:05,157 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-30 02:09:05,157 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 60 flow [2023-08-30 02:09:05,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have 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:09:05,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:09:05,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:09:05,179 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:09:05,379 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:09:05,380 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:09:05,380 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:09:05,380 INFO L85 PathProgramCache]: Analyzing trace with hash 403586, now seen corresponding path program 1 times [2023-08-30 02:09:05,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:09:05,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998332523] [2023-08-30 02:09:05,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:09:05,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:09:05,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:09:05,389 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:09:05,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 (4)] Waiting until timeout for monitored process [2023-08-30 02:09:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:09:05,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:09:05,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:09:05,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:09:05,447 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:09:05,457 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:09:05,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:09:05,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:09:05,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:09:05,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998332523] [2023-08-30 02:09:05,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998332523] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:09:05,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:09:05,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:09:05,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170268013] [2023-08-30 02:09:05,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:09:05,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:09:05,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:09:05,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:09:05,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:09:05,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 219 [2023-08-30 02:09:05,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have 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:09:05,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:09:05,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 219 [2023-08-30 02:09:05,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:09:05,627 INFO L130 PetriNetUnfolder]: 24/67 cut-off events. [2023-08-30 02:09:05,628 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:09:05,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 67 events. 24/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 198 event pairs, 15 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 134. Up to 61 conditions per place. [2023-08-30 02:09:05,628 INFO L137 encePairwiseOnDemand]: 216/219 looper letters, 24 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2023-08-30 02:09:05,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 114 flow [2023-08-30 02:09:05,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:09:05,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:09:05,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2023-08-30 02:09:05,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4703196347031963 [2023-08-30 02:09:05,631 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2023-08-30 02:09:05,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2023-08-30 02:09:05,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:09:05,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2023-08-30 02:09:05,632 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:09:05,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 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:09:05,633 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 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:09:05,634 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 60 flow. Second operand 3 states and 309 transitions. [2023-08-30 02:09:05,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 114 flow [2023-08-30 02:09:05,634 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:09:05,635 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 64 flow [2023-08-30 02:09:05,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, 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:09:05,635 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2023-08-30 02:09:05,635 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 64 flow [2023-08-30 02:09:05,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have 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:09:05,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:09:05,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-30 02:09:05,661 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:09:05,864 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:09:05,864 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:09:05,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:09:05,865 INFO L85 PathProgramCache]: Analyzing trace with hash 12512186, now seen corresponding path program 1 times [2023-08-30 02:09:05,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:09:05,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988062136] [2023-08-30 02:09:05,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:09:05,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:09:05,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:09:05,885 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:09:05,902 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:09:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:09:05,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-30 02:09:05,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:09:05,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:09:05,978 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:09:05,981 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:09:06,017 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 02:09:06,018 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:09:06,054 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:09:06,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:09:06,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:09:06,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [988062136] [2023-08-30 02:09:06,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [988062136] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:09:06,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:09:06,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:09:06,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920563839] [2023-08-30 02:09:06,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:09:06,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:09:06,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:09:06,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:09:06,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:09:06,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 219 [2023-08-30 02:09:06,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have 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:09:06,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:09:06,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 219 [2023-08-30 02:09:06,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:09:06,411 INFO L130 PetriNetUnfolder]: 24/66 cut-off events. [2023-08-30 02:09:06,411 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 02:09:06,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 66 events. 24/66 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 194 event pairs, 15 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 135. Up to 58 conditions per place. [2023-08-30 02:09:06,412 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 22 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2023-08-30 02:09:06,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 26 transitions, 112 flow [2023-08-30 02:09:06,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:09:06,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:09:06,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 394 transitions. [2023-08-30 02:09:06,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497716894977169 [2023-08-30 02:09:06,413 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 394 transitions. [2023-08-30 02:09:06,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 394 transitions. [2023-08-30 02:09:06,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:09:06,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 394 transitions. [2023-08-30 02:09:06,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have 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:09:06,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have 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:09:06,417 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have 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:09:06,417 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 64 flow. Second operand 4 states and 394 transitions. [2023-08-30 02:09:06,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 26 transitions, 112 flow [2023-08-30 02:09:06,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:09:06,418 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 60 flow [2023-08-30 02:09:06,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=54, 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=4, PETRI_FLOW=60, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2023-08-30 02:09:06,418 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-30 02:09:06,418 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 60 flow [2023-08-30 02:09:06,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have 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:09:06,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:09:06,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 02:09:06,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-08-30 02:09:06,625 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:09:06,625 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:09:06,626 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:09:06,626 INFO L85 PathProgramCache]: Analyzing trace with hash -861376330, now seen corresponding path program 1 times [2023-08-30 02:09:06,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:09:06,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748751498] [2023-08-30 02:09:06,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:09:06,626 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:09:06,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:09:06,627 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:09:06,629 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:09:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:09:06,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:09:06,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:09:06,693 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-30 02:09:06,693 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:09:06,710 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-30 02:09:06,710 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:09:06,717 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:09:06,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:09:06,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:09:06,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748751498] [2023-08-30 02:09:06,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748751498] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:09:06,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:09:06,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:09:06,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156576734] [2023-08-30 02:09:06,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:09:06,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:09:06,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:09:06,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:09:06,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:09:06,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2023-08-30 02:09:06,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have 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:09:06,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:09:06,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2023-08-30 02:09:06,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:09:06,825 INFO L130 PetriNetUnfolder]: 17/51 cut-off events. [2023-08-30 02:09:06,826 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 02:09:06,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 51 events. 17/51 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 134 event pairs, 11 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 105. Up to 47 conditions per place. [2023-08-30 02:09:06,826 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 20 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2023-08-30 02:09:06,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 100 flow [2023-08-30 02:09:06,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:09:06,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:09:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2023-08-30 02:09:06,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4520547945205479 [2023-08-30 02:09:06,827 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 297 transitions. [2023-08-30 02:09:06,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 297 transitions. [2023-08-30 02:09:06,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:09:06,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 297 transitions. [2023-08-30 02:09:06,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:09:06,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 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:09:06,829 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 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:09:06,830 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 60 flow. Second operand 3 states and 297 transitions. [2023-08-30 02:09:06,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 100 flow [2023-08-30 02:09:06,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:09:06,830 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 54 flow [2023-08-30 02:09:06,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, 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:09:06,831 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -9 predicate places. [2023-08-30 02:09:06,831 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 54 flow [2023-08-30 02:09:06,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have 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:09:06,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:09:06,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 02:09:06,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-08-30 02:09:07,038 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:09:07,038 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:09:07,039 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:09:07,039 INFO L85 PathProgramCache]: Analyzing trace with hash -861376329, now seen corresponding path program 1 times [2023-08-30 02:09:07,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:09:07,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255176794] [2023-08-30 02:09:07,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:09:07,039 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:09:07,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:09:07,040 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:09:07,043 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:09:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:09:07,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 02:09:07,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:09:07,159 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-30 02:09:07,159 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:09:07,174 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 02:09:07,174 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:09:07,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:09:07,212 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:09:07,219 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-08-30 02:09:07,219 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:09:07,236 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:09:07,236 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:09:07,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:09:07,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255176794] [2023-08-30 02:09:07,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255176794] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:09:07,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:09:07,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:09:07,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085062162] [2023-08-30 02:09:07,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:09:07,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:09:07,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:09:07,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:09:07,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:09:07,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 219 [2023-08-30 02:09:07,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have 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:09:07,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:09:07,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 219 [2023-08-30 02:09:07,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:09:07,457 INFO L130 PetriNetUnfolder]: 10/36 cut-off events. [2023-08-30 02:09:07,457 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:09:07,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 36 events. 10/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 66 event pairs, 6 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 74. Up to 33 conditions per place. [2023-08-30 02:09:07,458 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 18 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2023-08-30 02:09:07,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 21 transitions, 90 flow [2023-08-30 02:09:07,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:09:07,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:09:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2023-08-30 02:09:07,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4353120243531202 [2023-08-30 02:09:07,461 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 286 transitions. [2023-08-30 02:09:07,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 286 transitions. [2023-08-30 02:09:07,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:09:07,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 286 transitions. [2023-08-30 02:09:07,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have 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:09:07,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 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:09:07,463 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 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:09:07,463 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 54 flow. Second operand 3 states and 286 transitions. [2023-08-30 02:09:07,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 21 transitions, 90 flow [2023-08-30 02:09:07,464 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:09:07,464 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 50 flow [2023-08-30 02:09:07,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, 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:09:07,464 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -11 predicate places. [2023-08-30 02:09:07,465 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 50 flow [2023-08-30 02:09:07,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have 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:09:07,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:09:07,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:09:07,474 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:09:07,665 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:09:07,666 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:09:07,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:09:07,666 INFO L85 PathProgramCache]: Analyzing trace with hash 305735059, now seen corresponding path program 1 times [2023-08-30 02:09:07,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:09:07,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278289319] [2023-08-30 02:09:07,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:09:07,666 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:09:07,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:09:07,667 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:09:07,670 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:09:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:09:07,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 02:09:07,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:09:07,811 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-08-30 02:09:07,811 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:09:07,845 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-30 02:09:07,845 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:09:07,919 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:09:07,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:09:07,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:09:07,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278289319] [2023-08-30 02:09:07,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278289319] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:09:07,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:09:07,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:09:07,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557449015] [2023-08-30 02:09:07,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:09:07,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:09:07,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:09:07,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:09:07,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:09:08,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 219 [2023-08-30 02:09:08,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 50 flow. Second operand has 6 states, 6 states have (on average 80.5) internal successors, (483), 6 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have 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:09:08,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:09:08,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 219 [2023-08-30 02:09:08,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:09:08,154 INFO L130 PetriNetUnfolder]: 10/40 cut-off events. [2023-08-30 02:09:08,154 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:09:08,154 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 87 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:09:08,154 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 22 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2023-08-30 02:09:08,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 115 flow [2023-08-30 02:09:08,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:09:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:09:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 343 transitions. [2023-08-30 02:09:08,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3915525114155251 [2023-08-30 02:09:08,156 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 343 transitions. [2023-08-30 02:09:08,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 343 transitions. [2023-08-30 02:09:08,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:09:08,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 343 transitions. [2023-08-30 02:09:08,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have 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:09:08,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have 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:09:08,158 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have 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:09:08,158 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 50 flow. Second operand 4 states and 343 transitions. [2023-08-30 02:09:08,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 115 flow [2023-08-30 02:09:08,158 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:09:08,159 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 54 flow [2023-08-30 02:09:08,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, 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:09:08,159 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -11 predicate places. [2023-08-30 02:09:08,159 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 54 flow [2023-08-30 02:09:08,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.5) internal successors, (483), 6 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have 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:09:08,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:09:08,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:09:08,173 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:09:08,361 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:09:08,361 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:09:08,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:09:08,361 INFO L85 PathProgramCache]: Analyzing trace with hash 305735143, now seen corresponding path program 1 times [2023-08-30 02:09:08,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:09:08,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844585613] [2023-08-30 02:09:08,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:09:08,362 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:09:08,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:09:08,363 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:09:08,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-30 02:09:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:09:08,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 02:09:08,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:09:08,444 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:09:08,479 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:09:08,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:09:08,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:09:08,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844585613] [2023-08-30 02:09:08,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844585613] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:09:08,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:09:08,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:09:08,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217955064] [2023-08-30 02:09:08,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:09:08,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:09:08,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:09:08,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:09:08,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:09:08,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2023-08-30 02:09:08,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have 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:09:08,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:09:08,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2023-08-30 02:09:08,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:09:08,769 INFO L130 PetriNetUnfolder]: 14/54 cut-off events. [2023-08-30 02:09:08,770 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 02:09:08,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 54 events. 14/54 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 147 event pairs, 6 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 116. Up to 35 conditions per place. [2023-08-30 02:09:08,770 INFO L137 encePairwiseOnDemand]: 214/219 looper letters, 27 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2023-08-30 02:09:08,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 30 transitions, 135 flow [2023-08-30 02:09:08,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:09:08,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:09:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 396 transitions. [2023-08-30 02:09:08,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4520547945205479 [2023-08-30 02:09:08,772 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 396 transitions. [2023-08-30 02:09:08,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 396 transitions. [2023-08-30 02:09:08,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:09:08,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 396 transitions. [2023-08-30 02:09:08,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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:09:08,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have 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:09:08,774 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have 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:09:08,774 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 54 flow. Second operand 4 states and 396 transitions. [2023-08-30 02:09:08,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 30 transitions, 135 flow [2023-08-30 02:09:08,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 30 transitions, 131 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:09:08,775 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 63 flow [2023-08-30 02:09:08,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=63, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2023-08-30 02:09:08,777 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -9 predicate places. [2023-08-30 02:09:08,777 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 63 flow [2023-08-30 02:09:08,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have 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:09:08,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:09:08,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:09:08,800 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:09:08,985 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:09:08,985 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:09:08,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:09:08,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1167582902, now seen corresponding path program 1 times [2023-08-30 02:09:08,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:09:08,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162381226] [2023-08-30 02:09:08,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:09:08,989 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:09:08,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:09:08,990 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:09:08,993 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:09:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:09:09,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 02:09:09,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:09:09,054 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:09:09,066 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:09:09,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:09:09,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:09:09,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162381226] [2023-08-30 02:09:09,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162381226] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:09:09,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:09:09,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:09:09,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039708249] [2023-08-30 02:09:09,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:09:09,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:09:09,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:09:09,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:09:09,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:09:09,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2023-08-30 02:09:09,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 63 flow. Second operand has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have 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:09:09,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:09:09,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2023-08-30 02:09:09,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:09:09,262 INFO L130 PetriNetUnfolder]: 12/45 cut-off events. [2023-08-30 02:09:09,263 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-08-30 02:09:09,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 45 events. 12/45 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 112 event pairs, 1 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 107. Up to 27 conditions per place. [2023-08-30 02:09:09,263 INFO L137 encePairwiseOnDemand]: 214/219 looper letters, 19 selfloop transitions, 4 changer transitions 0/23 dead transitions. [2023-08-30 02:09:09,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 23 transitions, 114 flow [2023-08-30 02:09:09,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:09:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:09:09,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 389 transitions. [2023-08-30 02:09:09,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4440639269406393 [2023-08-30 02:09:09,265 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 389 transitions. [2023-08-30 02:09:09,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 389 transitions. [2023-08-30 02:09:09,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:09:09,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 389 transitions. [2023-08-30 02:09:09,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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:09:09,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have 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:09:09,267 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have 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:09:09,267 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 63 flow. Second operand 4 states and 389 transitions. [2023-08-30 02:09:09,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 23 transitions, 114 flow [2023-08-30 02:09:09,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 23 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:09:09,267 INFO L231 Difference]: Finished difference. Result has 26 places, 19 transitions, 63 flow [2023-08-30 02:09:09,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=23, 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=63, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2023-08-30 02:09:09,268 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -10 predicate places. [2023-08-30 02:09:09,268 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 63 flow [2023-08-30 02:09:09,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have 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:09:09,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:09:09,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:09:09,290 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:09:09,469 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:09:09,469 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:09:09,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:09:09,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1167582855, now seen corresponding path program 1 times [2023-08-30 02:09:09,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:09:09,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958153830] [2023-08-30 02:09:09,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:09:09,470 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:09:09,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:09:09,471 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:09:09,473 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:09:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:09:09,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-30 02:09:09,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:09:09,577 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2023-08-30 02:09:09,578 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:09:09,605 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-08-30 02:09:09,605 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:09:09,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:09:09,722 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-30 02:09:09,722 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:09:09,750 INFO L321 Elim1Store]: treesize reduction 6, result has 80.6 percent of original size [2023-08-30 02:09:09,751 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:09:09,884 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:09:09,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:09:09,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:09:09,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958153830] [2023-08-30 02:09:09,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958153830] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:09:09,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:09:09,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:09:09,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552522669] [2023-08-30 02:09:09,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:09:09,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:09:09,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:09:09,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:09:09,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:09:10,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2023-08-30 02:09:10,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 63 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have 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:09:10,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:09:10,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2023-08-30 02:09:10,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:09:10,376 INFO L130 PetriNetUnfolder]: 11/42 cut-off events. [2023-08-30 02:09:10,376 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-08-30 02:09:10,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 42 events. 11/42 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 100 event pairs, 5 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 104. Up to 28 conditions per place. [2023-08-30 02:09:10,377 INFO L137 encePairwiseOnDemand]: 213/219 looper letters, 18 selfloop transitions, 7 changer transitions 0/25 dead transitions. [2023-08-30 02:09:10,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 129 flow [2023-08-30 02:09:10,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:09:10,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:09:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 662 transitions. [2023-08-30 02:09:10,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318330071754729 [2023-08-30 02:09:10,378 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 662 transitions. [2023-08-30 02:09:10,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 662 transitions. [2023-08-30 02:09:10,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:09:10,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 662 transitions. [2023-08-30 02:09:10,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.57142857142857) internal successors, (662), 7 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have 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:09:10,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have 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:09:10,382 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have 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:09:10,382 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 63 flow. Second operand 7 states and 662 transitions. [2023-08-30 02:09:10,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 129 flow [2023-08-30 02:09:10,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 119 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:09:10,382 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 77 flow [2023-08-30 02:09:10,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=77, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-08-30 02:09:10,383 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-30 02:09:10,383 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 77 flow [2023-08-30 02:09:10,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have 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:09:10,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:09:10,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:09:10,392 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:09:10,583 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:09:10,584 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:09:10,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:09:10,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1835333102, now seen corresponding path program 1 times [2023-08-30 02:09:10,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:09:10,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653343882] [2023-08-30 02:09:10,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:09:10,585 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:09:10,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:09:10,585 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:09:10,586 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:09:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:09:10,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 02:09:10,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:09:10,647 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:09:10,687 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:09:10,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:09:10,740 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:09:10,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:09:10,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653343882] [2023-08-30 02:09:10,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653343882] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:09:10,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 02:09:10,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-08-30 02:09:10,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380638906] [2023-08-30 02:09:10,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 02:09:10,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:09:10,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:09:10,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:09:10,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:09:11,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 219 [2023-08-30 02:09:11,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 77 flow. Second operand has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have 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:09:11,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:09:11,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 219 [2023-08-30 02:09:11,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:09:11,467 INFO L130 PetriNetUnfolder]: 20/74 cut-off events. [2023-08-30 02:09:11,467 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2023-08-30 02:09:11,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 74 events. 20/74 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 243 event pairs, 4 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 191. Up to 24 conditions per place. [2023-08-30 02:09:11,467 INFO L137 encePairwiseOnDemand]: 214/219 looper letters, 38 selfloop transitions, 7 changer transitions 0/45 dead transitions. [2023-08-30 02:09:11,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 239 flow [2023-08-30 02:09:11,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:09:11,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:09:11,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 664 transitions. [2023-08-30 02:09:11,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43313763861709065 [2023-08-30 02:09:11,470 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 664 transitions. [2023-08-30 02:09:11,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 664 transitions. [2023-08-30 02:09:11,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:09:11,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 664 transitions. [2023-08-30 02:09:11,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.85714285714286) internal successors, (664), 7 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have 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:09:11,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have 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:09:11,473 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have 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:09:11,473 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 77 flow. Second operand 7 states and 664 transitions. [2023-08-30 02:09:11,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 45 transitions, 239 flow [2023-08-30 02:09:11,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 45 transitions, 234 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:09:11,474 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 121 flow [2023-08-30 02:09:11,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=121, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2023-08-30 02:09:11,475 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2023-08-30 02:09:11,475 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 121 flow [2023-08-30 02:09:11,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have 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:09:11,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:09:11,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:09:11,493 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:09:11,683 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:09:11,684 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:09:11,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:09:11,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1835333054, now seen corresponding path program 1 times [2023-08-30 02:09:11,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:09:11,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2068936324] [2023-08-30 02:09:11,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:09:11,685 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:09:11,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:09:11,686 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:09:11,688 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:09:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:09:11,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-30 02:09:11,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:09:11,793 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2023-08-30 02:09:11,793 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:09:11,818 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-08-30 02:09:11,818 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:09:11,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:09:11,908 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-30 02:09:11,908 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:09:11,945 INFO L321 Elim1Store]: treesize reduction 6, result has 80.6 percent of original size [2023-08-30 02:09:11,946 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:09:12,165 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:09:12,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:09:12,290 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:09:12,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:09:12,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2068936324] [2023-08-30 02:09:12,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2068936324] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:09:12,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 02:09:12,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2023-08-30 02:09:12,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612904380] [2023-08-30 02:09:12,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 02:09:12,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 02:09:12,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:09:12,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 02:09:12,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-30 02:09:14,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:09:16,447 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:09:18,569 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:09:21,064 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:09:23,089 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:09:25,649 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:09:27,666 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:09:29,756 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:09:31,776 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:09:33,882 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:09:35,902 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:09:38,100 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:09:40,142 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:09:42,171 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:09:44,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:09:46,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:09:46,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 219 [2023-08-30 02:09:46,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 121 flow. Second operand has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 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:09:46,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:09:46,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 219 [2023-08-30 02:09:46,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:09:47,151 INFO L130 PetriNetUnfolder]: 17/65 cut-off events. [2023-08-30 02:09:47,151 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-30 02:09:47,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 65 events. 17/65 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 3 based on Foata normal form. 6/71 useless extension candidates. Maximal degree in co-relation 204. Up to 20 conditions per place. [2023-08-30 02:09:47,152 INFO L137 encePairwiseOnDemand]: 211/219 looper letters, 28 selfloop transitions, 14 changer transitions 0/42 dead transitions. [2023-08-30 02:09:47,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 257 flow [2023-08-30 02:09:47,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-30 02:09:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-30 02:09:47,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 890 transitions. [2023-08-30 02:09:47,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3126097646645592 [2023-08-30 02:09:47,155 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 890 transitions. [2023-08-30 02:09:47,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 890 transitions. [2023-08-30 02:09:47,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:09:47,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 890 transitions. [2023-08-30 02:09:47,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 68.46153846153847) internal successors, (890), 13 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have 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:09:47,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 219.0) internal successors, (3066), 14 states have internal predecessors, (3066), 0 states have call successors, (0), 0 states have 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:09:47,159 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 219.0) internal successors, (3066), 14 states have internal predecessors, (3066), 0 states have call successors, (0), 0 states have 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:09:47,159 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 121 flow. Second operand 13 states and 890 transitions. [2023-08-30 02:09:47,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 257 flow [2023-08-30 02:09:47,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 248 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-30 02:09:47,161 INFO L231 Difference]: Finished difference. Result has 50 places, 26 transitions, 167 flow [2023-08-30 02:09:47,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=167, PETRI_PLACES=50, PETRI_TRANSITIONS=26} [2023-08-30 02:09:47,161 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2023-08-30 02:09:47,161 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 26 transitions, 167 flow [2023-08-30 02:09:47,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 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:09:47,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:09:47,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:09:47,169 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:09:47,369 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:09:47,369 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:09:47,369 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:09:47,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1060197226, now seen corresponding path program 1 times [2023-08-30 02:09:47,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:09:47,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423165028] [2023-08-30 02:09:47,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:09:47,369 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:09:47,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:09:47,370 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:09:47,372 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:09:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:09:47,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-30 02:09:47,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:09:47,436 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:09:47,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:09:47,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:09:47,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423165028] [2023-08-30 02:09:47,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423165028] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:09:47,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:09:47,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:09:47,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090948897] [2023-08-30 02:09:47,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:09:47,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:09:47,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:09:47,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:09:47,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:09:47,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 219 [2023-08-30 02:09:47,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 26 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have 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:09:47,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:09:47,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 219 [2023-08-30 02:09:47,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:09:47,507 INFO L130 PetriNetUnfolder]: 16/59 cut-off events. [2023-08-30 02:09:47,507 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2023-08-30 02:09:47,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 59 events. 16/59 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 146 event pairs, 11 based on Foata normal form. 2/61 useless extension candidates. Maximal degree in co-relation 219. Up to 56 conditions per place. [2023-08-30 02:09:47,508 INFO L137 encePairwiseOnDemand]: 217/219 looper letters, 24 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2023-08-30 02:09:47,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 25 transitions, 210 flow [2023-08-30 02:09:47,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:09:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:09:47,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2023-08-30 02:09:47,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4703196347031963 [2023-08-30 02:09:47,510 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2023-08-30 02:09:47,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2023-08-30 02:09:47,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:09:47,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2023-08-30 02:09:47,510 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:09:47,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 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:09:47,511 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 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:09:47,511 INFO L175 Difference]: Start difference. First operand has 50 places, 26 transitions, 167 flow. Second operand 3 states and 309 transitions. [2023-08-30 02:09:47,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 25 transitions, 210 flow [2023-08-30 02:09:47,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 25 transitions, 174 flow, removed 3 selfloop flow, removed 11 redundant places. [2023-08-30 02:09:47,515 INFO L231 Difference]: Finished difference. Result has 40 places, 24 transitions, 124 flow [2023-08-30 02:09:47,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=38, 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=124, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2023-08-30 02:09:47,516 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2023-08-30 02:09:47,516 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 124 flow [2023-08-30 02:09:47,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have 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:09:47,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:09:47,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:09:47,525 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:09:47,723 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:09:47,724 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:09:47,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:09:47,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1493255456, now seen corresponding path program 1 times [2023-08-30 02:09:47,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:09:47,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [656866502] [2023-08-30 02:09:47,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:09:47,725 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:09:47,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:09:47,725 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:09:47,727 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:09:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:09:47,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-30 02:09:47,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:09:47,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-30 02:09:47,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:09:47,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:09:47,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:09:47,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [656866502] [2023-08-30 02:09:47,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [656866502] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:09:47,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:09:47,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:09:47,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312516052] [2023-08-30 02:09:47,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:09:47,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:09:47,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:09:47,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:09:47,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:09:47,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 219 [2023-08-30 02:09:47,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have 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:09:47,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:09:47,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 219 [2023-08-30 02:09:47,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:09:48,085 INFO L130 PetriNetUnfolder]: 16/58 cut-off events. [2023-08-30 02:09:48,085 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2023-08-30 02:09:48,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 58 events. 16/58 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 149 event pairs, 10 based on Foata normal form. 1/59 useless extension candidates. Maximal degree in co-relation 189. Up to 50 conditions per place. [2023-08-30 02:09:48,087 INFO L137 encePairwiseOnDemand]: 214/219 looper letters, 24 selfloop transitions, 4 changer transitions 0/28 dead transitions. [2023-08-30 02:09:48,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 28 transitions, 187 flow [2023-08-30 02:09:48,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:09:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:09:48,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 483 transitions. [2023-08-30 02:09:48,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4410958904109589 [2023-08-30 02:09:48,089 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 483 transitions. [2023-08-30 02:09:48,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 483 transitions. [2023-08-30 02:09:48,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:09:48,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 483 transitions. [2023-08-30 02:09:48,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have 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:09:48,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have 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:09:48,092 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have 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:09:48,092 INFO L175 Difference]: Start difference. First operand has 40 places, 24 transitions, 124 flow. Second operand 5 states and 483 transitions. [2023-08-30 02:09:48,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 28 transitions, 187 flow [2023-08-30 02:09:48,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 28 transitions, 186 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:09:48,094 INFO L231 Difference]: Finished difference. Result has 42 places, 24 transitions, 134 flow [2023-08-30 02:09:48,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=37, 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=134, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2023-08-30 02:09:48,094 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2023-08-30 02:09:48,094 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 24 transitions, 134 flow [2023-08-30 02:09:48,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have 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:09:48,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:09:48,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:09:48,117 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:09:48,302 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:09:48,302 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:09:48,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:09:48,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1485378134, now seen corresponding path program 1 times [2023-08-30 02:09:48,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:09:48,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941549015] [2023-08-30 02:09:48,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:09:48,303 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:09:48,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:09:48,317 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:09:48,372 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:09:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:09:48,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-30 02:09:48,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:09:48,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:09:48,442 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:09:48,454 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-08-30 02:09:48,454 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 22 treesize of output 24 [2023-08-30 02:09:48,492 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:09:48,531 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:09:48,532 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:09:48,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:09:48,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941549015] [2023-08-30 02:09:48,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941549015] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:09:48,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:09:48,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:09:48,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296870908] [2023-08-30 02:09:48,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:09:48,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:09:48,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:09:48,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:09:48,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:09:48,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 219 [2023-08-30 02:09:48,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 24 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 91.0) internal successors, (546), 6 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have 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:09:48,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:09:48,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 219 [2023-08-30 02:09:48,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:09:48,818 INFO L130 PetriNetUnfolder]: 15/53 cut-off events. [2023-08-30 02:09:48,818 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2023-08-30 02:09:48,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 53 events. 15/53 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 110 event pairs, 2 based on Foata normal form. 2/55 useless extension candidates. Maximal degree in co-relation 190. Up to 38 conditions per place. [2023-08-30 02:09:48,818 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 21 selfloop transitions, 5 changer transitions 0/26 dead transitions. [2023-08-30 02:09:48,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 26 transitions, 189 flow [2023-08-30 02:09:48,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:09:48,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:09:48,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 378 transitions. [2023-08-30 02:09:48,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4315068493150685 [2023-08-30 02:09:48,821 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 378 transitions. [2023-08-30 02:09:48,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 378 transitions. [2023-08-30 02:09:48,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:09:48,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 378 transitions. [2023-08-30 02:09:48,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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:09:48,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have 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:09:48,823 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have 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:09:48,823 INFO L175 Difference]: Start difference. First operand has 42 places, 24 transitions, 134 flow. Second operand 4 states and 378 transitions. [2023-08-30 02:09:48,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 26 transitions, 189 flow [2023-08-30 02:09:48,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 26 transitions, 181 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-30 02:09:48,826 INFO L231 Difference]: Finished difference. Result has 42 places, 24 transitions, 142 flow [2023-08-30 02:09:48,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=38, 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=4, PETRI_FLOW=142, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2023-08-30 02:09:48,826 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2023-08-30 02:09:48,826 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 24 transitions, 142 flow [2023-08-30 02:09:48,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.0) internal successors, (546), 6 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have 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:09:48,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:09:48,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:09:48,843 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:09:49,034 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:09:49,035 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:09:49,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:09:49,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1197721165, now seen corresponding path program 1 times [2023-08-30 02:09:49,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:09:49,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577122305] [2023-08-30 02:09:49,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:09:49,036 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:09:49,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:09:49,037 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:09:49,039 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:09:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:09:49,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-30 02:09:49,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:09:49,176 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-30 02:09:49,177 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:09:49,182 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:09:49,246 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-30 02:09:49,246 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:09:49,301 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:09:49,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 15 treesize of output 17 [2023-08-30 02:09:49,381 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:09:49,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:09:51,545 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:09:51,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:09:51,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577122305] [2023-08-30 02:09:51,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577122305] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:09:51,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 02:09:51,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-08-30 02:09:51,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931331709] [2023-08-30 02:09:51,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 02:09:51,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 02:09:51,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:09:51,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 02:09:51,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=98, Unknown=6, NotChecked=0, Total=132 [2023-08-30 02:09:53,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:09:55,905 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:09:57,937 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:09:59,979 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:10:03,152 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:10:03,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 219 [2023-08-30 02:10:03,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 24 transitions, 142 flow. Second operand has 12 states, 12 states have (on average 43.0) internal successors, (516), 12 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have 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:10:03,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:10:03,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 219 [2023-08-30 02:10:03,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:10:04,225 INFO L130 PetriNetUnfolder]: 14/47 cut-off events. [2023-08-30 02:10:04,225 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2023-08-30 02:10:04,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 47 events. 14/47 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 79 event pairs, 2 based on Foata normal form. 2/49 useless extension candidates. Maximal degree in co-relation 179. Up to 15 conditions per place. [2023-08-30 02:10:04,226 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 19 selfloop transitions, 8 changer transitions 0/27 dead transitions. [2023-08-30 02:10:04,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 27 transitions, 197 flow [2023-08-30 02:10:04,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:10:04,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:10:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 271 transitions. [2023-08-30 02:10:04,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20624048706240486 [2023-08-30 02:10:04,227 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 271 transitions. [2023-08-30 02:10:04,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 271 transitions. [2023-08-30 02:10:04,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:10:04,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 271 transitions. [2023-08-30 02:10:04,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have 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:10:04,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:10:04,230 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:10:04,230 INFO L175 Difference]: Start difference. First operand has 42 places, 24 transitions, 142 flow. Second operand 6 states and 271 transitions. [2023-08-30 02:10:04,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 27 transitions, 197 flow [2023-08-30 02:10:04,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 27 transitions, 187 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-30 02:10:04,232 INFO L231 Difference]: Finished difference. Result has 43 places, 23 transitions, 141 flow [2023-08-30 02:10:04,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=43, PETRI_TRANSITIONS=23} [2023-08-30 02:10:04,232 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2023-08-30 02:10:04,232 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 23 transitions, 141 flow [2023-08-30 02:10:04,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 43.0) internal successors, (516), 12 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have 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:10:04,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:10:04,233 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:10:04,247 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:10:04,433 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:10:04,433 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:10:04,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:10:04,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1720427431, now seen corresponding path program 2 times [2023-08-30 02:10:04,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:10:04,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294516642] [2023-08-30 02:10:04,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:10:04,434 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:10:04,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:10:04,435 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:10:04,437 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:10:04,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:10:04,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:10:04,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-30 02:10:04,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:10:04,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:10:04,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:10:04,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:10:04,531 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:10:04,551 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-30 02:10:04,552 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:10:04,672 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:10:04,673 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:10:04,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:10:04,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294516642] [2023-08-30 02:10:04,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [294516642] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:10:04,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:10:04,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:10:04,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917904348] [2023-08-30 02:10:04,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:10:04,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:10:04,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:10:04,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:10:04,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:10:04,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 219 [2023-08-30 02:10:04,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 23 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have 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:10:04,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:10:04,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 219 [2023-08-30 02:10:04,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:10:04,913 INFO L130 PetriNetUnfolder]: 13/44 cut-off events. [2023-08-30 02:10:04,913 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2023-08-30 02:10:04,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 44 events. 13/44 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 0 based on Foata normal form. 2/46 useless extension candidates. Maximal degree in co-relation 175. Up to 34 conditions per place. [2023-08-30 02:10:04,913 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 21 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2023-08-30 02:10:04,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 24 transitions, 186 flow [2023-08-30 02:10:04,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:10:04,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:10:04,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 483 transitions. [2023-08-30 02:10:04,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4410958904109589 [2023-08-30 02:10:04,915 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 483 transitions. [2023-08-30 02:10:04,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 483 transitions. [2023-08-30 02:10:04,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:10:04,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 483 transitions. [2023-08-30 02:10:04,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have 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:10:04,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have 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:10:04,917 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have 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:10:04,917 INFO L175 Difference]: Start difference. First operand has 43 places, 23 transitions, 141 flow. Second operand 5 states and 483 transitions. [2023-08-30 02:10:04,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 24 transitions, 186 flow [2023-08-30 02:10:04,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 24 transitions, 159 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-08-30 02:10:04,918 INFO L231 Difference]: Finished difference. Result has 39 places, 22 transitions, 113 flow [2023-08-30 02:10:04,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=39, PETRI_TRANSITIONS=22} [2023-08-30 02:10:04,919 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2023-08-30 02:10:04,919 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 113 flow [2023-08-30 02:10:04,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have 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:10:04,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:10:04,919 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:10:04,929 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:10:05,120 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:10:05,120 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:10:05,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:10:05,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1476230215, now seen corresponding path program 2 times [2023-08-30 02:10:05,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:10:05,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498625402] [2023-08-30 02:10:05,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:10:05,121 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:10:05,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:10:05,122 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:10:05,124 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:10:05,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 02:10:05,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:10:05,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-30 02:10:05,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:10:05,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:10:05,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:10:05,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:10:05,247 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:10:05,280 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-30 02:10:05,281 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:10:05,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:10:05,334 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:10:05,435 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:10:05,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:10:05,633 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:10:05,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:10:05,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498625402] [2023-08-30 02:10:05,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498625402] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:10:05,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 02:10:05,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2023-08-30 02:10:05,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142594879] [2023-08-30 02:10:05,634 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 02:10:05,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-30 02:10:05,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:10:05,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-30 02:10:05,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2023-08-30 02:10:08,027 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:10:10,037 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:10:14,393 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:10:16,566 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:10:17,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 219 [2023-08-30 02:10:17,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 22 transitions, 113 flow. Second operand has 16 states, 16 states have (on average 72.625) internal successors, (1162), 16 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have 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:10:17,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:10:17,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 219 [2023-08-30 02:10:17,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:10:18,518 INFO L130 PetriNetUnfolder]: 21/80 cut-off events. [2023-08-30 02:10:18,518 INFO L131 PetriNetUnfolder]: For 96/96 co-relation queries the response was YES. [2023-08-30 02:10:18,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 80 events. 21/80 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 196 event pairs, 3 based on Foata normal form. 8/88 useless extension candidates. Maximal degree in co-relation 258. Up to 18 conditions per place. [2023-08-30 02:10:18,519 INFO L137 encePairwiseOnDemand]: 213/219 looper letters, 35 selfloop transitions, 17 changer transitions 0/52 dead transitions. [2023-08-30 02:10:18,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 326 flow [2023-08-30 02:10:18,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-30 02:10:18,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-30 02:10:18,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1263 transitions. [2023-08-30 02:10:18,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33924254633360196 [2023-08-30 02:10:18,535 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1263 transitions. [2023-08-30 02:10:18,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1263 transitions. [2023-08-30 02:10:18,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:10:18,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1263 transitions. [2023-08-30 02:10:18,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 74.29411764705883) internal successors, (1263), 17 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have 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:10:18,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 219.0) internal successors, (3942), 18 states have internal predecessors, (3942), 0 states have call successors, (0), 0 states have 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:10:18,541 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 219.0) internal successors, (3942), 18 states have internal predecessors, (3942), 0 states have call successors, (0), 0 states have 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:10:18,541 INFO L175 Difference]: Start difference. First operand has 39 places, 22 transitions, 113 flow. Second operand 17 states and 1263 transitions. [2023-08-30 02:10:18,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 326 flow [2023-08-30 02:10:18,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 321 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:10:18,543 INFO L231 Difference]: Finished difference. Result has 57 places, 31 transitions, 218 flow [2023-08-30 02:10:18,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=218, PETRI_PLACES=57, PETRI_TRANSITIONS=31} [2023-08-30 02:10:18,543 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2023-08-30 02:10:18,544 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 31 transitions, 218 flow [2023-08-30 02:10:18,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 72.625) internal successors, (1162), 16 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have 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:10:18,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:10:18,544 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:10:18,553 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:10:18,751 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:10:18,752 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:10:18,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:10:18,752 INFO L85 PathProgramCache]: Analyzing trace with hash -505724294, now seen corresponding path program 1 times [2023-08-30 02:10:18,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:10:18,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399577559] [2023-08-30 02:10:18,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:10:18,753 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:10:18,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:10:18,754 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:10:18,756 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:10:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:10:18,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-30 02:10:18,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:10:18,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:10:18,863 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:10:18,878 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-08-30 02:10:18,878 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 22 treesize of output 24 [2023-08-30 02:10:18,915 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:10:18,974 INFO L321 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2023-08-30 02:10:18,975 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 26 treesize of output 21 [2023-08-30 02:10:19,013 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-30 02:10:19,014 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 33 treesize of output 31 [2023-08-30 02:10:19,048 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-30 02:10:19,048 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 30 treesize of output 32 [2023-08-30 02:10:19,070 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:10:19,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:10:19,421 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:10:19,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:10:19,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399577559] [2023-08-30 02:10:19,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399577559] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:10:19,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 02:10:19,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2023-08-30 02:10:19,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070711536] [2023-08-30 02:10:19,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 02:10:19,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-30 02:10:19,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:10:19,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-30 02:10:19,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=151, Unknown=2, NotChecked=0, Total=210 [2023-08-30 02:10:20,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 219 [2023-08-30 02:10:20,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 31 transitions, 218 flow. Second operand has 15 states, 15 states have (on average 55.86666666666667) internal successors, (838), 15 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have 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:10:20,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:10:20,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 219 [2023-08-30 02:10:20,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:10:23,722 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:10:24,186 INFO L130 PetriNetUnfolder]: 21/76 cut-off events. [2023-08-30 02:10:24,186 INFO L131 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2023-08-30 02:10:24,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 76 events. 21/76 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 174 event pairs, 1 based on Foata normal form. 4/80 useless extension candidates. Maximal degree in co-relation 308. Up to 24 conditions per place. [2023-08-30 02:10:24,187 INFO L137 encePairwiseOnDemand]: 213/219 looper letters, 33 selfloop transitions, 14 changer transitions 0/47 dead transitions. [2023-08-30 02:10:24,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 47 transitions, 369 flow [2023-08-30 02:10:24,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 02:10:24,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 02:10:24,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 696 transitions. [2023-08-30 02:10:24,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2648401826484018 [2023-08-30 02:10:24,189 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 696 transitions. [2023-08-30 02:10:24,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 696 transitions. [2023-08-30 02:10:24,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:10:24,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 696 transitions. [2023-08-30 02:10:24,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 58.0) internal successors, (696), 12 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:10:24,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 219.0) internal successors, (2847), 13 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have 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:10:24,193 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 219.0) internal successors, (2847), 13 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have 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:10:24,193 INFO L175 Difference]: Start difference. First operand has 57 places, 31 transitions, 218 flow. Second operand 12 states and 696 transitions. [2023-08-30 02:10:24,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 47 transitions, 369 flow [2023-08-30 02:10:24,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 47 transitions, 361 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:10:24,195 INFO L231 Difference]: Finished difference. Result has 69 places, 32 transitions, 270 flow [2023-08-30 02:10:24,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=270, PETRI_PLACES=69, PETRI_TRANSITIONS=32} [2023-08-30 02:10:24,195 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 33 predicate places. [2023-08-30 02:10:24,195 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 32 transitions, 270 flow [2023-08-30 02:10:24,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 55.86666666666667) internal successors, (838), 15 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have 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:10:24,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:10:24,195 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:10:24,206 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:10:24,404 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:10:24,404 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:10:24,405 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:10:24,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1525546672, now seen corresponding path program 2 times [2023-08-30 02:10:24,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:10:24,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473000878] [2023-08-30 02:10:24,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:10:24,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:10:24,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:10:24,406 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:10:24,409 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:10:24,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 02:10:24,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:10:24,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-30 02:10:24,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:10:24,560 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-30 02:10:24,560 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:10:24,567 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:10:24,623 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-30 02:10:24,623 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:10:24,630 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:10:24,673 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:10:24,748 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:10:24,807 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:10:24,872 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:10:24,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:10:29,230 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:10:29,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:10:29,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473000878] [2023-08-30 02:10:29,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473000878] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:10:29,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 02:10:29,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-08-30 02:10:29,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263813894] [2023-08-30 02:10:29,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 02:10:29,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 02:10:29,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:10:29,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 02:10:29,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=145, Unknown=3, NotChecked=0, Total=182 [2023-08-30 02:10:31,790 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:10:33,988 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:10:36,749 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:10:38,821 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:10:40,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 219 [2023-08-30 02:10:40,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 32 transitions, 270 flow. Second operand has 14 states, 14 states have (on average 53.857142857142854) internal successors, (754), 14 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have 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:10:40,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:10:40,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 219 [2023-08-30 02:10:40,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:10:44,836 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:10:44,989 INFO L130 PetriNetUnfolder]: 20/71 cut-off events. [2023-08-30 02:10:44,989 INFO L131 PetriNetUnfolder]: For 172/172 co-relation queries the response was YES. [2023-08-30 02:10:44,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 71 events. 20/71 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 164 event pairs, 1 based on Foata normal form. 2/73 useless extension candidates. Maximal degree in co-relation 331. Up to 30 conditions per place. [2023-08-30 02:10:44,990 INFO L137 encePairwiseOnDemand]: 214/219 looper letters, 25 selfloop transitions, 13 changer transitions 0/38 dead transitions. [2023-08-30 02:10:44,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 38 transitions, 354 flow [2023-08-30 02:10:44,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:10:44,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:10:44,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 498 transitions. [2023-08-30 02:10:44,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2526636225266362 [2023-08-30 02:10:44,992 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 498 transitions. [2023-08-30 02:10:44,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 498 transitions. [2023-08-30 02:10:44,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:10:44,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 498 transitions. [2023-08-30 02:10:44,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 55.333333333333336) internal successors, (498), 9 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have 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:10:44,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have 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:10:44,995 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have 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:10:44,995 INFO L175 Difference]: Start difference. First operand has 69 places, 32 transitions, 270 flow. Second operand 9 states and 498 transitions. [2023-08-30 02:10:44,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 38 transitions, 354 flow [2023-08-30 02:10:44,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 38 transitions, 304 flow, removed 5 selfloop flow, removed 11 redundant places. [2023-08-30 02:10:44,997 INFO L231 Difference]: Finished difference. Result has 63 places, 31 transitions, 240 flow [2023-08-30 02:10:44,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=240, PETRI_PLACES=63, PETRI_TRANSITIONS=31} [2023-08-30 02:10:44,998 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 27 predicate places. [2023-08-30 02:10:44,998 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 31 transitions, 240 flow [2023-08-30 02:10:44,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 53.857142857142854) internal successors, (754), 14 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have 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:10:44,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:10:44,999 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:10:45,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-08-30 02:10:45,205 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:10:45,205 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:10:45,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:10:45,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1317354381, now seen corresponding path program 3 times [2023-08-30 02:10:45,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:10:45,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238775253] [2023-08-30 02:10:45,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:10:45,206 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:10:45,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:10:45,207 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:10:45,209 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:10:45,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-30 02:10:45,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:10:45,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-30 02:10:45,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:10:45,405 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-30 02:10:45,406 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:10:45,413 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:10:45,470 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:10:45,489 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-30 02:10:45,490 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:10:45,520 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:10:45,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 15 treesize of output 17 [2023-08-30 02:10:45,623 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:10:45,663 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:10:45,717 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:10:45,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:10:48,215 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:10:48,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:10:48,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1238775253] [2023-08-30 02:10:48,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1238775253] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:10:48,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 02:10:48,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-08-30 02:10:48,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913654104] [2023-08-30 02:10:48,216 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 02:10:48,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-30 02:10:48,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:10:48,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-30 02:10:48,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=198, Unknown=3, NotChecked=0, Total=240 [2023-08-30 02:10:50,277 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:10:52,318 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:10:54,353 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:10:56,452 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:10:58,547 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:00,594 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:11:02,622 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:11:04,629 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:06,687 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:08,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:11:10,851 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:12,989 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:11:15,547 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:17,603 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:19,769 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:21,806 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:23,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:25,902 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:27,951 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:29,995 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:32,070 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:34,099 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,145 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,241 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,277 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:42,311 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:44,338 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:46,385 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:48,440 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:50,566 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:50,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 219 [2023-08-30 02:11:50,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 31 transitions, 240 flow. Second operand has 16 states, 16 states have (on average 41.75) internal successors, (668), 16 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have 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:50,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:11:50,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 219 [2023-08-30 02:11:50,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:11:51,389 INFO L130 PetriNetUnfolder]: 19/66 cut-off events. [2023-08-30 02:11:51,390 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2023-08-30 02:11:51,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 66 events. 19/66 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 126 event pairs, 1 based on Foata normal form. 2/68 useless extension candidates. Maximal degree in co-relation 286. Up to 25 conditions per place. [2023-08-30 02:11:51,390 INFO L137 encePairwiseOnDemand]: 214/219 looper letters, 24 selfloop transitions, 14 changer transitions 0/38 dead transitions. [2023-08-30 02:11:51,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 38 transitions, 328 flow [2023-08-30 02:11:51,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 02:11:51,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 02:11:51,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 432 transitions. [2023-08-30 02:11:51,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.19726027397260273 [2023-08-30 02:11:51,392 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 432 transitions. [2023-08-30 02:11:51,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 432 transitions. [2023-08-30 02:11:51,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:11:51,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 432 transitions. [2023-08-30 02:11:51,393 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:11:51,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 219.0) internal successors, (2409), 11 states have internal predecessors, (2409), 0 states have call successors, (0), 0 states have 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:51,394 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 219.0) internal successors, (2409), 11 states have internal predecessors, (2409), 0 states have call successors, (0), 0 states have 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:51,395 INFO L175 Difference]: Start difference. First operand has 63 places, 31 transitions, 240 flow. Second operand 10 states and 432 transitions. [2023-08-30 02:11:51,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 38 transitions, 328 flow [2023-08-30 02:11:51,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 38 transitions, 292 flow, removed 5 selfloop flow, removed 9 redundant places. [2023-08-30 02:11:51,396 INFO L231 Difference]: Finished difference. Result has 61 places, 30 transitions, 228 flow [2023-08-30 02:11:51,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=228, PETRI_PLACES=61, PETRI_TRANSITIONS=30} [2023-08-30 02:11:51,396 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2023-08-30 02:11:51,397 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 30 transitions, 228 flow [2023-08-30 02:11:51,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 41.75) internal successors, (668), 16 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have 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:51,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:11:51,397 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:11:51,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 (22)] Forceful destruction successful, exit code 0 [2023-08-30 02:11:51,597 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:11:51,597 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:11:51,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:11:51,598 INFO L85 PathProgramCache]: Analyzing trace with hash -676044256, now seen corresponding path program 4 times [2023-08-30 02:11:51,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:11:51,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789912600] [2023-08-30 02:11:51,598 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 02:11:51,598 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:51,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:11:51,599 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:11:51,601 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:11:51,772 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 02:11:51,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:11:51,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 26 conjunts are in the unsatisfiable core [2023-08-30 02:11:51,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:11:51,816 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-30 02:11:51,816 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:11:51,825 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:11:51,930 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-30 02:11:51,930 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:11:51,970 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:11:52,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:11:52,098 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:11:52,126 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:11:52,165 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:11:52,192 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:11:52,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:11:52,220 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (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_380) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| (_ bv1 32)))) (_ bv0 8)))) is different from false [2023-08-30 02:11:52,228 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (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_380) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (bvadd (_ bv2 32) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|))) (_ bv0 8)))) is different from false [2023-08-30 02:11:54,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-08-30 02:11:54,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:11:54,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789912600] [2023-08-30 02:11:54,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789912600] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:11:54,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 02:11:54,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-08-30 02:11:54,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241678221] [2023-08-30 02:11:54,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 02:11:54,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-30 02:11:54,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:11:54,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-30 02:11:54,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=186, Unknown=21, NotChecked=58, Total=306 [2023-08-30 02:11:54,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 219 [2023-08-30 02:11:54,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 30 transitions, 228 flow. Second operand has 18 states, 18 states have (on average 42.666666666666664) internal successors, (768), 18 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have 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:54,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:11:54,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 219 [2023-08-30 02:11:54,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:12:02,525 INFO L130 PetriNetUnfolder]: 18/61 cut-off events. [2023-08-30 02:12:02,525 INFO L131 PetriNetUnfolder]: For 123/123 co-relation queries the response was YES. [2023-08-30 02:12:02,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 61 events. 18/61 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 103 event pairs, 1 based on Foata normal form. 2/63 useless extension candidates. Maximal degree in co-relation 261. Up to 20 conditions per place. [2023-08-30 02:12:02,525 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 24 selfloop transitions, 13 changer transitions 0/37 dead transitions. [2023-08-30 02:12:02,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 37 transitions, 305 flow [2023-08-30 02:12:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 02:12:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 02:12:02,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 485 transitions. [2023-08-30 02:12:02,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20132835201328353 [2023-08-30 02:12:02,527 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 485 transitions. [2023-08-30 02:12:02,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 485 transitions. [2023-08-30 02:12:02,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:12:02,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 485 transitions. [2023-08-30 02:12:02,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 44.09090909090909) internal successors, (485), 11 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:12:02,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 219.0) internal successors, (2628), 12 states have internal predecessors, (2628), 0 states have call successors, (0), 0 states have 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:02,529 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 219.0) internal successors, (2628), 12 states have internal predecessors, (2628), 0 states have call successors, (0), 0 states have 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:02,529 INFO L175 Difference]: Start difference. First operand has 61 places, 30 transitions, 228 flow. Second operand 11 states and 485 transitions. [2023-08-30 02:12:02,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 37 transitions, 305 flow [2023-08-30 02:12:02,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 37 transitions, 267 flow, removed 5 selfloop flow, removed 10 redundant places. [2023-08-30 02:12:02,531 INFO L231 Difference]: Finished difference. Result has 60 places, 28 transitions, 201 flow [2023-08-30 02:12:02,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=201, PETRI_PLACES=60, PETRI_TRANSITIONS=28} [2023-08-30 02:12:02,531 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 24 predicate places. [2023-08-30 02:12:02,531 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 28 transitions, 201 flow [2023-08-30 02:12:02,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 42.666666666666664) internal successors, (768), 18 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have 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:02,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:12:02,532 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:12:02,540 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:12:02,739 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:12:02,739 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:12:02,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:12:02,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1587277581, now seen corresponding path program 5 times [2023-08-30 02:12:02,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:12:02,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263308906] [2023-08-30 02:12:02,740 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 02:12:02,740 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:02,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:12:02,741 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:12:02,743 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:12:02,873 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-08-30 02:12:02,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:12:02,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-30 02:12:02,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:12:02,909 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 02:12:02,909 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:12:02,969 INFO L321 Elim1Store]: treesize reduction 84, result has 33.3 percent of original size [2023-08-30 02:12:02,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 62 [2023-08-30 02:12:02,980 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:03,133 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 02:12:03,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-08-30 02:12:03,215 INFO L321 Elim1Store]: treesize reduction 12, result has 76.5 percent of original size [2023-08-30 02:12:03,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 87 [2023-08-30 02:12:03,709 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 02:12:03,710 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 15 treesize of output 21 [2023-08-30 02:12:04,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 54 treesize of output 56 [2023-08-30 02:12:04,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 54 treesize of output 56 [2023-08-30 02:12:04,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 54 treesize of output 56 [2023-08-30 02:12:05,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 59 treesize of output 58 [2023-08-30 02:12:05,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 54 treesize of output 56 [2023-08-30 02:12:05,247 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-30 02:12:05,247 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 2 case distinctions, treesize of input 58 treesize of output 54 [2023-08-30 02:12:05,317 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:12:05,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:12:06,391 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:12:06,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:12:06,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263308906] [2023-08-30 02:12:06,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263308906] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:12:06,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 02:12:06,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-08-30 02:12:06,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964370732] [2023-08-30 02:12:06,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 02:12:06,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-30 02:12:06,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:12:06,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-30 02:12:06,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=328, Unknown=2, NotChecked=0, Total=380 [2023-08-30 02:12:08,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:12:10,857 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:13,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:12:15,775 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:18,206 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:22,739 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:27,895 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:28,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 219 [2023-08-30 02:12:28,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 28 transitions, 201 flow. Second operand has 20 states, 20 states have (on average 55.6) internal successors, (1112), 20 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have 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,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:12:28,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 219 [2023-08-30 02:12:28,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:12:42,755 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:44,666 INFO L130 PetriNetUnfolder]: 24/80 cut-off events. [2023-08-30 02:12:44,666 INFO L131 PetriNetUnfolder]: For 305/305 co-relation queries the response was YES. [2023-08-30 02:12:44,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 80 events. 24/80 cut-off events. For 305/305 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 177 event pairs, 0 based on Foata normal form. 6/86 useless extension candidates. Maximal degree in co-relation 353. Up to 20 conditions per place. [2023-08-30 02:12:44,666 INFO L137 encePairwiseOnDemand]: 213/219 looper letters, 36 selfloop transitions, 20 changer transitions 0/56 dead transitions. [2023-08-30 02:12:44,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 56 transitions, 442 flow [2023-08-30 02:12:44,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-30 02:12:44,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-30 02:12:44,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1139 transitions. [2023-08-30 02:12:44,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2600456621004566 [2023-08-30 02:12:44,669 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1139 transitions. [2023-08-30 02:12:44,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1139 transitions. [2023-08-30 02:12:44,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:12:44,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1139 transitions. [2023-08-30 02:12:44,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 56.95) internal successors, (1139), 20 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have 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:44,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 219.0) internal successors, (4599), 21 states have internal predecessors, (4599), 0 states have call successors, (0), 0 states have 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:44,674 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 219.0) internal successors, (4599), 21 states have internal predecessors, (4599), 0 states have call successors, (0), 0 states have 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:44,674 INFO L175 Difference]: Start difference. First operand has 60 places, 28 transitions, 201 flow. Second operand 20 states and 1139 transitions. [2023-08-30 02:12:44,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 56 transitions, 442 flow [2023-08-30 02:12:44,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 56 transitions, 384 flow, removed 6 selfloop flow, removed 14 redundant places. [2023-08-30 02:12:44,676 INFO L231 Difference]: Finished difference. Result has 66 places, 32 transitions, 252 flow [2023-08-30 02:12:44,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=252, PETRI_PLACES=66, PETRI_TRANSITIONS=32} [2023-08-30 02:12:44,676 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 30 predicate places. [2023-08-30 02:12:44,676 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 32 transitions, 252 flow [2023-08-30 02:12:44,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 55.6) internal successors, (1112), 20 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have 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:44,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:12:44,677 INFO L208 CegarLoopForPetriNet]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:12:44,685 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:12:44,885 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:12:44,886 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:12:44,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:12:44,886 INFO L85 PathProgramCache]: Analyzing trace with hash -299748857, now seen corresponding path program 3 times [2023-08-30 02:12:44,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:12:44,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397764377] [2023-08-30 02:12:44,886 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:12:44,887 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:44,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:12:44,888 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:12:44,888 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:12:45,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-08-30 02:12:45,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:12:45,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-30 02:12:45,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:12:45,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:12:45,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:12:45,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:12:45,089 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:45,123 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-30 02:12:45,124 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:45,131 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:45,203 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-30 02:12:45,203 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:45,224 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-30 02:12:45,224 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:45,270 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:45,338 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:45,356 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:45,375 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:45,389 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:45,403 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:45,420 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:45,456 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:45,527 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 02:12:45,527 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:12:45,566 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:12:45,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:12:45,728 WARN L839 $PredicateComparison]: unable to prove that (forall ((|thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| (_ BitVec 32)) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)) (.cse1 (select |c_#length| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|))) (or (not (bvult .cse0 .cse1)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_461) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) .cse0)) (_ bv0 8)) (bvult (bvadd |thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| (_ bv1 32)) .cse1)))) is different from false [2023-08-30 02:12:52,190 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:12:52,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:12:52,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397764377] [2023-08-30 02:12:52,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397764377] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:12:52,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 02:12:52,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2023-08-30 02:12:52,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151535459] [2023-08-30 02:12:52,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 02:12:52,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 02:12:52,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:12:52,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 02:12:52,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=4, NotChecked=22, Total=182 [2023-08-30 02:12:54,246 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:56,821 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,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:13:01,498 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,668 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,731 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,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s 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,744 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:11,778 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:13,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:13:15,278 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:17,315 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:19,318 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,178 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,463 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:27,178 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:29,210 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:31,287 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,305 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,363 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:36,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:13:38,798 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:40,916 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:43,090 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,143 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:47,540 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:49,557 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:51,668 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:53,834 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,873 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:57,877 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:59,897 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:01,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:14:03,097 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:05,143 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,146 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:14:10,144 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:12,247 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:14,535 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,712 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:18,818 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:20,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:23,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 02:14:23,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 219 [2023-08-30 02:14:23,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 32 transitions, 252 flow. Second operand has 14 states, 14 states have (on average 40.714285714285715) internal successors, (570), 14 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have 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:23,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:14:23,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 219 [2023-08-30 02:14:23,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:14:24,350 INFO L130 PetriNetUnfolder]: 24/83 cut-off events. [2023-08-30 02:14:24,350 INFO L131 PetriNetUnfolder]: For 653/653 co-relation queries the response was YES. [2023-08-30 02:14:24,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 83 events. 24/83 cut-off events. For 653/653 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 203 event pairs, 0 based on Foata normal form. 12/95 useless extension candidates. Maximal degree in co-relation 329. Up to 43 conditions per place. [2023-08-30 02:14:24,351 INFO L137 encePairwiseOnDemand]: 211/219 looper letters, 37 selfloop transitions, 11 changer transitions 0/48 dead transitions. [2023-08-30 02:14:24,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 48 transitions, 416 flow [2023-08-30 02:14:24,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:14:24,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:14:24,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 335 transitions. [2023-08-30 02:14:24,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.19121004566210045 [2023-08-30 02:14:24,353 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 335 transitions. [2023-08-30 02:14:24,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 335 transitions. [2023-08-30 02:14:24,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:14:24,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 335 transitions. [2023-08-30 02:14:24,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 41.875) internal successors, (335), 8 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:14:24,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 219.0) internal successors, (1971), 9 states have internal predecessors, (1971), 0 states have call successors, (0), 0 states have 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:24,357 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 219.0) internal successors, (1971), 9 states have internal predecessors, (1971), 0 states have call successors, (0), 0 states have 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:24,357 INFO L175 Difference]: Start difference. First operand has 66 places, 32 transitions, 252 flow. Second operand 8 states and 335 transitions. [2023-08-30 02:14:24,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 48 transitions, 416 flow [2023-08-30 02:14:24,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 222 flow, removed 30 selfloop flow, removed 25 redundant places. [2023-08-30 02:14:24,359 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 132 flow [2023-08-30 02:14:24,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=132, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2023-08-30 02:14:24,359 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2023-08-30 02:14:24,359 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 132 flow [2023-08-30 02:14:24,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 40.714285714285715) internal successors, (570), 14 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have 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:24,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:14:24,360 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:14:24,370 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:14:24,570 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:14:24,570 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:14:24,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:14:24,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1144776256, now seen corresponding path program 6 times [2023-08-30 02:14:24,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:14:24,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379284548] [2023-08-30 02:14:24,571 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 02:14:24,572 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:24,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:14:24,573 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:14:24,573 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:14:24,781 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-08-30 02:14:24,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:14:24,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-30 02:14:24,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:14:24,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:14:24,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:14:24,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:14:24,830 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:24,869 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-30 02:14:24,870 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:24,880 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:24,977 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-30 02:14:24,977 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:14:25,006 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-30 02:14:25,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:14:25,063 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:25,181 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:25,240 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:25,286 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:25,358 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:25,422 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:25,478 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:25,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:14:25,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:14:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:14:28,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:14:28,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379284548] [2023-08-30 02:14:28,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1379284548] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:14:28,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 02:14:28,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2023-08-30 02:14:28,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911030809] [2023-08-30 02:14:28,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 02:14:28,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-30 02:14:28,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:14:28,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-30 02:14:28,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=384, Unknown=9, NotChecked=0, Total=462 [2023-08-30 02:14:31,587 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:33,796 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:36,470 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:38,803 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:41,146 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:44,258 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:46,739 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:49,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 [1] [2023-08-30 02:14:51,608 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:53,851 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:56,417 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:57,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 219 [2023-08-30 02:14:57,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 132 flow. Second operand has 22 states, 22 states have (on average 42.54545454545455) internal successors, (936), 22 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have 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,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:14:57,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 219 [2023-08-30 02:14:57,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:15:04,689 INFO L130 PetriNetUnfolder]: 22/85 cut-off events. [2023-08-30 02:15:04,689 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-08-30 02:15:04,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 85 events. 22/85 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 143 event pairs, 0 based on Foata normal form. 15/100 useless extension candidates. Maximal degree in co-relation 242. Up to 25 conditions per place. [2023-08-30 02:15:04,690 INFO L137 encePairwiseOnDemand]: 214/219 looper letters, 31 selfloop transitions, 21 changer transitions 0/52 dead transitions. [2023-08-30 02:15:04,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 52 transitions, 302 flow [2023-08-30 02:15:04,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-30 02:15:04,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-30 02:15:04,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 875 transitions. [2023-08-30 02:15:04,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.1997716894977169 [2023-08-30 02:15:04,692 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 875 transitions. [2023-08-30 02:15:04,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 875 transitions. [2023-08-30 02:15:04,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:15:04,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 875 transitions. [2023-08-30 02:15:04,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 43.75) internal successors, (875), 20 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have 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:04,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 219.0) internal successors, (4599), 21 states have internal predecessors, (4599), 0 states have call successors, (0), 0 states have 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:04,696 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 219.0) internal successors, (4599), 21 states have internal predecessors, (4599), 0 states have call successors, (0), 0 states have 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:04,696 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 132 flow. Second operand 20 states and 875 transitions. [2023-08-30 02:15:04,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 52 transitions, 302 flow [2023-08-30 02:15:04,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 52 transitions, 269 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-08-30 02:15:04,697 INFO L231 Difference]: Finished difference. Result has 55 places, 32 transitions, 132 flow [2023-08-30 02:15:04,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=132, PETRI_PLACES=55, PETRI_TRANSITIONS=32} [2023-08-30 02:15:04,697 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2023-08-30 02:15:04,697 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 32 transitions, 132 flow [2023-08-30 02:15:04,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 42.54545454545455) internal successors, (936), 22 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have 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:04,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:15:04,698 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:15:04,706 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:04,898 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:04,898 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:15:04,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:15:04,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1128522697, now seen corresponding path program 2 times [2023-08-30 02:15:04,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:15:04,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762173152] [2023-08-30 02:15:04,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:15:04,899 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:04,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:15:04,900 INFO L229 MonitoredProcess]: Starting monitored process 27 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:04,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-08-30 02:15:05,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 02:15:05,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:15:05,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 02:15:05,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:15:05,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:15:05,062 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:15:05,076 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-08-30 02:15:05,076 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 22 treesize of output 24 [2023-08-30 02:15:05,111 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:15:05,181 INFO L321 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2023-08-30 02:15:05,181 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 26 treesize of output 21 [2023-08-30 02:15:05,223 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-30 02:15:05,223 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 33 treesize of output 31 [2023-08-30 02:15:05,262 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-30 02:15:05,263 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 30 treesize of output 32 [2023-08-30 02:15:05,304 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-30 02:15:05,304 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 30 treesize of output 32 [2023-08-30 02:15:05,348 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-30 02:15:05,348 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 30 treesize of output 32 [2023-08-30 02:15:05,401 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-30 02:15:05,402 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 30 treesize of output 32 [2023-08-30 02:15:05,446 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-30 02:15:05,446 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 30 treesize of output 32 [2023-08-30 02:15:05,496 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-30 02:15:05,497 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 30 treesize of output 32 [2023-08-30 02:15:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:15:05,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 02:15:08,198 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:15:08,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:15:08,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762173152] [2023-08-30 02:15:08,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762173152] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 02:15:08,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 02:15:08,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 23 [2023-08-30 02:15:08,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362066756] [2023-08-30 02:15:08,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 02:15:08,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-30 02:15:08,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:15:08,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-30 02:15:08,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=426, Unknown=2, NotChecked=0, Total=600 [2023-08-30 02:15:28,830 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:15:44,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 219 [2023-08-30 02:15:44,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 32 transitions, 132 flow. Second operand has 25 states, 25 states have (on average 55.52) internal successors, (1388), 25 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have 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:44,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:15:44,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 219 [2023-08-30 02:15:44,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:15:49,897 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:51,504 INFO L130 PetriNetUnfolder]: 32/111 cut-off events. [2023-08-30 02:15:51,504 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-30 02:15:51,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 111 events. 32/111 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 219 event pairs, 1 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 357. Up to 39 conditions per place. [2023-08-30 02:15:51,505 INFO L137 encePairwiseOnDemand]: 213/219 looper letters, 45 selfloop transitions, 23 changer transitions 0/68 dead transitions. [2023-08-30 02:15:51,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 68 transitions, 427 flow [2023-08-30 02:15:51,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-30 02:15:51,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-30 02:15:51,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1196 transitions. [2023-08-30 02:15:51,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26005653402913675 [2023-08-30 02:15:51,516 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1196 transitions. [2023-08-30 02:15:51,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1196 transitions. [2023-08-30 02:15:51,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:15:51,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1196 transitions. [2023-08-30 02:15:51,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 56.95238095238095) internal successors, (1196), 21 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have 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:51,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 219.0) internal successors, (4818), 22 states have internal predecessors, (4818), 0 states have call successors, (0), 0 states have 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:51,540 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 219.0) internal successors, (4818), 22 states have internal predecessors, (4818), 0 states have call successors, (0), 0 states have 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:51,540 INFO L175 Difference]: Start difference. First operand has 55 places, 32 transitions, 132 flow. Second operand 21 states and 1196 transitions. [2023-08-30 02:15:51,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 68 transitions, 427 flow [2023-08-30 02:15:51,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 68 transitions, 367 flow, removed 7 selfloop flow, removed 15 redundant places. [2023-08-30 02:15:51,543 INFO L231 Difference]: Finished difference. Result has 65 places, 39 transitions, 195 flow [2023-08-30 02:15:51,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=195, PETRI_PLACES=65, PETRI_TRANSITIONS=39} [2023-08-30 02:15:51,543 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 29 predicate places. [2023-08-30 02:15:51,544 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 39 transitions, 195 flow [2023-08-30 02:15:51,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 55.52) internal successors, (1388), 25 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have 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:51,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:15:51,544 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:15:51,553 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 (27)] Forceful destruction successful, exit code 0 [2023-08-30 02:15:51,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:51,745 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-30 02:15:51,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:15:51,745 INFO L85 PathProgramCache]: Analyzing trace with hash 654057325, now seen corresponding path program 7 times [2023-08-30 02:15:51,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:15:51,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905170946] [2023-08-30 02:15:51,746 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-30 02:15:51,746 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:51,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:15:51,747 INFO L229 MonitoredProcess]: Starting monitored process 28 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:51,749 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 (28)] Waiting until timeout for monitored process [2023-08-30 02:15:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:15:52,014 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:15:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:15:52,275 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 02:15:52,275 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:15:52,276 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2023-08-30 02:15:52,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2023-08-30 02:15:52,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2023-08-30 02:15:52,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2023-08-30 02:15:52,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2023-08-30 02:15:52,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2023-08-30 02:15:52,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2023-08-30 02:15:52,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2023-08-30 02:15:52,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2023-08-30 02:15:52,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2023-08-30 02:15:52,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2023-08-30 02:15:52,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2023-08-30 02:15:52,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2023-08-30 02:15:52,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2023-08-30 02:15:52,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2023-08-30 02:15:52,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2023-08-30 02:15:52,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2023-08-30 02:15:52,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (8 of 26 remaining) [2023-08-30 02:15:52,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 26 remaining) [2023-08-30 02:15:52,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 26 remaining) [2023-08-30 02:15:52,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2023-08-30 02:15:52,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2023-08-30 02:15:52,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2023-08-30 02:15:52,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2023-08-30 02:15:52,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2023-08-30 02:15:52,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2023-08-30 02:15:52,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2023-08-30 02:15:52,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:52,491 INFO L445 BasicCegarLoop]: Path program histogram: [7, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:15:52,495 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:15:52,496 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:15:52,510 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:52,534 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:52,535 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:52,535 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:52,535 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:52,535 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:52,536 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:52,536 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:52,536 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:52,536 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:52,539 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:52,540 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:52,544 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:52,544 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:52,545 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:52,545 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:52,545 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:52,545 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:52,545 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:52,546 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:52,546 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:52,546 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:52,546 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:52,546 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:52,547 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:52,547 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:52,547 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:52,547 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:52,547 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:52,548 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:52,551 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:52,551 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:52,551 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:52,551 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:52,552 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-30 02:15:52,552 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-30 02:15:52,552 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:52,552 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:52,552 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:52,552 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:52,553 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-30 02:15:52,553 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-30 02:15:52,553 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:52,553 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:52,553 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:52,554 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:52,554 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-30 02:15:52,554 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-30 02:15:52,554 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-30 02:15:52,554 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-30 02:15:52,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:15:52 BasicIcfg [2023-08-30 02:15:52,581 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:15:52,582 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:15:52,583 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:15:52,583 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:15:52,583 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:08:58" (3/4) ... [2023-08-30 02:15:52,586 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:15:52,586 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:15:52,586 INFO L158 Benchmark]: Toolchain (without parser) took 415718.23ms. Allocated memory was 56.6MB in the beginning and 157.3MB in the end (delta: 100.7MB). Free memory was 31.8MB in the beginning and 93.3MB in the end (delta: -61.5MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2023-08-30 02:15:52,586 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 46.1MB. Free memory was 24.6MB in the beginning and 24.5MB in the end (delta: 30.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:15:52,588 INFO L158 Benchmark]: CACSL2BoogieTranslator took 570.80ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 31.5MB in the beginning and 43.4MB in the end (delta: -11.8MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2023-08-30 02:15:52,589 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.11ms. Allocated memory is still 71.3MB. Free memory was 43.4MB in the beginning and 40.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:15:52,589 INFO L158 Benchmark]: Boogie Preprocessor took 38.90ms. Allocated memory is still 71.3MB. Free memory was 40.9MB in the beginning and 38.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:15:52,589 INFO L158 Benchmark]: RCFGBuilder took 513.52ms. Allocated memory is still 71.3MB. Free memory was 38.9MB in the beginning and 37.3MB in the end (delta: 1.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-30 02:15:52,590 INFO L158 Benchmark]: TraceAbstraction took 414528.81ms. Allocated memory was 71.3MB in the beginning and 157.3MB in the end (delta: 86.0MB). Free memory was 36.7MB in the beginning and 93.3MB in the end (delta: -56.6MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2023-08-30 02:15:52,592 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 157.3MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:15:52,593 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 46.1MB. Free memory was 24.6MB in the beginning and 24.5MB in the end (delta: 30.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 570.80ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 31.5MB in the beginning and 43.4MB in the end (delta: -11.8MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.11ms. Allocated memory is still 71.3MB. Free memory was 43.4MB in the beginning and 40.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.90ms. Allocated memory is still 71.3MB. Free memory was 40.9MB in the beginning and 38.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 513.52ms. Allocated memory is still 71.3MB. Free memory was 38.9MB in the beginning and 37.3MB in the end (delta: 1.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 414528.81ms. Allocated memory was 71.3MB in the beginning and 157.3MB in the end (delta: 86.0MB). Free memory was 36.7MB in the beginning and 93.3MB in the end (delta: -56.6MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 157.3MB. Free memory is still 93.3MB. 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_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_#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_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_#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_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_#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: 6.1s, 104 PlacesBefore, 36 PlacesAfterwards, 101 TransitionsBefore, 31 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 6 FixpointIterations, 59 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 112 TotalNumberOfCompositions, 458 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 365, independent: 340, independent conditional: 0, independent unconditional: 340, 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: 181, independent: 171, independent conditional: 0, independent unconditional: 171, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 365, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 181, unknown conditional: 0, unknown unconditional: 181] , 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 1107. 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)=1, t1={7:0}, t2={11:0}, v={0:0}] [L1111] 1 v = malloc(sizeof(char) * 8) [L1112] 1 return 0; [L1123] 0 \read(t1) VAL [\read(t1)=1, \result={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={11:0}, v={5:0}] [L1123] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=1, \result={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={11:0}, v={5: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)=2, t1={7:0}, t2={11:0}, v={5:0}] [L1125] 0 \read(t2) VAL [\read(t2)=2, \result={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={11:0}, v={5: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)=2, \result={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={11:0}, v={5:0}] [L1126] EXPR 0 v[0] [L1126] CALL 0 __VERIFIER_assert(v[0] == 'B') [L1107] COND FALSE 0 !(!expression) [L1126] RET 0 __VERIFIER_assert(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, 139 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: 414.3s, OverallIterations: 27, TraceHistogramMax: 8, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 365.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 414 mSolverCounterUnknown, 6190 SdHoareTripleChecker+Valid, 335.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5047 mSDsluCounter, 4533 SdHoareTripleChecker+Invalid, 330.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 103 IncrementalHoareTripleChecker+Unchecked, 4351 mSDsCounter, 477 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18596 IncrementalHoareTripleChecker+Invalid, 19590 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 477 mSolverCounterUnsat, 182 mSDtfsCounter, 18596 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 534 GetRequests, 226 SyntacticMatches, 3 SemanticMatches, 305 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 55.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=270occurred in iteration=19, InterpolantAutomatonStates: 208, 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.4s SatisfiabilityAnalysisTime, 33.4s InterpolantComputationTime, 302 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 421 ConstructedInterpolants, 165 QuantifiedInterpolants, 8616 SizeOfPredicates, 133 NumberOfNonLiveVariables, 2818 ConjunctsInSsa, 431 ConjunctsInUnsatCore, 38 InterpolantComputations, 14 PerfectInterpolantSequences, 52/280 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:52,718 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