/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_38-traces-ex-4-switch_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:43:05,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:43:05,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:43:05,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:43:05,391 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:43:05,392 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:43:05,393 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:43:05,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:43:05,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:43:05,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:43:05,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:43:05,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:43:05,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:43:05,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:43:05,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:43:05,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:43:05,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:43:05,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:43:05,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:43:05,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:43:05,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:43:05,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:43:05,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:43:05,417 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:43:05,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:43:05,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:43:05,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:43:05,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:43:05,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:43:05,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:43:05,426 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:43:05,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:43:05,427 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:43:05,428 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:43:05,449 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:43:05,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:43:05,450 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:43:05,450 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:43:05,450 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:43:05,451 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:43:05,452 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:43:05,453 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-05 23:43:05,478 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:43:05,479 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:43:05,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:43:05,481 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:43:05,481 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:43:05,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:43:05,482 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:43:05,482 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:43:05,482 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:43:05,482 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:43:05,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:43:05,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:43:05,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:43:05,484 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:43:05,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:43:05,484 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:43:05,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:43:05,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:43:05,484 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:43:05,484 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:43:05,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:43:05,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:43:05,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:43:05,485 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:43:05,485 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:43:05,485 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:43:05,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:43:05,486 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:43:05,486 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-05 23:43:05,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:43:05,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:43:05,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:43:05,865 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:43:05,866 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:43:05,867 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_38-traces-ex-4-switch_true.i [2022-12-05 23:43:07,042 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:43:07,311 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:43:07,312 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_38-traces-ex-4-switch_true.i [2022-12-05 23:43:07,324 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfbafb070/1f3f8391c02c40f98c4eb6fb72e38c23/FLAG3423782a3 [2022-12-05 23:43:07,336 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfbafb070/1f3f8391c02c40f98c4eb6fb72e38c23 [2022-12-05 23:43:07,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:43:07,339 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:43:07,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:43:07,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:43:07,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:43:07,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:43:07" (1/1) ... [2022-12-05 23:43:07,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@453a970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:07, skipping insertion in model container [2022-12-05 23:43:07,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:43:07" (1/1) ... [2022-12-05 23:43:07,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:43:07,399 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:43:07,507 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_38-traces-ex-4-switch_true.i[1095,1108] [2022-12-05 23:43:07,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:43:07,644 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:43:07,659 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_38-traces-ex-4-switch_true.i[1095,1108] [2022-12-05 23:43:07,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:43:07,737 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:43:07,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:07 WrapperNode [2022-12-05 23:43:07,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:43:07,739 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:43:07,739 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:43:07,741 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:43:07,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:07" (1/1) ... [2022-12-05 23:43:07,777 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:07" (1/1) ... [2022-12-05 23:43:07,798 INFO L138 Inliner]: procedures = 162, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2022-12-05 23:43:07,799 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:43:07,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:43:07,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:43:07,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:43:07,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:07" (1/1) ... [2022-12-05 23:43:07,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:07" (1/1) ... [2022-12-05 23:43:07,812 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:07" (1/1) ... [2022-12-05 23:43:07,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:07" (1/1) ... [2022-12-05 23:43:07,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:07" (1/1) ... [2022-12-05 23:43:07,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:07" (1/1) ... [2022-12-05 23:43:07,829 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:07" (1/1) ... [2022-12-05 23:43:07,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:07" (1/1) ... [2022-12-05 23:43:07,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:43:07,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:43:07,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:43:07,833 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:43:07,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:07" (1/1) ... [2022-12-05 23:43:07,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:43:07,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:43:07,864 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-05 23:43:07,887 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-05 23:43:07,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:43:07,900 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-05 23:43:07,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:43:07,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:43:07,901 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-05 23:43:07,901 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-05 23:43:07,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:43:07,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:43:07,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:43:07,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:43:07,903 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:43:08,059 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:43:08,060 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:43:08,229 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:43:08,235 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:43:08,235 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:43:08,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:43:08 BoogieIcfgContainer [2022-12-05 23:43:08,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:43:08,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:43:08,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:43:08,241 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:43:08,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:43:07" (1/3) ... [2022-12-05 23:43:08,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ba1546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:43:08, skipping insertion in model container [2022-12-05 23:43:08,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:07" (2/3) ... [2022-12-05 23:43:08,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ba1546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:43:08, skipping insertion in model container [2022-12-05 23:43:08,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:43:08" (3/3) ... [2022-12-05 23:43:08,244 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_38-traces-ex-4-switch_true.i [2022-12-05 23:43:08,260 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:43:08,260 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 23:43:08,261 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:43:08,318 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:43:08,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 65 transitions, 135 flow [2022-12-05 23:43:08,406 INFO L130 PetriNetUnfolder]: 1/64 cut-off events. [2022-12-05 23:43:08,406 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:43:08,409 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-05 23:43:08,410 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 65 transitions, 135 flow [2022-12-05 23:43:08,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 54 transitions, 111 flow [2022-12-05 23:43:08,417 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:43:08,449 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 54 transitions, 111 flow [2022-12-05 23:43:08,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 54 transitions, 111 flow [2022-12-05 23:43:08,483 INFO L130 PetriNetUnfolder]: 0/54 cut-off events. [2022-12-05 23:43:08,484 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:43:08,484 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-05 23:43:08,486 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 54 transitions, 111 flow [2022-12-05 23:43:08,487 INFO L188 LiptonReduction]: Number of co-enabled transitions 308 [2022-12-05 23:43:11,372 INFO L203 LiptonReduction]: Total number of compositions: 46 [2022-12-05 23:43:11,386 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:43:11,391 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;@23067467, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:43:11,391 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-05 23:43:11,394 INFO L130 PetriNetUnfolder]: 0/10 cut-off events. [2022-12-05 23:43:11,394 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:43:11,395 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:43:11,395 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 23:43:11,396 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 23:43:11,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:43:11,400 INFO L85 PathProgramCache]: Analyzing trace with hash 214284526, now seen corresponding path program 1 times [2022-12-05 23:43:11,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:43:11,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60979916] [2022-12-05 23:43:11,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:43:11,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:43:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:43:11,667 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-05 23:43:11,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:43:11,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60979916] [2022-12-05 23:43:11,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60979916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:43:11,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:43:11,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:43:11,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858884342] [2022-12-05 23:43:11,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:43:11,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:43:11,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:43:11,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:43:11,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:43:11,702 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 11 [2022-12-05 23:43:11,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 15 places, 11 transitions, 25 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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-05 23:43:11,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:43:11,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 11 [2022-12-05 23:43:11,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:43:11,740 INFO L130 PetriNetUnfolder]: 8/31 cut-off events. [2022-12-05 23:43:11,740 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:43:11,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 31 events. 8/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 72 event pairs, 6 based on Foata normal form. 4/32 useless extension candidates. Maximal degree in co-relation 54. Up to 21 conditions per place. [2022-12-05 23:43:11,741 INFO L137 encePairwiseOnDemand]: 7/11 looper letters, 7 selfloop transitions, 3 changer transitions 2/13 dead transitions. [2022-12-05 23:43:11,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 13 transitions, 51 flow [2022-12-05 23:43:11,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:43:11,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:43:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-12-05 23:43:11,751 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2022-12-05 23:43:11,752 INFO L175 Difference]: Start difference. First operand has 15 places, 11 transitions, 25 flow. Second operand 3 states and 18 transitions. [2022-12-05 23:43:11,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 13 transitions, 51 flow [2022-12-05 23:43:11,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 13 transitions, 50 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:43:11,757 INFO L231 Difference]: Finished difference. Result has 17 places, 9 transitions, 31 flow [2022-12-05 23:43:11,759 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=11, PETRI_DIFFERENCE_MINUEND_FLOW=24, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=31, PETRI_PLACES=17, PETRI_TRANSITIONS=9} [2022-12-05 23:43:11,762 INFO L294 CegarLoopForPetriNet]: 15 programPoint places, 2 predicate places. [2022-12-05 23:43:11,763 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:43:11,763 INFO L89 Accepts]: Start accepts. Operand has 17 places, 9 transitions, 31 flow [2022-12-05 23:43:11,765 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:43:11,765 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:43:11,766 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 17 places, 9 transitions, 31 flow [2022-12-05 23:43:11,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 15 places, 9 transitions, 31 flow [2022-12-05 23:43:11,780 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-05 23:43:11,781 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:43:11,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22 conditions, 11 events. 0/11 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 8 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:43:11,781 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 15 places, 9 transitions, 31 flow [2022-12-05 23:43:11,782 INFO L188 LiptonReduction]: Number of co-enabled transitions 18 [2022-12-05 23:43:11,805 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [195] L688-->L692: Formula: (and (= (store |v_#pthreadsMutex_239| |v_~#A~0.base_107| (store (select |v_#pthreadsMutex_239| |v_~#A~0.base_107|) |v_~#A~0.offset_107| 0)) |v_#pthreadsMutex_237|) (= v_~g~0_61 2)) InVars {#pthreadsMutex=|v_#pthreadsMutex_239|, ~#A~0.offset=|v_~#A~0.offset_107|, ~#A~0.base=|v_~#A~0.base_107|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_237|, ~#A~0.offset=|v_~#A~0.offset_107|, ~g~0=v_~g~0_61, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_33|, ~#A~0.base=|v_~#A~0.base_107|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_#t~nondet3] and [177] $Ultimate##0-->L688: Formula: (let ((.cse2 (select |v_#pthreadsMutex_165| |v_~#B~0.base_53|))) (let ((.cse0 (store |v_#pthreadsMutex_165| |v_~#B~0.base_53| (store .cse2 |v_~#B~0.offset_53| 1)))) (let ((.cse1 (select .cse0 |v_~#A~0.base_61|))) (and (= v_~g~0_23 1) (= (store .cse0 |v_~#A~0.base_61| (store .cse1 |v_~#A~0.offset_61| 1)) |v_#pthreadsMutex_163|) (= v_t_funThread1of1ForFork0_~arg.base_19 |v_t_funThread1of1ForFork0_#in~arg.base_19|) (= (select .cse2 |v_~#B~0.offset_53|) 0) (= (select .cse1 |v_~#A~0.offset_61|) 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_19| v_t_funThread1of1ForFork0_~arg.offset_19))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_165|, ~#B~0.base=|v_~#B~0.base_53|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_19|, ~#A~0.offset=|v_~#A~0.offset_61|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_19|, ~#A~0.base=|v_~#A~0.base_61|, ~#B~0.offset=|v_~#B~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_163|, ~#B~0.base=|v_~#B~0.base_53|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_19|, ~#A~0.offset=|v_~#A~0.offset_61|, ~g~0=v_~g~0_23, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_19, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_23|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_19|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_19|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_19, ~#A~0.base=|v_~#A~0.base_61|, ~#B~0.offset=|v_~#B~0.offset_53|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base] [2022-12-05 23:43:11,875 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [197] L688-->L688: Formula: (let ((.cse3 (store |v_#pthreadsMutex_311| |v_~#A~0.base_133| (store (select |v_#pthreadsMutex_311| |v_~#A~0.base_133|) |v_~#A~0.offset_133| 0)))) (let ((.cse0 (select .cse3 |v_~#B~0.base_93|))) (let ((.cse2 (store .cse3 |v_~#B~0.base_93| (store .cse0 |v_~#B~0.offset_93| 1)))) (let ((.cse1 (select .cse2 |v_~#A~0.base_133|))) (and (= (select .cse0 |v_~#B~0.offset_93|) 0) (= v_~g~0_77 1) (= v_t_funThread1of1ForFork0_~arg.base_35 |v_t_funThread1of1ForFork0_#in~arg.base_35|) (= (select .cse1 |v_~#A~0.offset_133|) 0) (= (store .cse2 |v_~#A~0.base_133| (store .cse1 |v_~#A~0.offset_133| 1)) |v_#pthreadsMutex_309|) (= |v_t_funThread1of1ForFork0_#in~arg.offset_35| v_t_funThread1of1ForFork0_~arg.offset_35)))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_311|, ~#B~0.base=|v_~#B~0.base_93|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_35|, ~#A~0.offset=|v_~#A~0.offset_133|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_35|, ~#A~0.base=|v_~#A~0.base_133|, ~#B~0.offset=|v_~#B~0.offset_93|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_309|, ~#B~0.base=|v_~#B~0.base_93|, ~g~0=v_~g~0_77, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_35|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_35, ~#B~0.offset=|v_~#B~0.offset_93|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_35|, ~#A~0.offset=|v_~#A~0.offset_133|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_35, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_39|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_35|, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_41|, ~#A~0.base=|v_~#A~0.base_133|} 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_funEXIT: Formula: (and (= |v_t_funThread1of1ForFork0_#res.offset_7| 0) (= |v_t_funThread1of1ForFork0_#res.base_7| 0) (= (store |v_#pthreadsMutex_80| |v_~#B~0.base_33| (store (select |v_#pthreadsMutex_80| |v_~#B~0.base_33|) |v_~#B~0.offset_33| 0)) |v_#pthreadsMutex_79|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_80|, ~#B~0.base=|v_~#B~0.base_33|, ~#B~0.offset=|v_~#B~0.offset_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_79|, ~#B~0.base=|v_~#B~0.base_33|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_7|, ~#B~0.offset=|v_~#B~0.offset_33|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#res.offset] [2022-12-05 23:43:11,945 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:43:11,947 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-05 23:43:11,947 INFO L495 AbstractCegarLoop]: Abstraction has has 14 places, 8 transitions, 32 flow [2022-12-05 23:43:11,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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-05 23:43:11,947 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:43:11,947 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-05 23:43:11,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:43:11,948 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 23:43:11,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:43:11,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1947114439, now seen corresponding path program 1 times [2022-12-05 23:43:11,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:43:11,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162129385] [2022-12-05 23:43:11,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:43:11,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:43:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:43:12,125 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-05 23:43:12,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:43:12,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162129385] [2022-12-05 23:43:12,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162129385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:43:12,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:43:12,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:43:12,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171376672] [2022-12-05 23:43:12,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:43:12,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:43:12,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:43:12,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:43:12,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:43:12,141 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 8 [2022-12-05 23:43:12,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 14 places, 8 transitions, 32 flow. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-05 23:43:12,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:43:12,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 8 [2022-12-05 23:43:12,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:43:12,164 INFO L130 PetriNetUnfolder]: 2/12 cut-off events. [2022-12-05 23:43:12,164 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:43:12,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 12 events. 2/12 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 10 event pairs, 1 based on Foata normal form. 2/14 useless extension candidates. Maximal degree in co-relation 25. Up to 7 conditions per place. [2022-12-05 23:43:12,164 INFO L137 encePairwiseOnDemand]: 5/8 looper letters, 5 selfloop transitions, 3 changer transitions 0/8 dead transitions. [2022-12-05 23:43:12,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 15 places, 8 transitions, 42 flow [2022-12-05 23:43:12,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:43:12,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:43:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2022-12-05 23:43:12,165 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-05 23:43:12,165 INFO L175 Difference]: Start difference. First operand has 14 places, 8 transitions, 32 flow. Second operand 3 states and 10 transitions. [2022-12-05 23:43:12,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 15 places, 8 transitions, 42 flow [2022-12-05 23:43:12,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 8 transitions, 38 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:43:12,166 INFO L231 Difference]: Finished difference. Result has 13 places, 7 transitions, 26 flow [2022-12-05 23:43:12,166 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=8, PETRI_DIFFERENCE_MINUEND_FLOW=20, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=26, PETRI_PLACES=13, PETRI_TRANSITIONS=7} [2022-12-05 23:43:12,167 INFO L294 CegarLoopForPetriNet]: 15 programPoint places, -2 predicate places. [2022-12-05 23:43:12,167 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:43:12,167 INFO L89 Accepts]: Start accepts. Operand has 13 places, 7 transitions, 26 flow [2022-12-05 23:43:12,167 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:43:12,167 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:43:12,168 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 13 places, 7 transitions, 26 flow [2022-12-05 23:43:12,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 13 places, 7 transitions, 26 flow [2022-12-05 23:43:12,171 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-05 23:43:12,171 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:43:12,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19 conditions, 8 events. 0/8 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 3 event pairs, 0 based on Foata normal form. 0/8 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:43:12,172 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 13 places, 7 transitions, 26 flow [2022-12-05 23:43:12,172 INFO L188 LiptonReduction]: Number of co-enabled transitions 4 [2022-12-05 23:43:12,307 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:43:12,308 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-05 23:43:12,308 INFO L495 AbstractCegarLoop]: Abstraction has has 10 places, 4 transitions, 18 flow [2022-12-05 23:43:12,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-05 23:43:12,309 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:43:12,309 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-05 23:43:12,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:43:12,309 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 23:43:12,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:43:12,309 INFO L85 PathProgramCache]: Analyzing trace with hash 6913077, now seen corresponding path program 1 times [2022-12-05 23:43:12,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:43:12,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317475541] [2022-12-05 23:43:12,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:43:12,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:43:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:43:12,517 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-05 23:43:12,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:43:12,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317475541] [2022-12-05 23:43:12,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317475541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:43:12,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:43:12,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:43:12,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323411737] [2022-12-05 23:43:12,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:43:12,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:43:12,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:43:12,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:43:12,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:43:12,523 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 4 [2022-12-05 23:43:12,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 10 places, 4 transitions, 18 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-05 23:43:12,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:43:12,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 4 [2022-12-05 23:43:12,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:43:12,531 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-05 23:43:12,531 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:43:12,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14 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-05 23:43:12,531 INFO L137 encePairwiseOnDemand]: 1/4 looper letters, 0 selfloop transitions, 0 changer transitions 3/3 dead transitions. [2022-12-05 23:43:12,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 11 places, 3 transitions, 18 flow [2022-12-05 23:43:12,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:43:12,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:43:12,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2022-12-05 23:43:12,532 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-05 23:43:12,532 INFO L175 Difference]: Start difference. First operand has 10 places, 4 transitions, 18 flow. Second operand 4 states and 4 transitions. [2022-12-05 23:43:12,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 11 places, 3 transitions, 18 flow [2022-12-05 23:43:12,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 9 places, 3 transitions, 14 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 23:43:12,533 INFO L231 Difference]: Finished difference. Result has 9 places, 0 transitions, 0 flow [2022-12-05 23:43:12,533 INFO L276 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-05 23:43:12,534 INFO L294 CegarLoopForPetriNet]: 15 programPoint places, -6 predicate places. [2022-12-05 23:43:12,534 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:43:12,535 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 9 places, 0 transitions, 0 flow [2022-12-05 23:43:12,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-05 23:43:12,535 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-05 23:43:12,535 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:43:12,535 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-05 23:43:12,536 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-05 23:43:12,536 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:43:12,536 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:43:12,537 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-05 23:43:12,537 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-05 23:43:12,537 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-05 23:43:12,539 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-05 23:43:12,539 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2022-12-05 23:43:12,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:43:12,540 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-12-05 23:43:12,544 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:43:12,544 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:43:12,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:43:12 BasicIcfg [2022-12-05 23:43:12,554 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:43:12,555 INFO L158 Benchmark]: Toolchain (without parser) took 5215.65ms. Allocated memory was 181.4MB in the beginning and 227.5MB in the end (delta: 46.1MB). Free memory was 156.6MB in the beginning and 144.5MB in the end (delta: 12.0MB). Peak memory consumption was 59.5MB. Max. memory is 8.0GB. [2022-12-05 23:43:12,555 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 181.4MB. Free memory was 159.2MB in the beginning and 159.1MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:43:12,556 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.99ms. Allocated memory is still 181.4MB. Free memory was 156.6MB in the beginning and 137.4MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-05 23:43:12,556 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.67ms. Allocated memory is still 181.4MB. Free memory was 137.4MB in the beginning and 135.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:43:12,556 INFO L158 Benchmark]: Boogie Preprocessor took 32.62ms. Allocated memory is still 181.4MB. Free memory was 135.7MB in the beginning and 134.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 23:43:12,556 INFO L158 Benchmark]: RCFGBuilder took 404.40ms. Allocated memory is still 181.4MB. Free memory was 134.3MB in the beginning and 121.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-05 23:43:12,556 INFO L158 Benchmark]: TraceAbstraction took 4315.86ms. Allocated memory was 181.4MB in the beginning and 227.5MB in the end (delta: 46.1MB). Free memory was 121.1MB in the beginning and 144.5MB in the end (delta: -23.4MB). Peak memory consumption was 23.8MB. Max. memory is 8.0GB. [2022-12-05 23:43:12,558 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.17ms. Allocated memory is still 181.4MB. Free memory was 159.2MB in the beginning and 159.1MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 389.99ms. Allocated memory is still 181.4MB. Free memory was 156.6MB in the beginning and 137.4MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.67ms. Allocated memory is still 181.4MB. Free memory was 137.4MB in the beginning and 135.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.62ms. Allocated memory is still 181.4MB. Free memory was 135.7MB in the beginning and 134.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 404.40ms. Allocated memory is still 181.4MB. Free memory was 134.3MB in the beginning and 121.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4315.86ms. Allocated memory was 181.4MB in the beginning and 227.5MB in the end (delta: 46.1MB). Free memory was 121.1MB in the beginning and 144.5MB in the end (delta: -23.4MB). Peak memory consumption was 23.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 58 PlacesBefore, 15 PlacesAfterwards, 54 TransitionsBefore, 11 TransitionsAfterwards, 308 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 27 TrivialYvCompositions, 19 ConcurrentYvCompositions, 0 ChoiceCompositions, 46 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 211, independent: 186, independent conditional: 186, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 211, independent: 186, independent conditional: 0, independent unconditional: 186, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 211, independent: 186, independent conditional: 0, independent unconditional: 186, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 211, independent: 186, independent conditional: 0, independent unconditional: 186, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 185, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 185, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 35, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 88, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 211, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 185, unknown conditional: 0, unknown unconditional: 185] , Statistics on independence cache: Total cache size (in pairs): 277, Positive cache size: 261, Positive conditional cache size: 0, Positive unconditional cache size: 261, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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.2s, 15 PlacesBefore, 14 PlacesAfterwards, 9 TransitionsBefore, 8 TransitionsAfterwards, 18 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 13, independent conditional: 11, independent unconditional: 2, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 13 PlacesBefore, 10 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: 0, independent unconditional: 2, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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): 12, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, 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): 12, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, 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: 4.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 0 mSDtfsCounter, 30 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=1, InterpolantAutomatonStates: 10, 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.5s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 57 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-05 23:43:12,582 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...