/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_34-traces-minepp-L-needs-to-be-um_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 06:50:15,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 06:50:15,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 06:50:15,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 06:50:15,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 06:50:15,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 06:50:15,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 06:50:15,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 06:50:15,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 06:50:15,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 06:50:15,914 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 06:50:15,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 06:50:15,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 06:50:15,931 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 06:50:15,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 06:50:15,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 06:50:15,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 06:50:15,934 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 06:50:15,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 06:50:15,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 06:50:15,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 06:50:15,937 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 06:50:15,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 06:50:15,939 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 06:50:15,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 06:50:15,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 06:50:15,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 06:50:15,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 06:50:15,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 06:50:15,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 06:50:15,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 06:50:15,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 06:50:15,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 06:50:15,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 06:50:15,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 06:50:15,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 06:50:15,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 06:50:15,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 06:50:15,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 06:50:15,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 06:50:15,947 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 06:50:15,952 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 06:50:15,969 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 06:50:15,970 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 06:50:15,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 06:50:15,971 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 06:50:15,971 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 06:50:15,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 06:50:15,971 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 06:50:15,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 06:50:15,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 06:50:15,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 06:50:15,971 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 06:50:15,971 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 06:50:15,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 06:50:15,972 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 06:50:15,972 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 06:50:15,972 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 06:50:15,972 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 06:50:15,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 06:50:15,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 06:50:15,972 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 06:50:15,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 06:50:15,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:50:15,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 06:50:15,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 06:50:15,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 06:50:15,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 06:50:15,973 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 06:50:15,973 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 06:50:15,973 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 06:50:16,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 06:50:16,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 06:50:16,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 06:50:16,241 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 06:50:16,243 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 06:50:16,244 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_34-traces-minepp-L-needs-to-be-um_true.i [2022-12-13 06:50:17,184 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 06:50:17,406 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 06:50:17,406 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_34-traces-minepp-L-needs-to-be-um_true.i [2022-12-13 06:50:17,424 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b7995d5c/165bd3c79b60482b8237adaafceb864e/FLAG4c7d7e676 [2022-12-13 06:50:17,435 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b7995d5c/165bd3c79b60482b8237adaafceb864e [2022-12-13 06:50:17,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 06:50:17,437 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 06:50:17,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 06:50:17,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 06:50:17,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 06:50:17,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:50:17" (1/1) ... [2022-12-13 06:50:17,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c84f18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:17, skipping insertion in model container [2022-12-13 06:50:17,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:50:17" (1/1) ... [2022-12-13 06:50:17,446 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 06:50:17,478 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 06:50:17,576 WARN L237 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_34-traces-minepp-L-needs-to-be-um_true.i[1107,1120] [2022-12-13 06:50:17,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:50:17,704 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 06:50:17,712 WARN L237 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_34-traces-minepp-L-needs-to-be-um_true.i[1107,1120] [2022-12-13 06:50:17,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:50:17,770 INFO L208 MainTranslator]: Completed translation [2022-12-13 06:50:17,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:17 WrapperNode [2022-12-13 06:50:17,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 06:50:17,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 06:50:17,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 06:50:17,772 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 06:50:17,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:17" (1/1) ... [2022-12-13 06:50:17,803 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:17" (1/1) ... [2022-12-13 06:50:17,824 INFO L138 Inliner]: procedures = 163, calls = 38, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2022-12-13 06:50:17,824 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 06:50:17,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 06:50:17,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 06:50:17,825 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 06:50:17,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:17" (1/1) ... [2022-12-13 06:50:17,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:17" (1/1) ... [2022-12-13 06:50:17,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:17" (1/1) ... [2022-12-13 06:50:17,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:17" (1/1) ... [2022-12-13 06:50:17,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:17" (1/1) ... [2022-12-13 06:50:17,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:17" (1/1) ... [2022-12-13 06:50:17,850 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:17" (1/1) ... [2022-12-13 06:50:17,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:17" (1/1) ... [2022-12-13 06:50:17,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 06:50:17,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 06:50:17,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 06:50:17,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 06:50:17,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:17" (1/1) ... [2022-12-13 06:50:17,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:50:17,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 06:50:17,911 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) [2022-12-13 06:50:17,944 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 [2022-12-13 06:50:17,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 06:50:17,964 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 06:50:17,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 06:50:17,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 06:50:17,964 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-13 06:50:17,964 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-13 06:50:17,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 06:50:17,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 06:50:17,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 06:50:17,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 06:50:17,966 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 06:50:18,095 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 06:50:18,096 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 06:50:18,289 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 06:50:18,294 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 06:50:18,295 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 06:50:18,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:50:18 BoogieIcfgContainer [2022-12-13 06:50:18,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 06:50:18,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 06:50:18,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 06:50:18,300 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 06:50:18,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:50:17" (1/3) ... [2022-12-13 06:50:18,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1451ed11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:50:18, skipping insertion in model container [2022-12-13 06:50:18,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:17" (2/3) ... [2022-12-13 06:50:18,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1451ed11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:50:18, skipping insertion in model container [2022-12-13 06:50:18,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:50:18" (3/3) ... [2022-12-13 06:50:18,321 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_34-traces-minepp-L-needs-to-be-um_true.i [2022-12-13 06:50:18,335 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 06:50:18,335 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 06:50:18,335 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 06:50:18,392 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 06:50:18,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 84 transitions, 173 flow [2022-12-13 06:50:18,486 INFO L130 PetriNetUnfolder]: 2/83 cut-off events. [2022-12-13 06:50:18,486 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:50:18,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 83 events. 2/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2022-12-13 06:50:18,490 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 84 transitions, 173 flow [2022-12-13 06:50:18,495 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 75 transitions, 153 flow [2022-12-13 06:50:18,497 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:50:18,521 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 75 transitions, 153 flow [2022-12-13 06:50:18,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 75 transitions, 153 flow [2022-12-13 06:50:18,560 INFO L130 PetriNetUnfolder]: 1/75 cut-off events. [2022-12-13 06:50:18,560 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:50:18,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 75 events. 1/75 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2022-12-13 06:50:18,562 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 75 transitions, 153 flow [2022-12-13 06:50:18,562 INFO L226 LiptonReduction]: Number of co-enabled transitions 748 [2022-12-13 06:50:21,800 INFO L241 LiptonReduction]: Total number of compositions: 60 [2022-12-13 06:50:21,813 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 06:50:21,819 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=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@4773a731, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 06:50:21,819 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-13 06:50:21,823 INFO L130 PetriNetUnfolder]: 1/16 cut-off events. [2022-12-13 06:50:21,823 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:50:21,823 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:50:21,824 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 06:50:21,824 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 06:50:21,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:50:21,828 INFO L85 PathProgramCache]: Analyzing trace with hash -185855915, now seen corresponding path program 1 times [2022-12-13 06:50:21,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:50:21,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029873833] [2022-12-13 06:50:21,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:50:21,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:50:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:50:22,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:50:22,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:50:22,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029873833] [2022-12-13 06:50:22,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029873833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:50:22,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:50:22,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:50:22,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905308862] [2022-12-13 06:50:22,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:50:22,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:50:22,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:50:22,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:50:22,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:50:22,079 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 26 [2022-12-13 06:50:22,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:50:22,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:50:22,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 26 [2022-12-13 06:50:22,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:50:22,128 INFO L130 PetriNetUnfolder]: 48/144 cut-off events. [2022-12-13 06:50:22,128 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:50:22,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 144 events. 48/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 593 event pairs, 37 based on Foata normal form. 10/113 useless extension candidates. Maximal degree in co-relation 252. Up to 91 conditions per place. [2022-12-13 06:50:22,130 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 18 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2022-12-13 06:50:22,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 30 transitions, 107 flow [2022-12-13 06:50:22,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:50:22,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:50:22,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-13 06:50:22,138 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6025641025641025 [2022-12-13 06:50:22,140 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2022-12-13 06:50:22,141 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 30 transitions, 107 flow [2022-12-13 06:50:22,142 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 30 transitions, 107 flow [2022-12-13 06:50:22,143 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:50:22,143 INFO L89 Accepts]: Start accepts. Operand has 31 places, 30 transitions, 107 flow [2022-12-13 06:50:22,145 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:50:22,146 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:50:22,146 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 30 transitions, 107 flow [2022-12-13 06:50:22,152 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 30 transitions, 107 flow [2022-12-13 06:50:22,152 INFO L226 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-13 06:50:22,246 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:50:22,248 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 06:50:22,251 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 30 transitions, 107 flow [2022-12-13 06:50:22,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:50:22,251 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:50:22,251 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:50:22,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 06:50:22,252 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 06:50:22,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:50:22,253 INFO L85 PathProgramCache]: Analyzing trace with hash -620758090, now seen corresponding path program 1 times [2022-12-13 06:50:22,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:50:22,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428074561] [2022-12-13 06:50:22,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:50:22,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:50:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:50:22,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:50:22,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:50:22,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428074561] [2022-12-13 06:50:22,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428074561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:50:22,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:50:22,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:50:22,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076812655] [2022-12-13 06:50:22,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:50:22,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 06:50:22,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:50:22,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 06:50:22,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 06:50:22,467 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-13 06:50:22,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 30 transitions, 107 flow. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:50:22,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:50:22,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-13 06:50:22,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:50:22,582 INFO L130 PetriNetUnfolder]: 67/154 cut-off events. [2022-12-13 06:50:22,586 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-13 06:50:22,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 154 events. 67/154 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 537 event pairs, 18 based on Foata normal form. 25/141 useless extension candidates. Maximal degree in co-relation 408. Up to 96 conditions per place. [2022-12-13 06:50:22,587 INFO L137 encePairwiseOnDemand]: 17/27 looper letters, 12 selfloop transitions, 5 changer transitions 25/42 dead transitions. [2022-12-13 06:50:22,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 42 transitions, 231 flow [2022-12-13 06:50:22,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:50:22,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:50:22,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-13 06:50:22,591 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2022-12-13 06:50:22,592 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2022-12-13 06:50:22,592 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 42 transitions, 231 flow [2022-12-13 06:50:22,593 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 17 transitions, 99 flow [2022-12-13 06:50:22,593 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:50:22,593 INFO L89 Accepts]: Start accepts. Operand has 21 places, 17 transitions, 99 flow [2022-12-13 06:50:22,594 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:50:22,594 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:50:22,595 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 17 transitions, 99 flow [2022-12-13 06:50:22,596 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 17 transitions, 99 flow [2022-12-13 06:50:22,596 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:50:22,901 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [262] L710-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#pthreadsMutex_891| |v_~#C~0.base_237|))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_31| (ite (= v_~g~0_76 42) 1 0)) (= (select .cse0 |v_~#C~0.offset_237|) 0) (= (let ((.cse1 (store |v_#pthreadsMutex_891| |v_~#C~0.base_237| (store .cse0 |v_~#C~0.offset_237| 1)))) (store .cse1 |v_~#B~0.base_151| (store (select .cse1 |v_~#B~0.base_151|) |v_~#B~0.offset_151| 0))) |v_#pthreadsMutex_889|) (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_31| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_31| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_31|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_891|, ~#B~0.base=|v_~#B~0.base_151|, ~g~0=v_~g~0_76, ~#C~0.base=|v_~#C~0.base_237|, ~#C~0.offset=|v_~#C~0.offset_237|, ~#B~0.offset=|v_~#B~0.offset_151|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_889|, ~#B~0.base=|v_~#B~0.base_151|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_122|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_31|, ~g~0=v_~g~0_76, ~#C~0.base=|v_~#C~0.base_237|, ~#C~0.offset=|v_~#C~0.offset_237|, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_31|, ~#B~0.offset=|v_~#B~0.offset_151|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start___VERIFIER_assert_~cond#1] and [185] L691-->L692: Formula: (= |v_#pthreadsMutex_19| (store |v_#pthreadsMutex_20| |v_~#C~0.base_10| (store (select |v_#pthreadsMutex_20| |v_~#C~0.base_10|) |v_~#C~0.offset_10| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_20|, ~#C~0.base=|v_~#C~0.base_10|, ~#C~0.offset=|v_~#C~0.offset_10|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_19|, ~#C~0.base=|v_~#C~0.base_10|, ~#C~0.offset=|v_~#C~0.offset_10|} AuxVars[] AssignedVars[#pthreadsMutex] [2022-12-13 06:50:22,934 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [265] L705-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (select |v_#pthreadsMutex_907| |v_~#C~0.base_241|))) (and (= (let ((.cse0 (store |v_#pthreadsMutex_907| |v_~#C~0.base_241| (store .cse1 |v_~#C~0.offset_241| 1)))) (store .cse0 |v_~#A~0.base_175| (store (select .cse0 |v_~#A~0.base_175|) |v_~#A~0.offset_175| 0))) |v_#pthreadsMutex_905|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_35| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_35|) (= (ite (= v_~g~0_80 42) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_35|) (= (select .cse1 |v_~#C~0.offset_241|) 0) (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_35| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_907|, ~#A~0.offset=|v_~#A~0.offset_175|, ~g~0=v_~g~0_80, ~#C~0.base=|v_~#C~0.base_241|, ~#C~0.offset=|v_~#C~0.offset_241|, ~#A~0.base=|v_~#A~0.base_175|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_905|, ~#A~0.offset=|v_~#A~0.offset_175|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_35|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_56|, ~g~0=v_~g~0_80, ~#C~0.base=|v_~#C~0.base_241|, ~#C~0.offset=|v_~#C~0.offset_241|, ~#A~0.base=|v_~#A~0.base_175|, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_35|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start___VERIFIER_assert_~cond#1] and [185] L691-->L692: Formula: (= |v_#pthreadsMutex_19| (store |v_#pthreadsMutex_20| |v_~#C~0.base_10| (store (select |v_#pthreadsMutex_20| |v_~#C~0.base_10|) |v_~#C~0.offset_10| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_20|, ~#C~0.base=|v_~#C~0.base_10|, ~#C~0.offset=|v_~#C~0.offset_10|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_19|, ~#C~0.base=|v_~#C~0.base_10|, ~#C~0.offset=|v_~#C~0.offset_10|} AuxVars[] AssignedVars[#pthreadsMutex] [2022-12-13 06:50:22,968 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [267] L701-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_Out_10| 0)) (.cse0 (= 0 |v_ULTIMATE.start_main_~r~0#1_Out_2|)) (.cse6 (= (ite (= 42 v_~g~0_In_5) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_Out_10|)) (.cse7 (= |v_ULTIMATE.start_main_#t~nondet7#1_In_1| |v_ULTIMATE.start_main_~r~0#1_Out_2|)) (.cse8 (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_Out_10| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_Out_10|))) (or (let ((.cse5 (select |v_#pthreadsMutex_In_5| |v_~#B~0.base_In_2|))) (let ((.cse2 (store |v_#pthreadsMutex_In_5| |v_~#B~0.base_In_2| (store .cse5 |v_~#B~0.offset_In_2| 1)))) (let ((.cse3 (select .cse2 |v_~#C~0.base_In_3|))) (and .cse0 (= |v_ULTIMATE.start_main_#t~nondet8#1_Out_2| |v_ULTIMATE.start_main_#t~nondet8#1_In_1|) (= |v_#pthreadsMutex_Out_10| (let ((.cse1 (store .cse2 |v_~#C~0.base_In_3| (store .cse3 |v_~#C~0.offset_In_3| 1)))) (store .cse1 |v_~#B~0.base_In_2| (store (select .cse1 |v_~#B~0.base_In_2|) |v_~#B~0.offset_In_2| 0)))) .cse4 (= |v_ULTIMATE.start_main_#t~nondet9#1_Out_4| |v_ULTIMATE.start_main_#t~nondet9#1_In_1|) (= (select .cse3 |v_~#C~0.offset_In_3|) 0) (= (select .cse5 |v_~#B~0.offset_In_2|) 0) .cse6 .cse7 .cse8)))) (let ((.cse12 (select |v_#pthreadsMutex_In_5| |v_~#A~0.base_In_2|))) (let ((.cse10 (store |v_#pthreadsMutex_In_5| |v_~#A~0.base_In_2| (store .cse12 |v_~#A~0.offset_In_2| 1)))) (let ((.cse11 (select .cse10 |v_~#C~0.base_In_3|))) (and (= |v_ULTIMATE.start_main_#t~nondet10#1_In_1| |v_ULTIMATE.start_main_#t~nondet10#1_Out_2|) .cse4 (= |v_#pthreadsMutex_Out_10| (let ((.cse9 (store .cse10 |v_~#C~0.base_In_3| (store .cse11 |v_~#C~0.offset_In_3| 1)))) (store .cse9 |v_~#A~0.base_In_2| (store (select .cse9 |v_~#A~0.base_In_2|) |v_~#A~0.offset_In_2| 0)))) (not .cse0) (= (select .cse12 |v_~#A~0.offset_In_2|) 0) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet7#1_In_1| 2147483648)) (= |v_ULTIMATE.start_main_#t~nondet11#1_Out_6| |v_ULTIMATE.start_main_#t~nondet11#1_In_1|) (<= |v_ULTIMATE.start_main_#t~nondet7#1_In_1| 2147483647) .cse6 .cse7 (= (select .cse11 |v_~#C~0.offset_In_3|) 0) .cse8)))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_5|, ~#B~0.base=|v_~#B~0.base_In_2|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_In_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_In_1|, ~g~0=v_~g~0_In_5, ~#C~0.base=|v_~#C~0.base_In_3|, ~#B~0.offset=|v_~#B~0.offset_In_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_In_1|, ~#A~0.offset=|v_~#A~0.offset_In_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_In_1|, ~#C~0.offset=|v_~#C~0.offset_In_3|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_In_1|, ~#A~0.base=|v_~#A~0.base_In_2|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_Out_10|, ~#B~0.base=|v_~#B~0.base_In_2|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_main_~r~0#1=|v_ULTIMATE.start_main_~r~0#1_Out_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_Out_10|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_4|, ~g~0=v_~g~0_In_5, ~#C~0.base=|v_~#C~0.base_In_3|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_Out_2|, ~#B~0.offset=|v_~#B~0.offset_In_2|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_6|, ~#A~0.offset=|v_~#A~0.offset_In_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, ~#C~0.offset=|v_~#C~0.offset_In_3|, ~#A~0.base=|v_~#A~0.base_In_2|, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_Out_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, #pthreadsMutex, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~r~0#1, ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start___VERIFIER_assert_~cond#1] and [185] L691-->L692: Formula: (= |v_#pthreadsMutex_19| (store |v_#pthreadsMutex_20| |v_~#C~0.base_10| (store (select |v_#pthreadsMutex_20| |v_~#C~0.base_10|) |v_~#C~0.offset_10| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_20|, ~#C~0.base=|v_~#C~0.base_10|, ~#C~0.offset=|v_~#C~0.offset_10|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_19|, ~#C~0.base=|v_~#C~0.base_10|, ~#C~0.offset=|v_~#C~0.offset_10|} AuxVars[] AssignedVars[#pthreadsMutex] [2022-12-13 06:50:23,316 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 06:50:23,317 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 724 [2022-12-13 06:50:23,317 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 13 transitions, 87 flow [2022-12-13 06:50:23,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:50:23,317 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:50:23,317 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:50:23,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 06:50:23,318 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 06:50:23,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:50:23,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1462079301, now seen corresponding path program 1 times [2022-12-13 06:50:23,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:50:23,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021876598] [2022-12-13 06:50:23,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:50:23,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:50:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:50:23,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:50:23,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:50:23,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021876598] [2022-12-13 06:50:23,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021876598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:50:23,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:50:23,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:50:23,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981038661] [2022-12-13 06:50:23,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:50:23,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:50:23,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:50:23,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:50:23,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:50:23,431 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-13 06:50:23,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 13 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:50:23,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:50:23,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-13 06:50:23,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:50:23,454 INFO L130 PetriNetUnfolder]: 4/16 cut-off events. [2022-12-13 06:50:23,454 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:50:23,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 16 events. 4/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 1 based on Foata normal form. 1/15 useless extension candidates. Maximal degree in co-relation 56. Up to 14 conditions per place. [2022-12-13 06:50:23,455 INFO L137 encePairwiseOnDemand]: 10/13 looper letters, 7 selfloop transitions, 2 changer transitions 2/11 dead transitions. [2022-12-13 06:50:23,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 11 transitions, 91 flow [2022-12-13 06:50:23,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:50:23,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:50:23,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2022-12-13 06:50:23,456 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-13 06:50:23,456 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, -9 predicate places. [2022-12-13 06:50:23,456 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 11 transitions, 91 flow [2022-12-13 06:50:23,456 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 9 transitions, 75 flow [2022-12-13 06:50:23,457 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:50:23,457 INFO L89 Accepts]: Start accepts. Operand has 19 places, 9 transitions, 75 flow [2022-12-13 06:50:23,457 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:50:23,457 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:50:23,457 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 9 transitions, 75 flow [2022-12-13 06:50:23,458 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 9 transitions, 75 flow [2022-12-13 06:50:23,458 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:50:23,519 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:50:23,519 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-13 06:50:23,519 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 9 transitions, 77 flow [2022-12-13 06:50:23,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:50:23,520 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:50:23,520 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:50:23,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 06:50:23,520 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 06:50:23,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:50:23,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1461155777, now seen corresponding path program 1 times [2022-12-13 06:50:23,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:50:23,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45221861] [2022-12-13 06:50:23,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:50:23,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:50:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:50:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:50:23,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:50:23,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45221861] [2022-12-13 06:50:23,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45221861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:50:23,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:50:23,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:50:23,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132359856] [2022-12-13 06:50:23,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:50:23,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:50:23,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:50:23,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:50:23,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:50:23,578 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 9 [2022-12-13 06:50:23,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 9 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:50:23,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:50:23,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 9 [2022-12-13 06:50:23,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:50:23,591 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-13 06:50:23,592 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:50:23,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 7 events. 0/7 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 1 event pairs, 0 based on Foata normal form. 2/9 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2022-12-13 06:50:23,592 INFO L137 encePairwiseOnDemand]: 7/9 looper letters, 5 selfloop transitions, 1 changer transitions 1/7 dead transitions. [2022-12-13 06:50:23,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 7 transitions, 73 flow [2022-12-13 06:50:23,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:50:23,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:50:23,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-12-13 06:50:23,593 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 06:50:23,594 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, -8 predicate places. [2022-12-13 06:50:23,594 INFO L82 GeneralOperation]: Start removeDead. Operand has 21 places, 7 transitions, 73 flow [2022-12-13 06:50:23,594 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 6 transitions, 63 flow [2022-12-13 06:50:23,594 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:50:23,594 INFO L89 Accepts]: Start accepts. Operand has 20 places, 6 transitions, 63 flow [2022-12-13 06:50:23,595 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:50:23,595 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:50:23,595 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 6 transitions, 63 flow [2022-12-13 06:50:23,595 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 6 transitions, 63 flow [2022-12-13 06:50:23,595 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:50:23,678 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 06:50:23,679 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-13 06:50:23,679 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 4 transitions, 43 flow [2022-12-13 06:50:23,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:50:23,679 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:50:23,679 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 06:50:23,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 06:50:23,679 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 06:50:23,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:50:23,680 INFO L85 PathProgramCache]: Analyzing trace with hash 8746173, now seen corresponding path program 1 times [2022-12-13 06:50:23,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:50:23,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244095266] [2022-12-13 06:50:23,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:50:23,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:50:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:50:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:50:23,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:50:23,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244095266] [2022-12-13 06:50:23,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244095266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:50:23,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:50:23,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:50:23,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687707565] [2022-12-13 06:50:23,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:50:23,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:50:23,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:50:23,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:50:23,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:50:23,996 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 4 [2022-12-13 06:50:23,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 4 transitions, 43 flow. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:50:23,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:50:23,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 4 [2022-12-13 06:50:23,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:50:24,010 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 06:50:24,010 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:50:24,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 3 events. 0/3 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 1/4 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 06:50:24,011 INFO L137 encePairwiseOnDemand]: 1/4 looper letters, 0 selfloop transitions, 0 changer transitions 3/3 dead transitions. [2022-12-13 06:50:24,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 3 transitions, 39 flow [2022-12-13 06:50:24,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:50:24,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:50:24,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2022-12-13 06:50:24,012 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-13 06:50:24,014 INFO L295 CegarLoopForPetriNet]: 29 programPoint places, -10 predicate places. [2022-12-13 06:50:24,014 INFO L82 GeneralOperation]: Start removeDead. Operand has 19 places, 3 transitions, 39 flow [2022-12-13 06:50:24,014 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2022-12-13 06:50:24,014 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:50:24,014 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 06:50:24,014 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 06:50:24,014 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:50:24,015 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:50:24,015 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-13 06:50:24,015 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 06:50:24,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:50:24,019 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-13 06:50:24,019 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2022-12-13 06:50:24,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 06:50:24,020 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-12-13 06:50:24,022 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 06:50:24,022 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 06:50:24,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:50:24 BasicIcfg [2022-12-13 06:50:24,025 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 06:50:24,026 INFO L158 Benchmark]: Toolchain (without parser) took 6588.36ms. Allocated memory was 167.8MB in the beginning and 242.2MB in the end (delta: 74.4MB). Free memory was 143.5MB in the beginning and 206.0MB in the end (delta: -62.5MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. [2022-12-13 06:50:24,026 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 167.8MB. Free memory was 144.4MB in the beginning and 144.4MB in the end (delta: 79.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 06:50:24,026 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.71ms. Allocated memory is still 167.8MB. Free memory was 143.1MB in the beginning and 123.9MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-13 06:50:24,026 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.79ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 121.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 06:50:24,027 INFO L158 Benchmark]: Boogie Preprocessor took 27.03ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 120.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 06:50:24,027 INFO L158 Benchmark]: RCFGBuilder took 443.70ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 106.4MB in the end (delta: 14.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 06:50:24,027 INFO L158 Benchmark]: TraceAbstraction took 5727.42ms. Allocated memory was 167.8MB in the beginning and 242.2MB in the end (delta: 74.4MB). Free memory was 105.0MB in the beginning and 206.0MB in the end (delta: -100.9MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 06:50:24,028 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.13ms. Allocated memory is still 167.8MB. Free memory was 144.4MB in the beginning and 144.4MB in the end (delta: 79.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 332.71ms. Allocated memory is still 167.8MB. Free memory was 143.1MB in the beginning and 123.9MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.79ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 121.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.03ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 120.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 443.70ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 106.4MB in the end (delta: 14.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 5727.42ms. Allocated memory was 167.8MB in the beginning and 242.2MB in the end (delta: 74.4MB). Free memory was 105.0MB in the beginning and 206.0MB in the end (delta: -100.9MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 78 PlacesBefore, 29 PlacesAfterwards, 75 TransitionsBefore, 26 TransitionsAfterwards, 748 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 24 ConcurrentYvCompositions, 0 ChoiceCompositions, 60 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 929, independent: 799, independent conditional: 799, independent unconditional: 0, dependent: 130, dependent conditional: 130, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 929, independent: 799, independent conditional: 0, independent unconditional: 799, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 929, independent: 799, independent conditional: 0, independent unconditional: 799, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 929, independent: 799, independent conditional: 0, independent unconditional: 799, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 555, independent: 505, independent conditional: 0, independent unconditional: 505, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 555, independent: 448, independent conditional: 0, independent unconditional: 448, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 107, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 232, independent: 115, independent conditional: 0, independent unconditional: 115, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 929, independent: 294, independent conditional: 0, independent unconditional: 294, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 555, unknown conditional: 0, unknown unconditional: 555] , Statistics on independence cache: Total cache size (in pairs): 791, Positive cache size: 741, Positive conditional cache size: 0, Positive unconditional cache size: 741, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 31 PlacesBefore, 31 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 105, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 105, independent: 78, independent conditional: 48, independent unconditional: 30, dependent: 27, dependent conditional: 12, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 105, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 105, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 105, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 35, unknown conditional: 0, unknown unconditional: 35] , Statistics on independence cache: Total cache size (in pairs): 35, Positive cache size: 26, Positive conditional cache size: 0, Positive unconditional cache size: 26, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 60, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 21 PlacesBefore, 18 PlacesAfterwards, 17 TransitionsBefore, 13 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 0 ConcurrentYvCompositions, 1 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 28, Positive conditional cache size: 0, Positive unconditional cache size: 28, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 19 PlacesBefore, 19 PlacesAfterwards, 9 TransitionsBefore, 9 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 28, Positive conditional cache size: 0, Positive unconditional cache size: 28, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 20 PlacesBefore, 18 PlacesAfterwards, 6 TransitionsBefore, 4 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 30, Positive conditional cache size: 0, Positive unconditional cache size: 30, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 30, Positive conditional cache size: 0, Positive unconditional cache size: 30, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 102 locations, 2 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: 5.6s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 106 IncrementalHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 1 mSDtfsCounter, 106 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=1, InterpolantAutomatonStates: 18, 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, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 184 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 06:50:24,050 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...