/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_35-traces-ex-2_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 12:28:10,738 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:28:10,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:28:10,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:28:10,774 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:28:10,775 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:28:10,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:28:10,777 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:28:10,778 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:28:10,779 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:28:10,796 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:28:10,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:28:10,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:28:10,797 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:28:10,798 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:28:10,799 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:28:10,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:28:10,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:28:10,802 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:28:10,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:28:10,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:28:10,808 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:28:10,809 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:28:10,809 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:28:10,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:28:10,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:28:10,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:28:10,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:28:10,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:28:10,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:28:10,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:28:10,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:28:10,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:28:10,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:28:10,818 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:28:10,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:28:10,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:28:10,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:28:10,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:28:10,820 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:28:10,820 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:28:10,825 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 12:28:10,855 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:28:10,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:28:10,856 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:28:10,856 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:28:10,856 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:28:10,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:28:10,856 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:28:10,856 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:28:10,856 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:28:10,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:28:10,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:28:10,856 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:28:10,856 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:28:10,857 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:28:10,857 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:28:10,857 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:28:10,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:28:10,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:28:10,857 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:28:10,857 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:28:10,857 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:28:10,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:28:10,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:28:10,857 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:28:10,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:28:10,858 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:28:10,858 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:28:10,858 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:28:10,858 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 [2022-12-13 12:28:11,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:28:11,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:28:11,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:28:11,140 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:28:11,140 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:28:11,141 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_35-traces-ex-2_true.i [2022-12-13 12:28:12,106 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:28:12,387 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:28:12,387 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_35-traces-ex-2_true.i [2022-12-13 12:28:12,415 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9be13f118/6a7fd821fedb48c4accd5cd8829a2fd2/FLAGa5a1ea2c7 [2022-12-13 12:28:12,425 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9be13f118/6a7fd821fedb48c4accd5cd8829a2fd2 [2022-12-13 12:28:12,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:28:12,430 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:28:12,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:28:12,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:28:12,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:28:12,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:28:12" (1/1) ... [2022-12-13 12:28:12,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a862c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:12, skipping insertion in model container [2022-12-13 12:28:12,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:28:12" (1/1) ... [2022-12-13 12:28:12,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:28:12,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:28:12,620 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_35-traces-ex-2_true.i[1088,1101] [2022-12-13 12:28:12,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:28:12,751 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:28:12,761 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_35-traces-ex-2_true.i[1088,1101] [2022-12-13 12:28:12,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:28:12,807 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:28:12,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:12 WrapperNode [2022-12-13 12:28:12,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:28:12,808 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:28:12,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:28:12,809 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:28:12,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:12" (1/1) ... [2022-12-13 12:28:12,824 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:12" (1/1) ... [2022-12-13 12:28:12,835 INFO L138 Inliner]: procedures = 162, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2022-12-13 12:28:12,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:28:12,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:28:12,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:28:12,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:28:12,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:12" (1/1) ... [2022-12-13 12:28:12,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:12" (1/1) ... [2022-12-13 12:28:12,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:12" (1/1) ... [2022-12-13 12:28:12,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:12" (1/1) ... [2022-12-13 12:28:12,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:12" (1/1) ... [2022-12-13 12:28:12,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:12" (1/1) ... [2022-12-13 12:28:12,859 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:12" (1/1) ... [2022-12-13 12:28:12,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:12" (1/1) ... [2022-12-13 12:28:12,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:28:12,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:28:12,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:28:12,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:28:12,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:12" (1/1) ... [2022-12-13 12:28:12,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:28:12,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:28:12,895 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 12:28:12,897 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 12:28:12,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:28:12,945 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 12:28:12,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:28:12,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:28:12,946 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-13 12:28:12,946 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-13 12:28:12,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:28:12,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:28:12,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:28:12,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:28:12,948 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 12:28:13,152 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:28:13,153 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:28:13,292 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:28:13,297 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:28:13,297 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:28:13,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:28:13 BoogieIcfgContainer [2022-12-13 12:28:13,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:28:13,301 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:28:13,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:28:13,304 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:28:13,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:28:12" (1/3) ... [2022-12-13 12:28:13,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6c22b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:28:13, skipping insertion in model container [2022-12-13 12:28:13,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:12" (2/3) ... [2022-12-13 12:28:13,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6c22b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:28:13, skipping insertion in model container [2022-12-13 12:28:13,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:28:13" (3/3) ... [2022-12-13 12:28:13,306 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_35-traces-ex-2_true.i [2022-12-13 12:28:13,335 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:28:13,335 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 12:28:13,335 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:28:13,395 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 12:28:13,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 65 transitions, 135 flow [2022-12-13 12:28:13,461 INFO L130 PetriNetUnfolder]: 1/64 cut-off events. [2022-12-13 12:28:13,461 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:28:13,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 64 events. 1/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2022-12-13 12:28:13,464 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 65 transitions, 135 flow [2022-12-13 12:28:13,466 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 54 transitions, 111 flow [2022-12-13 12:28:13,469 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:28:13,484 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 54 transitions, 111 flow [2022-12-13 12:28:13,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 54 transitions, 111 flow [2022-12-13 12:28:13,520 INFO L130 PetriNetUnfolder]: 0/54 cut-off events. [2022-12-13 12:28:13,520 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:28:13,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 54 events. 0/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 21 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 12:28:13,522 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 54 transitions, 111 flow [2022-12-13 12:28:13,522 INFO L226 LiptonReduction]: Number of co-enabled transitions 308 [2022-12-13 12:28:15,653 INFO L241 LiptonReduction]: Total number of compositions: 46 [2022-12-13 12:28:15,665 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:28:15,670 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;@35d8f855, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:28:15,670 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-13 12:28:15,675 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-13 12:28:15,675 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:28:15,676 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:28:15,676 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 12:28:15,676 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:28:15,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:28:15,681 INFO L85 PathProgramCache]: Analyzing trace with hash 218906972, now seen corresponding path program 1 times [2022-12-13 12:28:15,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:28:15,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843032033] [2022-12-13 12:28:15,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:28:15,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:28:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:28:15,933 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 12:28:15,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:28:15,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843032033] [2022-12-13 12:28:15,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843032033] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:28:15,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:28:15,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:28:15,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431004233] [2022-12-13 12:28:15,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:28:15,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:28:15,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:28:15,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:28:15,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:28:15,971 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2022-12-13 12:28:15,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 41 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 12:28:15,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:28:15,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2022-12-13 12:28:15,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:28:16,023 INFO L130 PetriNetUnfolder]: 24/75 cut-off events. [2022-12-13 12:28:16,023 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:28:16,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 75 events. 24/75 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 287 event pairs, 18 based on Foata normal form. 9/56 useless extension candidates. Maximal degree in co-relation 139. Up to 48 conditions per place. [2022-12-13 12:28:16,024 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 10 selfloop transitions, 4 changer transitions 5/21 dead transitions. [2022-12-13 12:28:16,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 21 transitions, 81 flow [2022-12-13 12:28:16,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:28:16,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:28:16,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-12-13 12:28:16,032 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49122807017543857 [2022-12-13 12:28:16,048 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 41 flow. Second operand 3 states and 28 transitions. [2022-12-13 12:28:16,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 21 transitions, 81 flow [2022-12-13 12:28:16,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 80 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:28:16,051 INFO L231 Difference]: Finished difference. Result has 25 places, 14 transitions, 44 flow [2022-12-13 12:28:16,053 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=25, PETRI_TRANSITIONS=14} [2022-12-13 12:28:16,060 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2022-12-13 12:28:16,060 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:28:16,060 INFO L89 Accepts]: Start accepts. Operand has 25 places, 14 transitions, 44 flow [2022-12-13 12:28:16,062 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:28:16,062 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:28:16,062 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 14 transitions, 44 flow [2022-12-13 12:28:16,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 14 transitions, 44 flow [2022-12-13 12:28:16,065 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-13 12:28:16,066 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 12:28:16,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 19 events. 0/19 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 39 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2022-12-13 12:28:16,068 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 14 transitions, 44 flow [2022-12-13 12:28:16,068 INFO L226 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-13 12:28:16,095 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [191] L688-->L691: Formula: (and (= v_~g~0_34 0) (= (store |v_#pthreadsMutex_230| |v_~#B~0.base_83| (store (select |v_#pthreadsMutex_230| |v_~#B~0.base_83|) |v_~#B~0.offset_83| 1)) |v_#pthreadsMutex_229|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_230|, ~#B~0.base=|v_~#B~0.base_83|, ~#B~0.offset=|v_~#B~0.offset_83|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_229|, ~#B~0.base=|v_~#B~0.base_83|, ~g~0=v_~g~0_34, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_31|, ~#B~0.offset=|v_~#B~0.offset_83|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_#t~nondet3] and [182] $Ultimate##0-->L688: Formula: (let ((.cse1 (select |v_#pthreadsMutex_209| |v_~#A~0.base_67|))) (let ((.cse2 (store |v_#pthreadsMutex_209| |v_~#A~0.base_67| (store .cse1 |v_~#A~0.offset_67| 1)))) (let ((.cse0 (select .cse2 |v_~#B~0.base_73|))) (and (= (select .cse0 |v_~#B~0.offset_73|) 0) (= v_~g~0_23 1) (= (select .cse1 |v_~#A~0.offset_67|) 0) (= v_t_funThread1of1ForFork0_~arg.base_25 |v_t_funThread1of1ForFork0_#in~arg.base_25|) (= |v_t_funThread1of1ForFork0_#in~arg.offset_25| v_t_funThread1of1ForFork0_~arg.offset_25) (= (store .cse2 |v_~#B~0.base_73| (store .cse0 |v_~#B~0.offset_73| 1)) |v_#pthreadsMutex_207|))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_209|, ~#B~0.base=|v_~#B~0.base_73|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_25|, ~#A~0.offset=|v_~#A~0.offset_67|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_25|, ~#A~0.base=|v_~#A~0.base_67|, ~#B~0.offset=|v_~#B~0.offset_73|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_207|, ~#B~0.base=|v_~#B~0.base_73|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_25|, ~#A~0.offset=|v_~#A~0.offset_67|, ~g~0=v_~g~0_23, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_25, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_29|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_27|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_25|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_25, ~#A~0.base=|v_~#A~0.base_67|, ~#B~0.offset=|v_~#B~0.offset_73|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base] [2022-12-13 12:28:16,102 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [200] L688-->L692: Formula: (and (= (store |v_#pthreadsMutex_285| |v_~#B~0.base_109| (store (select |v_#pthreadsMutex_285| |v_~#B~0.base_109|) |v_~#B~0.offset_109| 0)) |v_#pthreadsMutex_283|) (= v_~g~0_56 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_285|, ~#B~0.base=|v_~#B~0.base_109|, ~#B~0.offset=|v_~#B~0.offset_109|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_283|, ~#B~0.base=|v_~#B~0.base_109|, ~g~0=v_~g~0_56, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_43|, ~#B~0.offset=|v_~#B~0.offset_109|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_#t~nondet3] and [182] $Ultimate##0-->L688: Formula: (let ((.cse1 (select |v_#pthreadsMutex_209| |v_~#A~0.base_67|))) (let ((.cse2 (store |v_#pthreadsMutex_209| |v_~#A~0.base_67| (store .cse1 |v_~#A~0.offset_67| 1)))) (let ((.cse0 (select .cse2 |v_~#B~0.base_73|))) (and (= (select .cse0 |v_~#B~0.offset_73|) 0) (= v_~g~0_23 1) (= (select .cse1 |v_~#A~0.offset_67|) 0) (= v_t_funThread1of1ForFork0_~arg.base_25 |v_t_funThread1of1ForFork0_#in~arg.base_25|) (= |v_t_funThread1of1ForFork0_#in~arg.offset_25| v_t_funThread1of1ForFork0_~arg.offset_25) (= (store .cse2 |v_~#B~0.base_73| (store .cse0 |v_~#B~0.offset_73| 1)) |v_#pthreadsMutex_207|))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_209|, ~#B~0.base=|v_~#B~0.base_73|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_25|, ~#A~0.offset=|v_~#A~0.offset_67|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_25|, ~#A~0.base=|v_~#A~0.base_67|, ~#B~0.offset=|v_~#B~0.offset_73|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_207|, ~#B~0.base=|v_~#B~0.base_73|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_25|, ~#A~0.offset=|v_~#A~0.offset_67|, ~g~0=v_~g~0_23, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_25, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_29|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_27|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_25|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_25, ~#A~0.base=|v_~#A~0.base_67|, ~#B~0.offset=|v_~#B~0.offset_73|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base] [2022-12-13 12:28:16,157 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [203] L688-->L688: Formula: (let ((.cse3 (store |v_#pthreadsMutex_387| |v_~#B~0.base_137| (store (select |v_#pthreadsMutex_387| |v_~#B~0.base_137|) |v_~#B~0.offset_137| 0)))) (let ((.cse0 (select .cse3 |v_~#A~0.base_125|))) (let ((.cse2 (store .cse3 |v_~#A~0.base_125| (store .cse0 |v_~#A~0.offset_125| 1)))) (let ((.cse1 (select .cse2 |v_~#B~0.base_137|))) (and (= v_t_funThread1of1ForFork0_~arg.base_39 |v_t_funThread1of1ForFork0_#in~arg.base_39|) (= v_~g~0_78 1) (= (select .cse0 |v_~#A~0.offset_125|) 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_39| v_t_funThread1of1ForFork0_~arg.offset_39) (= (select .cse1 |v_~#B~0.offset_137|) 0) (= (store .cse2 |v_~#B~0.base_137| (store .cse1 |v_~#B~0.offset_137| 1)) |v_#pthreadsMutex_385|)))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_387|, ~#B~0.base=|v_~#B~0.base_137|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_39|, ~#A~0.offset=|v_~#A~0.offset_125|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_39|, ~#A~0.base=|v_~#A~0.base_125|, ~#B~0.offset=|v_~#B~0.offset_137|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_385|, ~#B~0.base=|v_~#B~0.base_137|, ~g~0=v_~g~0_78, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_39|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_39, ~#B~0.offset=|v_~#B~0.offset_137|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_39|, ~#A~0.offset=|v_~#A~0.offset_125|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_39, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_43|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_39|, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_63|, ~#A~0.base=|v_~#A~0.base_125|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_#t~nondet3] and [146] L692-->L693: Formula: (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#A~0.base_9| (store (select |v_#pthreadsMutex_14| |v_~#A~0.base_9|) |v_~#A~0.offset_9| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_14|, ~#A~0.offset=|v_~#A~0.offset_9|, ~#A~0.base=|v_~#A~0.base_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_13|, ~#A~0.offset=|v_~#A~0.offset_9|, ~#A~0.base=|v_~#A~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex] [2022-12-13 12:28:16,198 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [203] L688-->L688: Formula: (let ((.cse3 (store |v_#pthreadsMutex_387| |v_~#B~0.base_137| (store (select |v_#pthreadsMutex_387| |v_~#B~0.base_137|) |v_~#B~0.offset_137| 0)))) (let ((.cse0 (select .cse3 |v_~#A~0.base_125|))) (let ((.cse2 (store .cse3 |v_~#A~0.base_125| (store .cse0 |v_~#A~0.offset_125| 1)))) (let ((.cse1 (select .cse2 |v_~#B~0.base_137|))) (and (= v_t_funThread1of1ForFork0_~arg.base_39 |v_t_funThread1of1ForFork0_#in~arg.base_39|) (= v_~g~0_78 1) (= (select .cse0 |v_~#A~0.offset_125|) 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_39| v_t_funThread1of1ForFork0_~arg.offset_39) (= (select .cse1 |v_~#B~0.offset_137|) 0) (= (store .cse2 |v_~#B~0.base_137| (store .cse1 |v_~#B~0.offset_137| 1)) |v_#pthreadsMutex_385|)))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_387|, ~#B~0.base=|v_~#B~0.base_137|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_39|, ~#A~0.offset=|v_~#A~0.offset_125|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_39|, ~#A~0.base=|v_~#A~0.base_125|, ~#B~0.offset=|v_~#B~0.offset_137|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_385|, ~#B~0.base=|v_~#B~0.base_137|, ~g~0=v_~g~0_78, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_39|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_39, ~#B~0.offset=|v_~#B~0.offset_137|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_39|, ~#A~0.offset=|v_~#A~0.offset_125|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_39, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_43|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_39|, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_63|, ~#A~0.base=|v_~#A~0.base_125|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_#t~nondet3] and [168] L692-->t_funFINAL: Formula: (and (= |v_t_funThread1of1ForFork0_#res.offset_7| 0) (= |v_t_funThread1of1ForFork0_#res.base_7| 0) (= |v_#pthreadsMutex_79| (store |v_#pthreadsMutex_80| |v_~#A~0.base_31| (store (select |v_#pthreadsMutex_80| |v_~#A~0.base_31|) |v_~#A~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_80|, ~#A~0.offset=|v_~#A~0.offset_31|, ~#A~0.base=|v_~#A~0.base_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_79|, ~#A~0.offset=|v_~#A~0.offset_31|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_7|, ~#A~0.base=|v_~#A~0.base_31|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#res.offset] [2022-12-13 12:28:16,254 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [203] L688-->L688: Formula: (let ((.cse3 (store |v_#pthreadsMutex_387| |v_~#B~0.base_137| (store (select |v_#pthreadsMutex_387| |v_~#B~0.base_137|) |v_~#B~0.offset_137| 0)))) (let ((.cse0 (select .cse3 |v_~#A~0.base_125|))) (let ((.cse2 (store .cse3 |v_~#A~0.base_125| (store .cse0 |v_~#A~0.offset_125| 1)))) (let ((.cse1 (select .cse2 |v_~#B~0.base_137|))) (and (= v_t_funThread1of1ForFork0_~arg.base_39 |v_t_funThread1of1ForFork0_#in~arg.base_39|) (= v_~g~0_78 1) (= (select .cse0 |v_~#A~0.offset_125|) 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_39| v_t_funThread1of1ForFork0_~arg.offset_39) (= (select .cse1 |v_~#B~0.offset_137|) 0) (= (store .cse2 |v_~#B~0.base_137| (store .cse1 |v_~#B~0.offset_137| 1)) |v_#pthreadsMutex_385|)))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_387|, ~#B~0.base=|v_~#B~0.base_137|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_39|, ~#A~0.offset=|v_~#A~0.offset_125|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_39|, ~#A~0.base=|v_~#A~0.base_125|, ~#B~0.offset=|v_~#B~0.offset_137|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_385|, ~#B~0.base=|v_~#B~0.base_137|, ~g~0=v_~g~0_78, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_39|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_39, ~#B~0.offset=|v_~#B~0.offset_137|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_39|, ~#A~0.offset=|v_~#A~0.offset_125|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_39, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_43|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_39|, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_63|, ~#A~0.base=|v_~#A~0.base_125|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_#t~nondet3] and [169] L692-->t_funEXIT: Formula: (and (= |v_t_funThread1of1ForFork0_#res.offset_9| 0) (= |v_t_funThread1of1ForFork0_#res.base_9| 0) (= (store |v_#pthreadsMutex_84| |v_~#A~0.base_33| (store (select |v_#pthreadsMutex_84| |v_~#A~0.base_33|) |v_~#A~0.offset_33| 0)) |v_#pthreadsMutex_83|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_84|, ~#A~0.offset=|v_~#A~0.offset_33|, ~#A~0.base=|v_~#A~0.base_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_83|, ~#A~0.offset=|v_~#A~0.offset_33|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_9|, ~#A~0.base=|v_~#A~0.base_33|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#res.offset] [2022-12-13 12:28:16,324 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:28:16,325 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 265 [2022-12-13 12:28:16,326 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 13 transitions, 60 flow [2022-12-13 12:28:16,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 12:28:16,326 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:28:16,337 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 12:28:16,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:28:16,338 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:28:16,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:28:16,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1803818608, now seen corresponding path program 1 times [2022-12-13 12:28:16,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:28:16,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298130364] [2022-12-13 12:28:16,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:28:16,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:28:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:28:16,471 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 12:28:16,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:28:16,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298130364] [2022-12-13 12:28:16,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298130364] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:28:16,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:28:16,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:28:16,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846941683] [2022-12-13 12:28:16,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:28:16,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:28:16,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:28:16,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:28:16,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:28:16,474 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-13 12:28:16,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 13 transitions, 60 flow. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 12:28:16,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:28:16,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-13 12:28:16,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:28:16,496 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2022-12-13 12:28:16,497 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 12:28:16,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 18 events. 4/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 37 event pairs, 0 based on Foata normal form. 4/18 useless extension candidates. Maximal degree in co-relation 37. Up to 11 conditions per place. [2022-12-13 12:28:16,497 INFO L137 encePairwiseOnDemand]: 9/13 looper letters, 5 selfloop transitions, 4 changer transitions 3/12 dead transitions. [2022-12-13 12:28:16,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 12 transitions, 58 flow [2022-12-13 12:28:16,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:28:16,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:28:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2022-12-13 12:28:16,498 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2153846153846154 [2022-12-13 12:28:16,498 INFO L175 Difference]: Start difference. First operand has 19 places, 13 transitions, 60 flow. Second operand 5 states and 14 transitions. [2022-12-13 12:28:16,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 12 transitions, 58 flow [2022-12-13 12:28:16,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 12 transitions, 54 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:28:16,499 INFO L231 Difference]: Finished difference. Result has 17 places, 7 transitions, 28 flow [2022-12-13 12:28:16,499 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=24, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=5, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=28, PETRI_PLACES=17, PETRI_TRANSITIONS=7} [2022-12-13 12:28:16,499 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, -6 predicate places. [2022-12-13 12:28:16,499 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:28:16,500 INFO L89 Accepts]: Start accepts. Operand has 17 places, 7 transitions, 28 flow [2022-12-13 12:28:16,500 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:28:16,500 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:28:16,500 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 17 places, 7 transitions, 28 flow [2022-12-13 12:28:16,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 14 places, 7 transitions, 28 flow [2022-12-13 12:28:16,502 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-13 12:28:16,502 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:28:16,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18 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 2 event pairs, 0 based on Foata normal form. 0/7 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 12:28:16,502 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 14 places, 7 transitions, 28 flow [2022-12-13 12:28:16,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 4 [2022-12-13 12:28:16,617 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 12:28:16,618 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 12:28:16,618 INFO L495 AbstractCegarLoop]: Abstraction has has 11 places, 4 transitions, 20 flow [2022-12-13 12:28:16,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 12:28:16,618 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:28:16,618 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 12:28:16,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:28:16,619 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:28:16,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:28:16,619 INFO L85 PathProgramCache]: Analyzing trace with hash 7062288, now seen corresponding path program 1 times [2022-12-13 12:28:16,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:28:16,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644304199] [2022-12-13 12:28:16,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:28:16,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:28:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:28:16,862 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 12:28:16,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:28:16,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644304199] [2022-12-13 12:28:16,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644304199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:28:16,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:28:16,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:28:16,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112904473] [2022-12-13 12:28:16,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:28:16,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:28:16,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:28:16,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:28:16,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:28:16,864 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 4 [2022-12-13 12:28:16,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 11 places, 4 transitions, 20 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 12:28:16,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:28:16,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 4 [2022-12-13 12:28:16,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:28:16,883 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 12:28:16,884 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:28:16,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15 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 2 conditions per place. [2022-12-13 12:28:16,884 INFO L137 encePairwiseOnDemand]: 1/4 looper letters, 0 selfloop transitions, 0 changer transitions 3/3 dead transitions. [2022-12-13 12:28:16,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 12 places, 3 transitions, 20 flow [2022-12-13 12:28:16,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:28:16,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:28:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2022-12-13 12:28:16,885 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-13 12:28:16,885 INFO L175 Difference]: Start difference. First operand has 11 places, 4 transitions, 20 flow. Second operand 4 states and 4 transitions. [2022-12-13 12:28:16,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 12 places, 3 transitions, 20 flow [2022-12-13 12:28:16,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 9 places, 3 transitions, 14 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:28:16,885 INFO L231 Difference]: Finished difference. Result has 9 places, 0 transitions, 0 flow [2022-12-13 12:28:16,885 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=4, PETRI_DIFFERENCE_MINUEND_FLOW=8, PETRI_DIFFERENCE_MINUEND_PLACES=6, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=9, PETRI_TRANSITIONS=0} [2022-12-13 12:28:16,886 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, -14 predicate places. [2022-12-13 12:28:16,886 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:28:16,886 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 9 places, 0 transitions, 0 flow [2022-12-13 12:28:16,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 12:28:16,887 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 12:28:16,887 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:28:16,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 12:28:16,887 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 12:28:16,887 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 12:28:16,887 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:28:16,888 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 12:28:16,888 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 12:28:16,888 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 12:28:16,890 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-13 12:28:16,890 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2022-12-13 12:28:16,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:28:16,890 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-12-13 12:28:16,892 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:28:16,892 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:28:16,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:28:16 BasicIcfg [2022-12-13 12:28:16,894 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:28:16,894 INFO L158 Benchmark]: Toolchain (without parser) took 4466.13ms. Allocated memory was 195.0MB in the beginning and 247.5MB in the end (delta: 52.4MB). Free memory was 169.7MB in the beginning and 145.4MB in the end (delta: 24.4MB). Peak memory consumption was 77.1MB. Max. memory is 8.0GB. [2022-12-13 12:28:16,895 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 195.0MB. Free memory was 171.9MB in the beginning and 171.7MB in the end (delta: 145.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 12:28:16,895 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.28ms. Allocated memory is still 195.0MB. Free memory was 169.5MB in the beginning and 150.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-13 12:28:16,895 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.06ms. Allocated memory is still 195.0MB. Free memory was 150.7MB in the beginning and 148.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:28:16,895 INFO L158 Benchmark]: Boogie Preprocessor took 24.57ms. Allocated memory is still 195.0MB. Free memory was 148.9MB in the beginning and 147.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 12:28:16,896 INFO L158 Benchmark]: RCFGBuilder took 437.62ms. Allocated memory is still 195.0MB. Free memory was 147.1MB in the beginning and 134.9MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 12:28:16,896 INFO L158 Benchmark]: TraceAbstraction took 3593.20ms. Allocated memory was 195.0MB in the beginning and 247.5MB in the end (delta: 52.4MB). Free memory was 133.5MB in the beginning and 145.4MB in the end (delta: -11.9MB). Peak memory consumption was 40.4MB. Max. memory is 8.0GB. [2022-12-13 12:28:16,897 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.11ms. Allocated memory is still 195.0MB. Free memory was 171.9MB in the beginning and 171.7MB in the end (delta: 145.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 375.28ms. Allocated memory is still 195.0MB. Free memory was 169.5MB in the beginning and 150.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.06ms. Allocated memory is still 195.0MB. Free memory was 150.7MB in the beginning and 148.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.57ms. Allocated memory is still 195.0MB. Free memory was 148.9MB in the beginning and 147.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 437.62ms. Allocated memory is still 195.0MB. Free memory was 147.1MB in the beginning and 134.9MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3593.20ms. Allocated memory was 195.0MB in the beginning and 247.5MB in the end (delta: 52.4MB). Free memory was 133.5MB in the beginning and 145.4MB in the end (delta: -11.9MB). Peak memory consumption was 40.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 58 PlacesBefore, 23 PlacesAfterwards, 54 TransitionsBefore, 19 TransitionsAfterwards, 308 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 27 TrivialYvCompositions, 19 ConcurrentYvCompositions, 0 ChoiceCompositions, 46 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 323, independent: 282, independent conditional: 282, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 323, independent: 282, independent conditional: 0, independent unconditional: 282, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 323, independent: 282, independent conditional: 0, independent unconditional: 282, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 323, independent: 282, independent conditional: 0, independent unconditional: 282, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 230, independent: 209, independent conditional: 0, independent unconditional: 209, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 230, independent: 188, independent conditional: 0, independent unconditional: 188, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 109, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 323, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 230, unknown conditional: 0, unknown unconditional: 230] , Statistics on independence cache: Total cache size (in pairs): 388, Positive cache size: 367, Positive conditional cache size: 0, Positive unconditional cache size: 367, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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.3s, 20 PlacesBefore, 19 PlacesAfterwards, 14 TransitionsBefore, 13 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 17, independent conditional: 6, independent unconditional: 11, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 10, Positive conditional cache size: 0, Positive unconditional cache size: 10, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 14 PlacesBefore, 11 PlacesAfterwards, 7 TransitionsBefore, 4 TransitionsAfterwards, 4 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 12, Positive conditional cache size: 0, Positive unconditional cache size: 12, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - 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): 20, Positive cache size: 12, Positive conditional cache size: 0, Positive unconditional cache size: 12, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, 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, 81 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: 3.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48 IncrementalHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 0 mSDtfsCounter, 48 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=1, InterpolantAutomatonStates: 12, 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.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 59 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 12:28:16,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...