./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_true.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_true.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 4f5c1949da3ffd7703b26279578bf3cad55c86e8b0ffaff69f49645cdd541f53 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 00:25:40,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 00:25:40,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 00:25:40,616 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 00:25:40,619 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 00:25:40,621 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 00:25:40,623 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 00:25:40,626 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 00:25:40,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 00:25:40,632 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 00:25:40,633 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 00:25:40,635 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 00:25:40,636 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 00:25:40,638 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 00:25:40,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 00:25:40,643 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 00:25:40,644 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 00:25:40,645 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 00:25:40,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 00:25:40,652 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 00:25:40,653 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 00:25:40,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 00:25:40,655 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 00:25:40,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 00:25:40,664 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 00:25:40,664 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 00:25:40,664 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 00:25:40,666 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 00:25:40,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 00:25:40,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 00:25:40,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 00:25:40,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 00:25:40,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 00:25:40,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 00:25:40,676 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 00:25:40,676 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 00:25:40,677 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 00:25:40,677 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 00:25:40,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 00:25:40,678 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 00:25:40,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 00:25:40,680 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-09-01 00:25:40,717 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 00:25:40,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 00:25:40,719 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 00:25:40,719 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 00:25:40,720 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 00:25:40,720 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 00:25:40,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 00:25:40,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 00:25:40,721 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 00:25:40,721 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 00:25:40,722 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 00:25:40,722 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-01 00:25:40,722 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 00:25:40,722 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 00:25:40,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 00:25:40,723 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-09-01 00:25:40,723 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-09-01 00:25:40,723 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-09-01 00:25:40,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 00:25:40,723 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-09-01 00:25:40,724 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 00:25:40,724 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 00:25:40,724 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 00:25:40,724 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 00:25:40,724 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 00:25:40,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 00:25:40,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 00:25:40,725 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 00:25:40,725 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 00:25:40,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 00:25:40,725 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 00:25:40,726 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 00:25:40,726 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 00:25:40,726 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 00:25:40,726 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 -> 4f5c1949da3ffd7703b26279578bf3cad55c86e8b0ffaff69f49645cdd541f53 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 00:25:41,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 00:25:41,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 00:25:41,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 00:25:41,059 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 00:25:41,060 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 00:25:41,061 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_true.i [2023-09-01 00:25:42,133 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 00:25:42,423 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 00:25:42,424 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_true.i [2023-09-01 00:25:42,443 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09adb22c6/4fe86b8290bf41a18e6514e44d7dc056/FLAG1468486f5 [2023-09-01 00:25:42,455 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09adb22c6/4fe86b8290bf41a18e6514e44d7dc056 [2023-09-01 00:25:42,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 00:25:42,465 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 00:25:42,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 00:25:42,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 00:25:42,471 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 00:25:42,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 12:25:42" (1/1) ... [2023-09-01 00:25:42,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30d5af71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:42, skipping insertion in model container [2023-09-01 00:25:42,473 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 12:25:42" (1/1) ... [2023-09-01 00:25:42,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 00:25:42,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 00:25:42,705 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_true.i[1094,1107] [2023-09-01 00:25:43,000 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 00:25:43,012 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 00:25:43,024 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_true.i[1094,1107] [2023-09-01 00:25:43,057 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 00:25:43,149 WARN L667 CHandler]: The function sleep is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 00:25:43,155 INFO L208 MainTranslator]: Completed translation [2023-09-01 00:25:43,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:43 WrapperNode [2023-09-01 00:25:43,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 00:25:43,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 00:25:43,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 00:25:43,157 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 00:25:43,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:43" (1/1) ... [2023-09-01 00:25:43,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:43" (1/1) ... [2023-09-01 00:25:43,209 INFO L138 Inliner]: procedures = 354, calls = 38, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2023-09-01 00:25:43,209 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 00:25:43,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 00:25:43,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 00:25:43,210 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 00:25:43,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:43" (1/1) ... [2023-09-01 00:25:43,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:43" (1/1) ... [2023-09-01 00:25:43,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:43" (1/1) ... [2023-09-01 00:25:43,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:43" (1/1) ... [2023-09-01 00:25:43,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:43" (1/1) ... [2023-09-01 00:25:43,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:43" (1/1) ... [2023-09-01 00:25:43,238 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:43" (1/1) ... [2023-09-01 00:25:43,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:43" (1/1) ... [2023-09-01 00:25:43,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 00:25:43,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 00:25:43,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 00:25:43,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 00:25:43,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:43" (1/1) ... [2023-09-01 00:25:43,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 00:25:43,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 00:25:43,290 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 00:25:43,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 00:25:43,331 INFO L130 BoogieDeclarations]: Found specification of procedure sleep [2023-09-01 00:25:43,332 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2023-09-01 00:25:43,332 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2023-09-01 00:25:43,332 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2023-09-01 00:25:43,332 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2023-09-01 00:25:43,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 00:25:43,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 00:25:43,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 00:25:43,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 00:25:43,332 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-01 00:25:43,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 00:25:43,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 00:25:43,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 00:25:43,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 00:25:43,333 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 00:25:43,698 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 00:25:43,700 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 00:25:43,897 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 00:25:43,903 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 00:25:43,903 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 00:25:43,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 12:25:43 BoogieIcfgContainer [2023-09-01 00:25:43,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 00:25:43,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 00:25:43,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 00:25:43,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 00:25:43,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 12:25:42" (1/3) ... [2023-09-01 00:25:43,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@380a335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 12:25:43, skipping insertion in model container [2023-09-01 00:25:43,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:43" (2/3) ... [2023-09-01 00:25:43,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@380a335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 12:25:43, skipping insertion in model container [2023-09-01 00:25:43,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 12:25:43" (3/3) ... [2023-09-01 00:25:43,912 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_67-pthread_cond_wait_true.i [2023-09-01 00:25:43,926 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 00:25:43,927 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-09-01 00:25:43,927 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 00:25:43,970 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-01 00:25:44,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 100 transitions, 216 flow [2023-09-01 00:25:44,070 INFO L130 PetriNetUnfolder]: 1/98 cut-off events. [2023-09-01 00:25:44,070 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 00:25:44,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 98 events. 1/98 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 89 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-09-01 00:25:44,074 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 100 transitions, 216 flow [2023-09-01 00:25:44,078 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 94 transitions, 200 flow [2023-09-01 00:25:44,081 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 00:25:44,088 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 94 transitions, 200 flow [2023-09-01 00:25:44,090 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 94 transitions, 200 flow [2023-09-01 00:25:44,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 94 transitions, 200 flow [2023-09-01 00:25:44,108 INFO L130 PetriNetUnfolder]: 1/94 cut-off events. [2023-09-01 00:25:44,109 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 00:25:44,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 94 events. 1/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 88 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-09-01 00:25:44,110 INFO L119 LiptonReduction]: Number of co-enabled transitions 1020 [2023-09-01 00:25:47,870 INFO L134 LiptonReduction]: Checked pairs total: 2810 [2023-09-01 00:25:47,870 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-09-01 00:25:47,883 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 00:25:47,888 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;@34008ff4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 00:25:47,888 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-09-01 00:25:47,889 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-09-01 00:25:47,889 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:25:47,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:47,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-09-01 00:25:47,890 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:25:47,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:47,894 INFO L85 PathProgramCache]: Analyzing trace with hash 357, now seen corresponding path program 1 times [2023-09-01 00:25:47,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 00:25:47,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381806723] [2023-09-01 00:25:47,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:47,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 00:25:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:25:48,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:48,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 00:25:48,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381806723] [2023-09-01 00:25:48,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381806723] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:48,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:48,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-09-01 00:25:48,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136891314] [2023-09-01 00:25:48,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:48,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-01 00:25:48,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 00:25:48,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-01 00:25:48,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-01 00:25:48,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 192 [2023-09-01 00:25:48,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 72 flow. Second operand has 2 states, 2 states have (on average 94.5) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:48,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:48,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 192 [2023-09-01 00:25:48,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:48,294 INFO L130 PetriNetUnfolder]: 161/313 cut-off events. [2023-09-01 00:25:48,295 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2023-09-01 00:25:48,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 313 events. 161/313 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1293 event pairs, 161 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 585. Up to 305 conditions per place. [2023-09-01 00:25:48,301 INFO L137 encePairwiseOnDemand]: 189/192 looper letters, 24 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-09-01 00:25:48,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 26 transitions, 112 flow [2023-09-01 00:25:48,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-01 00:25:48,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-09-01 00:25:48,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 215 transitions. [2023-09-01 00:25:48,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5598958333333334 [2023-09-01 00:25:48,392 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 215 transitions. [2023-09-01 00:25:48,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 215 transitions. [2023-09-01 00:25:48,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:48,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 215 transitions. [2023-09-01 00:25:48,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 107.5) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:48,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:48,410 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:48,412 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 72 flow. Second operand 2 states and 215 transitions. [2023-09-01 00:25:48,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 26 transitions, 112 flow [2023-09-01 00:25:48,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 00:25:48,417 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 56 flow [2023-09-01 00:25:48,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2023-09-01 00:25:48,421 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-09-01 00:25:48,421 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 56 flow [2023-09-01 00:25:48,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 94.5) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:48,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:48,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 00:25:48,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 00:25:48,424 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:25:48,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:48,432 INFO L85 PathProgramCache]: Analyzing trace with hash 349649, now seen corresponding path program 1 times [2023-09-01 00:25:48,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 00:25:48,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772188877] [2023-09-01 00:25:48,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:48,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 00:25:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:25:48,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:48,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 00:25:48,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772188877] [2023-09-01 00:25:48,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772188877] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:48,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:48,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 00:25:48,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927489926] [2023-09-01 00:25:48,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:48,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:25:48,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 00:25:48,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:25:48,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:25:48,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 192 [2023-09-01 00:25:48,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:48,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:48,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 192 [2023-09-01 00:25:48,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:48,737 INFO L130 PetriNetUnfolder]: 152/292 cut-off events. [2023-09-01 00:25:48,737 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:25:48,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 292 events. 152/292 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1187 event pairs, 152 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 585. Up to 283 conditions per place. [2023-09-01 00:25:48,740 INFO L137 encePairwiseOnDemand]: 188/192 looper letters, 20 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2023-09-01 00:25:48,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 24 transitions, 96 flow [2023-09-01 00:25:48,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:25:48,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:25:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2023-09-01 00:25:48,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.484375 [2023-09-01 00:25:48,742 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 279 transitions. [2023-09-01 00:25:48,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 279 transitions. [2023-09-01 00:25:48,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:48,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 279 transitions. [2023-09-01 00:25:48,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-09-01 00:25:48,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 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-09-01 00:25:48,746 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 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-09-01 00:25:48,746 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 56 flow. Second operand 3 states and 279 transitions. [2023-09-01 00:25:48,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 24 transitions, 96 flow [2023-09-01 00:25:48,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 00:25:48,747 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 56 flow [2023-09-01 00:25:48,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2023-09-01 00:25:48,748 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-09-01 00:25:48,748 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 56 flow [2023-09-01 00:25:48,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:48,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:48,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 00:25:48,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 00:25:48,749 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:25:48,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:48,750 INFO L85 PathProgramCache]: Analyzing trace with hash 349651, now seen corresponding path program 1 times [2023-09-01 00:25:48,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 00:25:48,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116689464] [2023-09-01 00:25:48,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:48,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 00:25:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:25:48,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:48,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 00:25:48,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116689464] [2023-09-01 00:25:48,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116689464] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:48,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:48,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 00:25:48,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968017965] [2023-09-01 00:25:48,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:48,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:25:48,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 00:25:48,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:25:48,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:25:48,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 192 [2023-09-01 00:25:48,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:48,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:48,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 192 [2023-09-01 00:25:48,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:49,003 INFO L130 PetriNetUnfolder]: 143/271 cut-off events. [2023-09-01 00:25:49,003 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:25:49,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550 conditions, 271 events. 143/271 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1074 event pairs, 143 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 546. Up to 263 conditions per place. [2023-09-01 00:25:49,005 INFO L137 encePairwiseOnDemand]: 188/192 looper letters, 18 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2023-09-01 00:25:49,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 22 transitions, 92 flow [2023-09-01 00:25:49,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:25:49,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:25:49,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions. [2023-09-01 00:25:49,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5017361111111112 [2023-09-01 00:25:49,008 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 289 transitions. [2023-09-01 00:25:49,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 289 transitions. [2023-09-01 00:25:49,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:49,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 289 transitions. [2023-09-01 00:25:49,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:49,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 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-09-01 00:25:49,011 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 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-09-01 00:25:49,011 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 56 flow. Second operand 3 states and 289 transitions. [2023-09-01 00:25:49,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 22 transitions, 92 flow [2023-09-01 00:25:49,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 22 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 00:25:49,013 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 52 flow [2023-09-01 00:25:49,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2023-09-01 00:25:49,013 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -8 predicate places. [2023-09-01 00:25:49,014 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 52 flow [2023-09-01 00:25:49,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:49,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:49,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 00:25:49,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 00:25:49,015 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:25:49,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:49,015 INFO L85 PathProgramCache]: Analyzing trace with hash 336021089, now seen corresponding path program 1 times [2023-09-01 00:25:49,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 00:25:49,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753924369] [2023-09-01 00:25:49,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:49,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 00:25:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:25:49,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:49,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 00:25:49,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753924369] [2023-09-01 00:25:49,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753924369] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:49,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:49,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 00:25:49,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285960367] [2023-09-01 00:25:49,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:49,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 00:25:49,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 00:25:49,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 00:25:49,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 00:25:49,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 192 [2023-09-01 00:25:49,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:49,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:49,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 192 [2023-09-01 00:25:49,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:49,305 INFO L130 PetriNetUnfolder]: 106/210 cut-off events. [2023-09-01 00:25:49,308 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:25:49,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 210 events. 106/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 772 event pairs, 106 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 424. Up to 202 conditions per place. [2023-09-01 00:25:49,311 INFO L137 encePairwiseOnDemand]: 189/192 looper letters, 17 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2023-09-01 00:25:49,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 88 flow [2023-09-01 00:25:49,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:25:49,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:25:49,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2023-09-01 00:25:49,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878472222222222 [2023-09-01 00:25:49,313 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 281 transitions. [2023-09-01 00:25:49,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 281 transitions. [2023-09-01 00:25:49,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:49,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 281 transitions. [2023-09-01 00:25:49,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:49,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 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-09-01 00:25:49,320 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 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-09-01 00:25:49,320 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 52 flow. Second operand 3 states and 281 transitions. [2023-09-01 00:25:49,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 88 flow [2023-09-01 00:25:49,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 21 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 00:25:49,322 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 50 flow [2023-09-01 00:25:49,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=25, 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=27, PETRI_TRANSITIONS=21} [2023-09-01 00:25:49,323 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -9 predicate places. [2023-09-01 00:25:49,323 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 50 flow [2023-09-01 00:25:49,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:49,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:49,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 00:25:49,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 00:25:49,324 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:25:49,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:49,325 INFO L85 PathProgramCache]: Analyzing trace with hash 336021091, now seen corresponding path program 1 times [2023-09-01 00:25:49,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 00:25:49,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212120365] [2023-09-01 00:25:49,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:49,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 00:25:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:25:49,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:49,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 00:25:49,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212120365] [2023-09-01 00:25:49,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212120365] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:49,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:49,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 00:25:49,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988686717] [2023-09-01 00:25:49,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:49,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 00:25:49,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 00:25:49,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 00:25:49,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 00:25:49,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 192 [2023-09-01 00:25:49,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 50 flow. Second operand has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:49,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:49,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 192 [2023-09-01 00:25:49,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:49,534 INFO L130 PetriNetUnfolder]: 69/149 cut-off events. [2023-09-01 00:25:49,534 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:25:49,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 149 events. 69/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 480 event pairs, 69 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 302. Up to 141 conditions per place. [2023-09-01 00:25:49,535 INFO L137 encePairwiseOnDemand]: 189/192 looper letters, 16 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2023-09-01 00:25:49,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 84 flow [2023-09-01 00:25:49,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:25:49,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:25:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2023-09-01 00:25:49,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4548611111111111 [2023-09-01 00:25:49,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2023-09-01 00:25:49,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2023-09-01 00:25:49,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:49,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2023-09-01 00:25:49,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:49,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 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-09-01 00:25:49,545 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 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-09-01 00:25:49,545 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 50 flow. Second operand 3 states and 262 transitions. [2023-09-01 00:25:49,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 84 flow [2023-09-01 00:25:49,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 00:25:49,546 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 48 flow [2023-09-01 00:25:49,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2023-09-01 00:25:49,548 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -10 predicate places. [2023-09-01 00:25:49,548 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 48 flow [2023-09-01 00:25:49,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:49,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:49,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 00:25:49,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 00:25:49,549 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:25:49,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:49,550 INFO L85 PathProgramCache]: Analyzing trace with hash 760591022, now seen corresponding path program 1 times [2023-09-01 00:25:49,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 00:25:49,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955250005] [2023-09-01 00:25:49,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:49,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 00:25:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:25:49,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:49,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 00:25:49,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955250005] [2023-09-01 00:25:49,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955250005] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:49,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:49,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 00:25:49,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811938216] [2023-09-01 00:25:49,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:49,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:25:49,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 00:25:49,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:25:49,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:25:49,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 192 [2023-09-01 00:25:49,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 48 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-09-01 00:25:49,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:49,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 192 [2023-09-01 00:25:49,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:49,729 INFO L130 PetriNetUnfolder]: 97/204 cut-off events. [2023-09-01 00:25:49,730 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:25:49,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 204 events. 97/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 710 event pairs, 55 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 408. Up to 131 conditions per place. [2023-09-01 00:25:49,731 INFO L137 encePairwiseOnDemand]: 187/192 looper letters, 24 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2023-09-01 00:25:49,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 29 transitions, 123 flow [2023-09-01 00:25:49,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:25:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:25:49,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2023-09-01 00:25:49,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5190972222222222 [2023-09-01 00:25:49,733 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 299 transitions. [2023-09-01 00:25:49,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 299 transitions. [2023-09-01 00:25:49,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:49,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 299 transitions. [2023-09-01 00:25:49,735 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-09-01 00:25:49,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 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-09-01 00:25:49,736 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 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-09-01 00:25:49,736 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 48 flow. Second operand 3 states and 299 transitions. [2023-09-01 00:25:49,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 29 transitions, 123 flow [2023-09-01 00:25:49,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 29 transitions, 119 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 00:25:49,738 INFO L231 Difference]: Finished difference. Result has 28 places, 23 transitions, 74 flow [2023-09-01 00:25:49,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=28, PETRI_TRANSITIONS=23} [2023-09-01 00:25:49,738 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -8 predicate places. [2023-09-01 00:25:49,739 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 23 transitions, 74 flow [2023-09-01 00:25:49,739 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-09-01 00:25:49,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:49,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 00:25:49,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 00:25:49,740 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:25:49,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:49,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1681684239, now seen corresponding path program 1 times [2023-09-01 00:25:49,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 00:25:49,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678212609] [2023-09-01 00:25:49,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:49,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 00:25:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:25:49,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:49,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 00:25:49,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678212609] [2023-09-01 00:25:49,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678212609] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:49,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:49,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 00:25:49,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920487327] [2023-09-01 00:25:49,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:49,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:25:49,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 00:25:49,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:25:49,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:25:49,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 192 [2023-09-01 00:25:49,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 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-09-01 00:25:49,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:49,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 192 [2023-09-01 00:25:49,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:49,889 INFO L130 PetriNetUnfolder]: 43/120 cut-off events. [2023-09-01 00:25:49,890 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-09-01 00:25:49,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 120 events. 43/120 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 376 event pairs, 14 based on Foata normal form. 14/134 useless extension candidates. Maximal degree in co-relation 287. Up to 71 conditions per place. [2023-09-01 00:25:49,891 INFO L137 encePairwiseOnDemand]: 186/192 looper letters, 19 selfloop transitions, 6 changer transitions 0/27 dead transitions. [2023-09-01 00:25:49,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 27 transitions, 132 flow [2023-09-01 00:25:49,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:25:49,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:25:49,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2023-09-01 00:25:49,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-09-01 00:25:49,893 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 288 transitions. [2023-09-01 00:25:49,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 288 transitions. [2023-09-01 00:25:49,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:49,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 288 transitions. [2023-09-01 00:25:49,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:49,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 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-09-01 00:25:49,895 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 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-09-01 00:25:49,895 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 74 flow. Second operand 3 states and 288 transitions. [2023-09-01 00:25:49,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 27 transitions, 132 flow [2023-09-01 00:25:49,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 27 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 00:25:49,897 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 74 flow [2023-09-01 00:25:49,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2023-09-01 00:25:49,898 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -8 predicate places. [2023-09-01 00:25:49,898 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 74 flow [2023-09-01 00:25:49,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 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-09-01 00:25:49,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:49,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 00:25:49,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 00:25:49,899 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:25:49,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:49,900 INFO L85 PathProgramCache]: Analyzing trace with hash -841500956, now seen corresponding path program 1 times [2023-09-01 00:25:49,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 00:25:49,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310452286] [2023-09-01 00:25:49,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:49,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 00:25:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 00:25:49,923 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 00:25:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 00:25:49,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 00:25:49,956 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 00:25:49,957 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location f1Err0ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-09-01 00:25:49,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2023-09-01 00:25:49,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-09-01 00:25:49,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-09-01 00:25:49,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-09-01 00:25:49,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-09-01 00:25:49,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-09-01 00:25:49,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-09-01 00:25:49,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2023-09-01 00:25:49,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (3 of 13 remaining) [2023-09-01 00:25:49,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-09-01 00:25:49,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-09-01 00:25:49,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-09-01 00:25:49,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 00:25:49,961 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 00:25:49,967 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 00:25:49,967 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 00:25:49,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 12:25:49 BasicIcfg [2023-09-01 00:25:49,992 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 00:25:49,992 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 00:25:49,992 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 00:25:49,993 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 00:25:49,993 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 12:25:43" (3/4) ... [2023-09-01 00:25:49,995 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-09-01 00:25:49,995 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 00:25:49,996 INFO L158 Benchmark]: Toolchain (without parser) took 7530.69ms. Allocated memory was 69.2MB in the beginning and 134.2MB in the end (delta: 65.0MB). Free memory was 32.9MB in the beginning and 36.0MB in the end (delta: -3.1MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. [2023-09-01 00:25:49,996 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 69.2MB. Free memory was 46.2MB in the beginning and 46.2MB in the end (delta: 48.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 00:25:49,997 INFO L158 Benchmark]: CACSL2BoogieTranslator took 688.35ms. Allocated memory was 69.2MB in the beginning and 90.2MB in the end (delta: 21.0MB). Free memory was 32.7MB in the beginning and 49.6MB in the end (delta: -16.9MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2023-09-01 00:25:49,997 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.41ms. Allocated memory is still 90.2MB. Free memory was 49.6MB in the beginning and 46.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-09-01 00:25:49,997 INFO L158 Benchmark]: Boogie Preprocessor took 35.19ms. Allocated memory is still 90.2MB. Free memory was 46.8MB in the beginning and 44.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 00:25:49,998 INFO L158 Benchmark]: RCFGBuilder took 659.23ms. Allocated memory is still 90.2MB. Free memory was 44.0MB in the beginning and 46.8MB in the end (delta: -2.8MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2023-09-01 00:25:49,998 INFO L158 Benchmark]: TraceAbstraction took 6085.10ms. Allocated memory was 90.2MB in the beginning and 134.2MB in the end (delta: 44.0MB). Free memory was 46.4MB in the beginning and 36.0MB in the end (delta: 10.4MB). Peak memory consumption was 54.7MB. Max. memory is 16.1GB. [2023-09-01 00:25:49,998 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 134.2MB. Free memory is still 36.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 00:25:50,000 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.23ms. Allocated memory is still 69.2MB. Free memory was 46.2MB in the beginning and 46.2MB in the end (delta: 48.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 688.35ms. Allocated memory was 69.2MB in the beginning and 90.2MB in the end (delta: 21.0MB). Free memory was 32.7MB in the beginning and 49.6MB in the end (delta: -16.9MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.41ms. Allocated memory is still 90.2MB. Free memory was 49.6MB in the beginning and 46.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.19ms. Allocated memory is still 90.2MB. Free memory was 46.8MB in the beginning and 44.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 659.23ms. Allocated memory is still 90.2MB. Free memory was 44.0MB in the beginning and 46.8MB in the end (delta: -2.8MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6085.10ms. Allocated memory was 90.2MB in the beginning and 134.2MB in the end (delta: 44.0MB). Free memory was 46.4MB in the beginning and 36.0MB in the end (delta: 10.4MB). Peak memory consumption was 54.7MB. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 134.2MB. Free memory is still 36.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 100 PlacesBefore, 36 PlacesAfterwards, 94 TransitionsBefore, 30 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 6 FixpointIterations, 51 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 92 TotalNumberOfCompositions, 2810 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1536, independent: 1393, independent conditional: 0, independent unconditional: 1393, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 555, independent: 530, independent conditional: 0, independent unconditional: 530, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1536, independent: 863, independent conditional: 0, independent unconditional: 863, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 555, unknown conditional: 0, unknown unconditional: 555] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L1351] 0 int g; [L1352] 0 pthread_mutex_t mut = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L1353] 0 pthread_cond_t cond = { { {0}, {0}, {0, 0}, {0, 0}, 0, 0, {0, 0} } }; [L1373] 0 pthread_t t1; [L1374] 0 pthread_t t2; [L1375] FCALL, FORK 0 pthread_create(&t1,((void *)0),f1,((void *)0)) VAL [\old(argc)=1152, argc=1152, argv={1150:1151}, argv={1150:1151}, cond={4:0}, g=0, mut={3:0}, pthread_create(&t1,((void *)0),f1,((void *)0))=-1, t1={6:0}, t2={5:0}] [L1356] 1 g = 1 VAL [cond={4:0}, g=1, mut={3:0}, ptr={0:0}, ptr={0:0}] [L1377] FCALL, FORK 0 pthread_create(&t2,((void *)0),f2,((void *)0)) VAL [\old(argc)=1152, argc=1152, argv={1150:1151}, argv={1150:1151}, cond={4:0}, g=1, mut={3:0}, pthread_create(&t2,((void *)0),f2,((void *)0))=0, ptr={0:0}, t1={6:0}, t2={5:0}] [L1366] 2 g = 0 VAL [cond={4:0}, g=0, mut={3:0}, ptr={0:0}, ptr={0:0}] [L1369] 2 return ((void *)0); [L1358] CALL 1 __VERIFIER_assert(g == 1) [L19] COND TRUE 1 !(cond) [L19] 1 reach_error() VAL [\old(cond)=0, \result={0:0}, cond=0, cond={4:0}, g=0, mut={3:0}, ptr={0:0}, ptr={0: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: 1371]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1375]: 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: 1377]: 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, 130 locations, 13 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: 6.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 372 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 193 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 416 IncrementalHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 47 mSDtfsCounter, 416 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=6, InterpolantAutomatonStates: 20, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 134 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-09-01 00:25:50,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_true.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 4f5c1949da3ffd7703b26279578bf3cad55c86e8b0ffaff69f49645cdd541f53 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 00:25:51,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 00:25:51,977 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 00:25:52,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 00:25:52,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 00:25:52,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 00:25:52,027 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 00:25:52,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 00:25:52,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 00:25:52,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 00:25:52,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 00:25:52,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 00:25:52,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 00:25:52,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 00:25:52,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 00:25:52,046 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 00:25:52,047 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 00:25:52,048 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 00:25:52,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 00:25:52,050 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 00:25:52,051 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 00:25:52,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 00:25:52,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 00:25:52,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 00:25:52,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 00:25:52,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 00:25:52,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 00:25:52,063 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 00:25:52,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 00:25:52,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 00:25:52,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 00:25:52,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 00:25:52,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 00:25:52,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 00:25:52,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 00:25:52,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 00:25:52,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 00:25:52,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 00:25:52,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 00:25:52,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 00:25:52,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 00:25:52,076 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-09-01 00:25:52,095 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 00:25:52,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 00:25:52,096 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 00:25:52,096 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 00:25:52,097 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 00:25:52,097 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 00:25:52,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 00:25:52,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 00:25:52,099 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 00:25:52,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 00:25:52,100 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 00:25:52,100 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-01 00:25:52,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 00:25:52,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 00:25:52,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 00:25:52,101 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-09-01 00:25:52,101 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-09-01 00:25:52,101 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-09-01 00:25:52,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 00:25:52,102 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-09-01 00:25:52,102 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-09-01 00:25:52,102 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-09-01 00:25:52,102 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 00:25:52,102 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 00:25:52,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 00:25:52,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 00:25:52,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 00:25:52,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 00:25:52,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 00:25:52,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 00:25:52,104 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-09-01 00:25:52,104 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-09-01 00:25:52,104 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 00:25:52,104 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 00:25:52,104 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 00:25:52,105 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-09-01 00:25:52,105 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 00:25:52,105 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 -> 4f5c1949da3ffd7703b26279578bf3cad55c86e8b0ffaff69f49645cdd541f53 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 00:25:52,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 00:25:52,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 00:25:52,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 00:25:52,445 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 00:25:52,445 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 00:25:52,446 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_true.i [2023-09-01 00:25:53,689 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 00:25:53,949 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 00:25:53,950 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_true.i [2023-09-01 00:25:53,977 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3c659b41/20f0a1cc02b741209a99d048cf7e364a/FLAGba83ead6a [2023-09-01 00:25:53,993 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3c659b41/20f0a1cc02b741209a99d048cf7e364a [2023-09-01 00:25:53,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 00:25:53,996 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 00:25:53,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 00:25:53,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 00:25:54,000 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 00:25:54,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 12:25:53" (1/1) ... [2023-09-01 00:25:54,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c6abf02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:54, skipping insertion in model container [2023-09-01 00:25:54,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 12:25:53" (1/1) ... [2023-09-01 00:25:54,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 00:25:54,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 00:25:54,193 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_true.i[1094,1107] [2023-09-01 00:25:54,477 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 00:25:54,494 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 00:25:54,506 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_true.i[1094,1107] [2023-09-01 00:25:54,555 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 00:25:54,665 WARN L667 CHandler]: The function sleep is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 00:25:54,671 INFO L208 MainTranslator]: Completed translation [2023-09-01 00:25:54,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:54 WrapperNode [2023-09-01 00:25:54,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 00:25:54,673 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 00:25:54,673 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 00:25:54,673 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 00:25:54,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:54" (1/1) ... [2023-09-01 00:25:54,711 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:54" (1/1) ... [2023-09-01 00:25:54,747 INFO L138 Inliner]: procedures = 358, calls = 38, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2023-09-01 00:25:54,748 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 00:25:54,748 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 00:25:54,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 00:25:54,749 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 00:25:54,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:54" (1/1) ... [2023-09-01 00:25:54,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:54" (1/1) ... [2023-09-01 00:25:54,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:54" (1/1) ... [2023-09-01 00:25:54,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:54" (1/1) ... [2023-09-01 00:25:54,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:54" (1/1) ... [2023-09-01 00:25:54,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:54" (1/1) ... [2023-09-01 00:25:54,798 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:54" (1/1) ... [2023-09-01 00:25:54,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:54" (1/1) ... [2023-09-01 00:25:54,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 00:25:54,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 00:25:54,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 00:25:54,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 00:25:54,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:54" (1/1) ... [2023-09-01 00:25:54,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 00:25:54,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 00:25:54,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 00:25:54,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 00:25:54,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-09-01 00:25:54,885 INFO L130 BoogieDeclarations]: Found specification of procedure sleep [2023-09-01 00:25:54,885 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2023-09-01 00:25:54,885 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2023-09-01 00:25:54,885 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2023-09-01 00:25:54,886 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2023-09-01 00:25:54,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 00:25:54,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 00:25:54,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-09-01 00:25:54,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-09-01 00:25:54,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-09-01 00:25:54,887 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-01 00:25:54,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 00:25:54,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 00:25:54,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 00:25:54,888 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 00:25:55,221 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 00:25:55,223 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 00:25:55,475 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 00:25:55,485 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 00:25:55,485 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 00:25:55,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 12:25:55 BoogieIcfgContainer [2023-09-01 00:25:55,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 00:25:55,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 00:25:55,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 00:25:55,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 00:25:55,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 12:25:53" (1/3) ... [2023-09-01 00:25:55,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ff09f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 12:25:55, skipping insertion in model container [2023-09-01 00:25:55,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:54" (2/3) ... [2023-09-01 00:25:55,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ff09f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 12:25:55, skipping insertion in model container [2023-09-01 00:25:55,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 12:25:55" (3/3) ... [2023-09-01 00:25:55,496 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_67-pthread_cond_wait_true.i [2023-09-01 00:25:55,512 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 00:25:55,513 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-09-01 00:25:55,513 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 00:25:55,611 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-01 00:25:55,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 101 transitions, 218 flow [2023-09-01 00:25:55,705 INFO L130 PetriNetUnfolder]: 1/99 cut-off events. [2023-09-01 00:25:55,705 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 00:25:55,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 99 events. 1/99 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 89 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2023-09-01 00:25:55,710 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 101 transitions, 218 flow [2023-09-01 00:25:55,716 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 95 transitions, 202 flow [2023-09-01 00:25:55,720 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 00:25:55,734 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 95 transitions, 202 flow [2023-09-01 00:25:55,737 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 95 transitions, 202 flow [2023-09-01 00:25:55,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 95 transitions, 202 flow [2023-09-01 00:25:55,771 INFO L130 PetriNetUnfolder]: 1/95 cut-off events. [2023-09-01 00:25:55,771 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 00:25:55,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 95 events. 1/95 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 88 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2023-09-01 00:25:55,774 INFO L119 LiptonReduction]: Number of co-enabled transitions 1020 [2023-09-01 00:26:04,670 INFO L134 LiptonReduction]: Checked pairs total: 3050 [2023-09-01 00:26:04,671 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-09-01 00:26:04,682 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 00:26:04,687 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;@11e03474, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 00:26:04,688 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-09-01 00:26:04,690 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-09-01 00:26:04,690 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:26:04,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:26:04,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-09-01 00:26:04,691 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:26:04,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:26:04,695 INFO L85 PathProgramCache]: Analyzing trace with hash 358, now seen corresponding path program 1 times [2023-09-01 00:26:04,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 00:26:04,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525647504] [2023-09-01 00:26:04,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:26:04,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:04,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 00:26:04,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-09-01 00:26:04,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-09-01 00:26:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:26:04,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-09-01 00:26:04,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 00:26:04,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:26:04,838 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 00:26:04,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 00:26:04,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525647504] [2023-09-01 00:26:04,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525647504] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:26:04,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:26:04,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-09-01 00:26:04,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105908226] [2023-09-01 00:26:04,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:26:04,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-01 00:26:04,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 00:26:04,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-01 00:26:04,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-01 00:26:04,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 193 [2023-09-01 00:26:04,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 72 flow. Second operand has 2 states, 2 states have (on average 95.5) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:04,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:26:04,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 193 [2023-09-01 00:26:04,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:26:05,034 INFO L130 PetriNetUnfolder]: 161/313 cut-off events. [2023-09-01 00:26:05,035 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2023-09-01 00:26:05,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 313 events. 161/313 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1278 event pairs, 161 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 585. Up to 305 conditions per place. [2023-09-01 00:26:05,038 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 24 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-09-01 00:26:05,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 26 transitions, 112 flow [2023-09-01 00:26:05,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-01 00:26:05,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-09-01 00:26:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 217 transitions. [2023-09-01 00:26:05,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5621761658031088 [2023-09-01 00:26:05,056 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 217 transitions. [2023-09-01 00:26:05,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 217 transitions. [2023-09-01 00:26:05,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:26:05,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 217 transitions. [2023-09-01 00:26:05,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 108.5) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:05,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:05,089 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:05,090 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 72 flow. Second operand 2 states and 217 transitions. [2023-09-01 00:26:05,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 26 transitions, 112 flow [2023-09-01 00:26:05,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 00:26:05,097 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 56 flow [2023-09-01 00:26:05,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2023-09-01 00:26:05,104 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-09-01 00:26:05,105 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 56 flow [2023-09-01 00:26:05,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 95.5) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:05,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:26:05,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 00:26:05,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-09-01 00:26:05,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:05,323 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:26:05,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:26:05,323 INFO L85 PathProgramCache]: Analyzing trace with hash 352595, now seen corresponding path program 1 times [2023-09-01 00:26:05,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 00:26:05,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972481985] [2023-09-01 00:26:05,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:26:05,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:05,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 00:26:05,326 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-09-01 00:26:05,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-09-01 00:26:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:26:05,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2023-09-01 00:26:05,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 00:26:05,502 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-09-01 00:26:05,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 19 [2023-09-01 00:26:05,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:26:05,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 00:26:05,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 00:26:05,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972481985] [2023-09-01 00:26:05,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972481985] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:26:05,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:26:05,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 00:26:05,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35990991] [2023-09-01 00:26:05,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:26:05,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:26:05,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 00:26:05,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:26:05,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:26:05,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 193 [2023-09-01 00:26:05,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:05,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:26:05,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 193 [2023-09-01 00:26:05,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:26:05,685 INFO L130 PetriNetUnfolder]: 152/292 cut-off events. [2023-09-01 00:26:05,686 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:26:05,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 292 events. 152/292 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1181 event pairs, 152 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 585. Up to 283 conditions per place. [2023-09-01 00:26:05,688 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 20 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2023-09-01 00:26:05,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 24 transitions, 96 flow [2023-09-01 00:26:05,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:26:05,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:26:05,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2023-09-01 00:26:05,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48704663212435234 [2023-09-01 00:26:05,691 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 282 transitions. [2023-09-01 00:26:05,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 282 transitions. [2023-09-01 00:26:05,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:26:05,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 282 transitions. [2023-09-01 00:26:05,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-09-01 00:26:05,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:05,695 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:05,695 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 56 flow. Second operand 3 states and 282 transitions. [2023-09-01 00:26:05,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 24 transitions, 96 flow [2023-09-01 00:26:05,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 00:26:05,696 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 56 flow [2023-09-01 00:26:05,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2023-09-01 00:26:05,697 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-09-01 00:26:05,698 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 56 flow [2023-09-01 00:26:05,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:05,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:26:05,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 00:26:05,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-09-01 00:26:05,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:05,910 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:26:05,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:26:05,910 INFO L85 PathProgramCache]: Analyzing trace with hash 352596, now seen corresponding path program 1 times [2023-09-01 00:26:05,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 00:26:05,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747615775] [2023-09-01 00:26:05,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:26:05,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:05,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 00:26:05,913 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-09-01 00:26:05,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-09-01 00:26:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:26:06,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 00:26:06,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 00:26:06,064 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 00:26:06,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-09-01 00:26:06,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:26:06,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 00:26:06,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 00:26:06,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747615775] [2023-09-01 00:26:06,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747615775] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:26:06,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:26:06,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 00:26:06,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328606704] [2023-09-01 00:26:06,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:26:06,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:26:06,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 00:26:06,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:26:06,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:26:06,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 193 [2023-09-01 00:26:06,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 56 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-09-01 00:26:06,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:26:06,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 193 [2023-09-01 00:26:06,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:26:06,223 INFO L130 PetriNetUnfolder]: 143/271 cut-off events. [2023-09-01 00:26:06,224 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:26:06,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550 conditions, 271 events. 143/271 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1067 event pairs, 143 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 546. Up to 263 conditions per place. [2023-09-01 00:26:06,226 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 18 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2023-09-01 00:26:06,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 22 transitions, 92 flow [2023-09-01 00:26:06,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:26:06,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:26:06,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2023-09-01 00:26:06,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5043177892918825 [2023-09-01 00:26:06,229 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 292 transitions. [2023-09-01 00:26:06,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 292 transitions. [2023-09-01 00:26:06,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:26:06,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 292 transitions. [2023-09-01 00:26:06,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:06,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:06,233 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:06,233 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 56 flow. Second operand 3 states and 292 transitions. [2023-09-01 00:26:06,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 22 transitions, 92 flow [2023-09-01 00:26:06,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 22 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 00:26:06,234 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 52 flow [2023-09-01 00:26:06,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2023-09-01 00:26:06,235 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -8 predicate places. [2023-09-01 00:26:06,235 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 52 flow [2023-09-01 00:26:06,236 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-09-01 00:26:06,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:26:06,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 00:26:06,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-09-01 00:26:06,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:06,450 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:26:06,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:26:06,451 INFO L85 PathProgramCache]: Analyzing trace with hash 338853223, now seen corresponding path program 1 times [2023-09-01 00:26:06,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 00:26:06,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133384250] [2023-09-01 00:26:06,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:26:06,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:06,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 00:26:06,453 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-09-01 00:26:06,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-09-01 00:26:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:26:06,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 00:26:06,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 00:26:06,602 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-01 00:26:06,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-09-01 00:26:06,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:26:06,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 00:26:06,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 00:26:06,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133384250] [2023-09-01 00:26:06,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133384250] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:26:06,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:26:06,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 00:26:06,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128710024] [2023-09-01 00:26:06,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:26:06,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:26:06,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 00:26:06,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:26:06,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:26:06,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 193 [2023-09-01 00:26:06,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:06,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:26:06,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 193 [2023-09-01 00:26:06,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:26:06,761 INFO L130 PetriNetUnfolder]: 106/210 cut-off events. [2023-09-01 00:26:06,762 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:26:06,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 210 events. 106/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 771 event pairs, 106 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 424. Up to 202 conditions per place. [2023-09-01 00:26:06,765 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 17 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2023-09-01 00:26:06,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 88 flow [2023-09-01 00:26:06,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:26:06,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:26:06,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2023-09-01 00:26:06,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48013816925734026 [2023-09-01 00:26:06,767 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 278 transitions. [2023-09-01 00:26:06,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 278 transitions. [2023-09-01 00:26:06,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:26:06,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 278 transitions. [2023-09-01 00:26:06,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:06,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:06,770 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:06,770 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 52 flow. Second operand 3 states and 278 transitions. [2023-09-01 00:26:06,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 88 flow [2023-09-01 00:26:06,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 21 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 00:26:06,771 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 50 flow [2023-09-01 00:26:06,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=25, 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=27, PETRI_TRANSITIONS=21} [2023-09-01 00:26:06,773 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -9 predicate places. [2023-09-01 00:26:06,773 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 50 flow [2023-09-01 00:26:06,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:06,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:26:06,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 00:26:06,788 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-09-01 00:26:06,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:06,985 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:26:06,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:26:06,986 INFO L85 PathProgramCache]: Analyzing trace with hash 338853221, now seen corresponding path program 1 times [2023-09-01 00:26:06,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 00:26:06,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398482980] [2023-09-01 00:26:06,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:26:06,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:06,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 00:26:06,988 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-09-01 00:26:06,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-09-01 00:26:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:26:07,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2023-09-01 00:26:07,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 00:26:07,141 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-09-01 00:26:07,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2023-09-01 00:26:07,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:26:07,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 00:26:07,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 00:26:07,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398482980] [2023-09-01 00:26:07,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398482980] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:26:07,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:26:07,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 00:26:07,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413780358] [2023-09-01 00:26:07,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:26:07,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:26:07,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 00:26:07,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:26:07,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:26:07,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 193 [2023-09-01 00:26:07,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:07,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:26:07,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 193 [2023-09-01 00:26:07,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:26:07,311 INFO L130 PetriNetUnfolder]: 69/149 cut-off events. [2023-09-01 00:26:07,311 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:26:07,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 149 events. 69/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 487 event pairs, 69 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 302. Up to 141 conditions per place. [2023-09-01 00:26:07,314 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 16 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2023-09-01 00:26:07,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 84 flow [2023-09-01 00:26:07,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:26:07,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:26:07,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions. [2023-09-01 00:26:07,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4991364421416235 [2023-09-01 00:26:07,316 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 289 transitions. [2023-09-01 00:26:07,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 289 transitions. [2023-09-01 00:26:07,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:26:07,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 289 transitions. [2023-09-01 00:26:07,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:07,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:07,319 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:07,319 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 50 flow. Second operand 3 states and 289 transitions. [2023-09-01 00:26:07,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 84 flow [2023-09-01 00:26:07,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 00:26:07,320 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 48 flow [2023-09-01 00:26:07,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2023-09-01 00:26:07,322 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -10 predicate places. [2023-09-01 00:26:07,322 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 48 flow [2023-09-01 00:26:07,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:07,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:26:07,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 00:26:07,334 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-09-01 00:26:07,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:07,535 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:26:07,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:26:07,536 INFO L85 PathProgramCache]: Analyzing trace with hash -812698289, now seen corresponding path program 1 times [2023-09-01 00:26:07,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 00:26:07,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241336053] [2023-09-01 00:26:07,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:26:07,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:07,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 00:26:07,538 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-09-01 00:26:07,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-09-01 00:26:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:26:07,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 00:26:07,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 00:26:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:26:07,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 00:26:07,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 00:26:07,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241336053] [2023-09-01 00:26:07,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241336053] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:26:07,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:26:07,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 00:26:07,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424262511] [2023-09-01 00:26:07,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:26:07,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:26:07,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 00:26:07,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:26:07,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:26:07,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 193 [2023-09-01 00:26:07,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 48 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-09-01 00:26:07,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:26:07,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 193 [2023-09-01 00:26:07,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:26:07,755 INFO L130 PetriNetUnfolder]: 97/204 cut-off events. [2023-09-01 00:26:07,755 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:26:07,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 204 events. 97/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 710 event pairs, 55 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 408. Up to 131 conditions per place. [2023-09-01 00:26:07,757 INFO L137 encePairwiseOnDemand]: 188/193 looper letters, 24 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2023-09-01 00:26:07,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 29 transitions, 123 flow [2023-09-01 00:26:07,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:26:07,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:26:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2023-09-01 00:26:07,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5215889464594128 [2023-09-01 00:26:07,759 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 302 transitions. [2023-09-01 00:26:07,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 302 transitions. [2023-09-01 00:26:07,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:26:07,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 302 transitions. [2023-09-01 00:26:07,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-09-01 00:26:07,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:07,762 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:07,762 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 48 flow. Second operand 3 states and 302 transitions. [2023-09-01 00:26:07,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 29 transitions, 123 flow [2023-09-01 00:26:07,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 29 transitions, 119 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 00:26:07,765 INFO L231 Difference]: Finished difference. Result has 28 places, 23 transitions, 74 flow [2023-09-01 00:26:07,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=28, PETRI_TRANSITIONS=23} [2023-09-01 00:26:07,766 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -8 predicate places. [2023-09-01 00:26:07,766 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 23 transitions, 74 flow [2023-09-01 00:26:07,766 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-09-01 00:26:07,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:26:07,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 00:26:07,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-09-01 00:26:07,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:07,977 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:26:07,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:26:07,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1926286577, now seen corresponding path program 1 times [2023-09-01 00:26:07,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 00:26:07,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985664009] [2023-09-01 00:26:07,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:26:07,979 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:07,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 00:26:07,980 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-09-01 00:26:07,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-09-01 00:26:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:26:08,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 00:26:08,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 00:26:08,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-09-01 00:26:08,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:26:08,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 00:26:08,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 00:26:08,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985664009] [2023-09-01 00:26:08,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985664009] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:26:08,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:26:08,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 00:26:08,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77005893] [2023-09-01 00:26:08,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:26:08,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:26:08,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 00:26:08,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:26:08,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:26:08,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 193 [2023-09-01 00:26:08,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:08,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:26:08,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 193 [2023-09-01 00:26:08,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:26:08,225 INFO L130 PetriNetUnfolder]: 43/120 cut-off events. [2023-09-01 00:26:08,225 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-09-01 00:26:08,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 120 events. 43/120 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 379 event pairs, 14 based on Foata normal form. 14/134 useless extension candidates. Maximal degree in co-relation 287. Up to 71 conditions per place. [2023-09-01 00:26:08,226 INFO L137 encePairwiseOnDemand]: 187/193 looper letters, 19 selfloop transitions, 6 changer transitions 0/27 dead transitions. [2023-09-01 00:26:08,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 27 transitions, 132 flow [2023-09-01 00:26:08,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:26:08,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:26:08,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2023-09-01 00:26:08,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5025906735751295 [2023-09-01 00:26:08,228 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 291 transitions. [2023-09-01 00:26:08,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 291 transitions. [2023-09-01 00:26:08,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:26:08,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 291 transitions. [2023-09-01 00:26:08,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:08,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:08,231 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:08,231 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 74 flow. Second operand 3 states and 291 transitions. [2023-09-01 00:26:08,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 27 transitions, 132 flow [2023-09-01 00:26:08,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 27 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 00:26:08,233 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 74 flow [2023-09-01 00:26:08,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2023-09-01 00:26:08,234 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -8 predicate places. [2023-09-01 00:26:08,234 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 74 flow [2023-09-01 00:26:08,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:08,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:26:08,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 00:26:08,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 (8)] Forceful destruction successful, exit code 0 [2023-09-01 00:26:08,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:08,447 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:26:08,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:26:08,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1559594338, now seen corresponding path program 1 times [2023-09-01 00:26:08,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 00:26:08,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971615467] [2023-09-01 00:26:08,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:26:08,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:08,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 00:26:08,449 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-09-01 00:26:08,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-09-01 00:26:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 00:26:08,580 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 00:26:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 00:26:08,681 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-09-01 00:26:08,681 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 00:26:08,682 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location f1Err0ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-09-01 00:26:08,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2023-09-01 00:26:08,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-09-01 00:26:08,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-09-01 00:26:08,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-09-01 00:26:08,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-09-01 00:26:08,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-09-01 00:26:08,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-09-01 00:26:08,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2023-09-01 00:26:08,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (3 of 13 remaining) [2023-09-01 00:26:08,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-09-01 00:26:08,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-09-01 00:26:08,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-09-01 00:26:08,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-09-01 00:26:08,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:08,885 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 00:26:08,890 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 00:26:08,890 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 00:26:08,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 12:26:08 BasicIcfg [2023-09-01 00:26:08,923 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 00:26:08,924 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 00:26:08,924 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 00:26:08,924 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 00:26:08,924 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 12:25:55" (3/4) ... [2023-09-01 00:26:08,926 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-09-01 00:26:08,926 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 00:26:08,927 INFO L158 Benchmark]: Toolchain (without parser) took 14931.22ms. Allocated memory was 65.0MB in the beginning and 107.0MB in the end (delta: 41.9MB). Free memory was 41.3MB in the beginning and 68.2MB in the end (delta: -26.9MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2023-09-01 00:26:08,927 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 65.0MB. Free memory is still 42.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 00:26:08,927 INFO L158 Benchmark]: CACSL2BoogieTranslator took 675.32ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 41.2MB in the beginning and 49.9MB in the end (delta: -8.8MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2023-09-01 00:26:08,927 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.65ms. Allocated memory is still 79.7MB. Free memory was 49.9MB in the beginning and 47.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 00:26:08,928 INFO L158 Benchmark]: Boogie Preprocessor took 68.42ms. Allocated memory is still 79.7MB. Free memory was 47.0MB in the beginning and 44.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-09-01 00:26:08,928 INFO L158 Benchmark]: RCFGBuilder took 670.56ms. Allocated memory is still 79.7MB. Free memory was 44.0MB in the beginning and 39.2MB in the end (delta: 4.8MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2023-09-01 00:26:08,928 INFO L158 Benchmark]: TraceAbstraction took 13433.12ms. Allocated memory was 79.7MB in the beginning and 107.0MB in the end (delta: 27.3MB). Free memory was 38.5MB in the beginning and 68.2MB in the end (delta: -29.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 00:26:08,928 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 107.0MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 00:26:08,929 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.20ms. Allocated memory is still 65.0MB. Free memory is still 42.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 675.32ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 41.2MB in the beginning and 49.9MB in the end (delta: -8.8MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.65ms. Allocated memory is still 79.7MB. Free memory was 49.9MB in the beginning and 47.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.42ms. Allocated memory is still 79.7MB. Free memory was 47.0MB in the beginning and 44.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 670.56ms. Allocated memory is still 79.7MB. Free memory was 44.0MB in the beginning and 39.2MB in the end (delta: 4.8MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13433.12ms. Allocated memory was 79.7MB in the beginning and 107.0MB in the end (delta: 27.3MB). Free memory was 38.5MB in the beginning and 68.2MB in the end (delta: -29.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 107.0MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.9s, 101 PlacesBefore, 36 PlacesAfterwards, 95 TransitionsBefore, 30 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 92 TotalNumberOfCompositions, 3050 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1622, independent: 1463, independent conditional: 0, independent unconditional: 1463, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 584, independent: 559, independent conditional: 0, independent unconditional: 559, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1622, independent: 904, independent conditional: 0, independent unconditional: 904, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 584, unknown conditional: 0, unknown unconditional: 584] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L1351] 0 int g; [L1352] 0 pthread_mutex_t mut = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L1353] 0 pthread_cond_t cond = { { {0}, {0}, {0, 0}, {0, 0}, 0, 0, {0, 0} } }; [L1373] 0 pthread_t t1; [L1374] 0 pthread_t t2; [L1375] FCALL, FORK 0 pthread_create(&t1,((void *)0),f1,((void *)0)) VAL [\old(argc)=200, argc=200, argv={202:201}, argv={202:201}, cond={4:0}, g=0, mut={3:0}, pthread_create(&t1,((void *)0),f1,((void *)0))=-1, t1={7:0}, t2={5:0}] [L1356] 1 g = 1 VAL [cond={4:0}, g=1, mut={3:0}, ptr={0:0}, ptr={0:0}] [L1377] FCALL, FORK 0 pthread_create(&t2,((void *)0),f2,((void *)0)) VAL [\old(argc)=200, argc=200, argv={202:201}, argv={202:201}, cond={4:0}, g=1, mut={3:0}, pthread_create(&t2,((void *)0),f2,((void *)0))=0, ptr={0:0}, t1={7:0}, t2={5:0}] [L1366] 2 g = 0 VAL [cond={4:0}, g=0, mut={3:0}, ptr={0:0}, ptr={0:0}] [L1369] 2 return ((void *)0); [L1358] CALL 1 __VERIFIER_assert(g == 1) [L19] COND TRUE 1 !(cond) [L19] 1 reach_error() VAL [\old(cond)=0, \result={0:0}, cond=0, cond={4:0}, g=0, mut={3:0}, ptr={0:0}, ptr={0: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: 1371]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1375]: 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: 1377]: 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, 131 locations, 13 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: 13.2s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 321 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 149 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 349 IncrementalHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 57 mSDtfsCounter, 349 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=6, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 134 SizeOfPredicates, 4 NumberOfNonLiveVariables, 477 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-09-01 00:26:08,948 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