/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/36-apron_11-traces-max-simple_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:43:43,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:43:43,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:43:43,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:43:43,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:43:43,767 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:43:43,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:43:43,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:43:43,777 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:43:43,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:43:43,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:43:43,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:43:43,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:43:43,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:43:43,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:43:43,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:43:43,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:43:43,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:43:43,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:43:43,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:43:43,801 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:43:43,802 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:43:43,803 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:43:43,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:43:43,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:43:43,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:43:43,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:43:43,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:43:43,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:43:43,813 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:43:43,813 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:43:43,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:43:43,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:43:43,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:43:43,820 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:43:43,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:43:43,821 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:43:43,821 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:43:43,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:43:43,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:43:43,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:43:43,824 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:43,855 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:43:43,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:43:43,857 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:43:43,857 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:43:43,857 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:43:43,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:43:43,858 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:43:43,858 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:43:43,858 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:43:43,858 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:43:43,859 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:43:43,859 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:43:43,860 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:43:43,860 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:43:43,860 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:43:43,860 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:43:43,860 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:43:43,860 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:43:43,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:43:43,861 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:43:43,861 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:43:43,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:43:43,861 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:43:43,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:43:43,861 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:43:43,861 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:43:43,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:43:43,862 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:43:43,862 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:44,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:43:44,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:43:44,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:43:44,183 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:43:44,184 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:43:44,185 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_11-traces-max-simple_true.i [2022-12-05 23:43:45,344 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:43:45,566 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:43:45,566 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_11-traces-max-simple_true.i [2022-12-05 23:43:45,578 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/622f81d5f/37c2b80968804eb78952d114c4bbfe99/FLAGa25b4547c [2022-12-05 23:43:45,589 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/622f81d5f/37c2b80968804eb78952d114c4bbfe99 [2022-12-05 23:43:45,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:43:45,592 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:43:45,595 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:43:45,595 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:43:45,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:43:45,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:43:45" (1/1) ... [2022-12-05 23:43:45,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f5d0bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:45, skipping insertion in model container [2022-12-05 23:43:45,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:43:45" (1/1) ... [2022-12-05 23:43:45,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:43:45,654 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:43:45,826 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/36-apron_11-traces-max-simple_true.i[1089,1102] [2022-12-05 23:43:45,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:43:46,000 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:43:46,013 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/36-apron_11-traces-max-simple_true.i[1089,1102] [2022-12-05 23:43:46,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:43:46,081 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:43:46,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:46 WrapperNode [2022-12-05 23:43:46,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:43:46,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:43:46,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:43:46,084 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:43:46,091 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:46" (1/1) ... [2022-12-05 23:43:46,118 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:46" (1/1) ... [2022-12-05 23:43:46,139 INFO L138 Inliner]: procedures = 162, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2022-12-05 23:43:46,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:43:46,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:43:46,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:43:46,140 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:43:46,147 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:46" (1/1) ... [2022-12-05 23:43:46,147 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:46" (1/1) ... [2022-12-05 23:43:46,152 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:46" (1/1) ... [2022-12-05 23:43:46,153 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:46" (1/1) ... [2022-12-05 23:43:46,164 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:46" (1/1) ... [2022-12-05 23:43:46,166 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:46" (1/1) ... [2022-12-05 23:43:46,167 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:46" (1/1) ... [2022-12-05 23:43:46,168 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:46" (1/1) ... [2022-12-05 23:43:46,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:43:46,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:43:46,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:43:46,170 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:43:46,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:46" (1/1) ... [2022-12-05 23:43:46,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:43:46,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:43:46,204 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:46,231 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:46,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:43:46,249 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-05 23:43:46,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:43:46,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:43:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-05 23:43:46,250 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-05 23:43:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:43:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:43:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:43:46,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:43:46,251 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:46,353 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:43:46,354 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:43:46,456 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:43:46,461 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:43:46,462 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:43:46,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:43:46 BoogieIcfgContainer [2022-12-05 23:43:46,464 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:43:46,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:43:46,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:43:46,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:43:46,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:43:45" (1/3) ... [2022-12-05 23:43:46,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b1cc77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:43:46, skipping insertion in model container [2022-12-05 23:43:46,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:43:46" (2/3) ... [2022-12-05 23:43:46,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b1cc77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:43:46, skipping insertion in model container [2022-12-05 23:43:46,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:43:46" (3/3) ... [2022-12-05 23:43:46,482 INFO L112 eAbstractionObserver]: Analyzing ICFG 36-apron_11-traces-max-simple_true.i [2022-12-05 23:43:46,502 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:43:46,502 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:43:46,502 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:43:46,570 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:43:46,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 60 transitions, 125 flow [2022-12-05 23:43:46,628 INFO L130 PetriNetUnfolder]: 2/59 cut-off events. [2022-12-05 23:43:46,629 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:43:46,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 59 events. 2/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2022-12-05 23:43:46,634 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 60 transitions, 125 flow [2022-12-05 23:43:46,637 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 59 transitions, 121 flow [2022-12-05 23:43:46,638 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:43:46,652 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 59 transitions, 121 flow [2022-12-05 23:43:46,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 59 transitions, 121 flow [2022-12-05 23:43:46,671 INFO L130 PetriNetUnfolder]: 2/59 cut-off events. [2022-12-05 23:43:46,671 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:43:46,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 59 events. 2/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2022-12-05 23:43:46,674 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 59 transitions, 121 flow [2022-12-05 23:43:46,674 INFO L188 LiptonReduction]: Number of co-enabled transitions 600 [2022-12-05 23:43:48,643 INFO L203 LiptonReduction]: Total number of compositions: 51 [2022-12-05 23:43:48,656 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:43:48,662 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;@5a1fcb73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:43:48,662 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-05 23:43:48,665 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-05 23:43:48,665 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:43:48,665 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:43:48,665 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 23:43:48,666 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-12-05 23:43:48,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:43:48,670 INFO L85 PathProgramCache]: Analyzing trace with hash 232492, now seen corresponding path program 1 times [2022-12-05 23:43:48,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:43:48,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13870401] [2022-12-05 23:43:48,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:43:48,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:43:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:43:48,796 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:48,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:43:48,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13870401] [2022-12-05 23:43:48,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13870401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:43:48,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:43:48,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:43:48,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706443559] [2022-12-05 23:43:48,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:43:48,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-05 23:43:48,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:43:48,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-05 23:43:48,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-05 23:43:48,829 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-05 23:43:48,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 37 flow. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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:48,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:43:48,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-05 23:43:48,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:43:48,857 INFO L130 PetriNetUnfolder]: 18/48 cut-off events. [2022-12-05 23:43:48,857 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:43:48,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 48 events. 18/48 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 117 event pairs, 18 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 91. Up to 48 conditions per place. [2022-12-05 23:43:48,859 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 8 selfloop transitions, 0 changer transitions 3/12 dead transitions. [2022-12-05 23:43:48,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 12 transitions, 49 flow [2022-12-05 23:43:48,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-05 23:43:48,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-05 23:43:48,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 18 transitions. [2022-12-05 23:43:48,868 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2022-12-05 23:43:48,869 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 37 flow. Second operand 2 states and 18 transitions. [2022-12-05 23:43:48,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 12 transitions, 49 flow [2022-12-05 23:43:48,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 12 transitions, 48 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:43:48,872 INFO L231 Difference]: Finished difference. Result has 16 places, 9 transitions, 20 flow [2022-12-05 23:43:48,874 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=26, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=20, PETRI_PLACES=16, PETRI_TRANSITIONS=9} [2022-12-05 23:43:48,877 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, -3 predicate places. [2022-12-05 23:43:48,877 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:43:48,878 INFO L89 Accepts]: Start accepts. Operand has 16 places, 9 transitions, 20 flow [2022-12-05 23:43:48,879 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:43:48,880 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:43:48,880 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 16 places, 9 transitions, 20 flow [2022-12-05 23:43:48,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 12 places, 9 transitions, 20 flow [2022-12-05 23:43:48,884 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-05 23:43:48,885 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:43:48,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12 conditions, 9 events. 0/9 cut-off events. For 0/0 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/8 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-05 23:43:48,885 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 12 places, 9 transitions, 20 flow [2022-12-05 23:43:48,885 INFO L188 LiptonReduction]: Number of co-enabled transitions 24 [2022-12-05 23:43:48,942 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:43:48,943 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-05 23:43:48,944 INFO L495 AbstractCegarLoop]: Abstraction has has 11 places, 8 transitions, 18 flow [2022-12-05 23:43:48,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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:48,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:43:48,944 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 23:43:48,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:43:48,945 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-12-05 23:43:48,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:43:48,945 INFO L85 PathProgramCache]: Analyzing trace with hash 223401860, now seen corresponding path program 1 times [2022-12-05 23:43:48,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:43:48,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366811029] [2022-12-05 23:43:48,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:43:48,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:43:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:43:49,063 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:49,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:43:49,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366811029] [2022-12-05 23:43:49,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366811029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:43:49,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:43:49,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:43:49,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312232170] [2022-12-05 23:43:49,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:43:49,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:43:49,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:43:49,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:43:49,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:43:49,066 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 8 [2022-12-05 23:43:49,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 11 places, 8 transitions, 18 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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:49,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:43:49,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 8 [2022-12-05 23:43:49,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:43:49,083 INFO L130 PetriNetUnfolder]: 4/19 cut-off events. [2022-12-05 23:43:49,083 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:43:49,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 19 events. 4/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 3 based on Foata normal form. 3/22 useless extension candidates. Maximal degree in co-relation 33. Up to 15 conditions per place. [2022-12-05 23:43:49,084 INFO L137 encePairwiseOnDemand]: 5/8 looper letters, 5 selfloop transitions, 2 changer transitions 3/10 dead transitions. [2022-12-05 23:43:49,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 13 places, 10 transitions, 40 flow [2022-12-05 23:43:49,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:43:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:43:49,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2022-12-05 23:43:49,085 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-05 23:43:49,085 INFO L175 Difference]: Start difference. First operand has 11 places, 8 transitions, 18 flow. Second operand 3 states and 13 transitions. [2022-12-05 23:43:49,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 13 places, 10 transitions, 40 flow [2022-12-05 23:43:49,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 10 transitions, 40 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:43:49,086 INFO L231 Difference]: Finished difference. Result has 14 places, 7 transitions, 24 flow [2022-12-05 23:43:49,086 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=8, PETRI_DIFFERENCE_MINUEND_FLOW=18, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=24, PETRI_PLACES=14, PETRI_TRANSITIONS=7} [2022-12-05 23:43:49,087 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, -5 predicate places. [2022-12-05 23:43:49,087 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:43:49,087 INFO L89 Accepts]: Start accepts. Operand has 14 places, 7 transitions, 24 flow [2022-12-05 23:43:49,087 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:43:49,087 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:43:49,088 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 14 places, 7 transitions, 24 flow [2022-12-05 23:43:49,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 13 places, 7 transitions, 24 flow [2022-12-05 23:43:49,090 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-05 23:43:49,090 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:43:49,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16 conditions, 7 events. 0/7 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 1 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-05 23:43:49,090 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 13 places, 7 transitions, 24 flow [2022-12-05 23:43:49,090 INFO L188 LiptonReduction]: Number of co-enabled transitions 2 [2022-12-05 23:43:49,094 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [152] L694-1-->L696: Formula: (= |v_ULTIMATE.start_main_~x~0#1_9| v_~g~0_6) InVars {~g~0=v_~g~0_6} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_9|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_4|, ~g~0=v_~g~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_#t~nondet4#1] and [214] $Ultimate##0-->L19-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_271| |v_~#A~0.base_125|)) (.cse1 (= v_~g~0_144 2))) (and (= |v_t_funThread1of1ForFork0_#in~arg#1.base_29| |v_t_funThread1of1ForFork0_~arg#1.base_29|) (= (select .cse0 |v_~#A~0.offset_125|) 0) .cse1 (= (store |v_#pthreadsMutex_271| |v_~#A~0.base_125| (store .cse0 |v_~#A~0.offset_125| 1)) |v_#pthreadsMutex_270|) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_119| |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_87|) (= |v_t_funThread1of1ForFork0_~arg#1.offset_29| |v_t_funThread1of1ForFork0_#in~arg#1.offset_29|) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_87| (ite .cse1 1 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_271|, ~#A~0.offset=|v_~#A~0.offset_125|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_29|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_29|, ~#A~0.base=|v_~#A~0.base_125|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_87|, #pthreadsMutex=|v_#pthreadsMutex_270|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_43|, ~#A~0.offset=|v_~#A~0.offset_125|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_29|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_29|, ~g~0=v_~g~0_144, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_29|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_29|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_119|, ~#A~0.base=|v_~#A~0.base_125|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, #pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_~arg#1.offset, ~g~0, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] [2022-12-05 23:43:49,279 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [217] L693-3-->L19-1: Formula: false InVars {} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_117|, #pthreadsMutex=|v_#pthreadsMutex_296|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_82|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_55|, ~g~0=v_~g~0_163, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_41|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_45|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_99|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_37|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_41|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_131|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, #pthreadsMutex, ULTIMATE.start_main_#t~nondet4#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_#t~nondet1#1, ULTIMATE.start_main_#t~nondet3#1, t_funThread1of1ForFork0_~arg#1.offset, ~g~0, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, ULTIMATE.start_main_#t~pre2#1] and [205] L696-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_25| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_59|) (= v_~g~0_74 |v_ULTIMATE.start_main_~y~0#1_39|) (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_59| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_25| (ite (= |v_ULTIMATE.start_main_~x~0#1_49| |v_ULTIMATE.start_main_~y~0#1_39|) 1 0))) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_49|, ~g~0=v_~g~0_74} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_49|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_25|, ULTIMATE.start_main_~y~0#1=|v_ULTIMATE.start_main_~y~0#1_39|, ~g~0=v_~g~0_74, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_59|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start_main_~y~0#1, ULTIMATE.start___VERIFIER_assert_~cond#1] [2022-12-05 23:43:49,282 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [218] L693-3-->t_funEXIT: Formula: false InVars {} OutVars{t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_57|, ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_119|, #pthreadsMutex=|v_#pthreadsMutex_302|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_86|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_57|, ~g~0=v_~g~0_167, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_43|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_47|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_101|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_39|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_43|, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_57|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_133|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#res#1.offset, ULTIMATE.start_main_~x~0#1, #pthreadsMutex, ULTIMATE.start_main_#t~nondet4#1, t_funThread1of1ForFork0_#t~nondet1#1, ~g~0, t_funThread1of1ForFork0_~arg#1.base, ULTIMATE.start_main_#t~pre2#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, ULTIMATE.start_main_#t~nondet3#1, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_#res#1.base, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] and [205] L696-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_25| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_59|) (= v_~g~0_74 |v_ULTIMATE.start_main_~y~0#1_39|) (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_59| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_25| (ite (= |v_ULTIMATE.start_main_~x~0#1_49| |v_ULTIMATE.start_main_~y~0#1_39|) 1 0))) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_49|, ~g~0=v_~g~0_74} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_49|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_25|, ULTIMATE.start_main_~y~0#1=|v_ULTIMATE.start_main_~y~0#1_39|, ~g~0=v_~g~0_74, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_59|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start_main_~y~0#1, ULTIMATE.start___VERIFIER_assert_~cond#1] [2022-12-05 23:43:49,285 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 23:43:49,286 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-05 23:43:49,286 INFO L495 AbstractCegarLoop]: Abstraction has has 10 places, 4 transitions, 22 flow [2022-12-05 23:43:49,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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:49,287 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:43:49,287 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 23:43:49,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:43:49,287 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-12-05 23:43:49,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:43:49,288 INFO L85 PathProgramCache]: Analyzing trace with hash 232502, now seen corresponding path program 1 times [2022-12-05 23:43:49,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:43:49,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177504490] [2022-12-05 23:43:49,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:43:49,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:43:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:43:49,306 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:49,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:43:49,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177504490] [2022-12-05 23:43:49,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177504490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:43:49,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:43:49,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:43:49,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404822813] [2022-12-05 23:43:49,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:43:49,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-05 23:43:49,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:43:49,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-05 23:43:49,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-05 23:43:49,308 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 4 [2022-12-05 23:43:49,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 10 places, 4 transitions, 22 flow. Second operand has 2 states, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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:49,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:43:49,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 4 [2022-12-05 23:43:49,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:43:49,313 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-05 23:43:49,313 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:43:49,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10 conditions, 2 events. 0/2 cut-off events. For 1/1 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/3 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:43:49,313 INFO L137 encePairwiseOnDemand]: 2/4 looper letters, 0 selfloop transitions, 0 changer transitions 2/2 dead transitions. [2022-12-05 23:43:49,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 8 places, 2 transitions, 10 flow [2022-12-05 23:43:49,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-05 23:43:49,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-05 23:43:49,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 4 transitions. [2022-12-05 23:43:49,320 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 23:43:49,320 INFO L175 Difference]: Start difference. First operand has 10 places, 4 transitions, 22 flow. Second operand 2 states and 4 transitions. [2022-12-05 23:43:49,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 8 places, 2 transitions, 10 flow [2022-12-05 23:43:49,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 8 places, 2 transitions, 10 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:43:49,321 INFO L231 Difference]: Finished difference. Result has 8 places, 0 transitions, 0 flow [2022-12-05 23:43:49,321 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=4, PETRI_DIFFERENCE_MINUEND_FLOW=6, PETRI_DIFFERENCE_MINUEND_PLACES=7, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=0, PETRI_PLACES=8, PETRI_TRANSITIONS=0} [2022-12-05 23:43:49,321 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, -11 predicate places. [2022-12-05 23:43:49,322 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:43:49,322 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 8 places, 0 transitions, 0 flow [2022-12-05 23:43:49,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-05 23:43:49,322 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-05 23:43:49,322 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:43:49,322 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:49,323 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-05 23:43:49,323 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:43:49,323 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:43:49,324 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-05 23:43:49,324 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-05 23:43:49,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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:49,326 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-05 23:43:49,326 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-05 23:43:49,327 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-12-05 23:43:49,327 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-12-05 23:43:49,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:43:49,327 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-12-05 23:43:49,331 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:43:49,331 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:43:49,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:43:49 BasicIcfg [2022-12-05 23:43:49,334 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:43:49,335 INFO L158 Benchmark]: Toolchain (without parser) took 3742.40ms. Allocated memory was 179.3MB in the beginning and 222.3MB in the end (delta: 43.0MB). Free memory was 138.4MB in the beginning and 120.8MB in the end (delta: 17.5MB). Peak memory consumption was 61.1MB. Max. memory is 8.0GB. [2022-12-05 23:43:49,335 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 179.3MB. Free memory is still 156.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:43:49,338 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.83ms. Allocated memory is still 179.3MB. Free memory was 138.4MB in the beginning and 119.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-05 23:43:49,338 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.33ms. Allocated memory is still 179.3MB. Free memory was 119.5MB in the beginning and 117.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 23:43:49,339 INFO L158 Benchmark]: Boogie Preprocessor took 29.58ms. Allocated memory is still 179.3MB. Free memory was 117.9MB in the beginning and 116.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:43:49,339 INFO L158 Benchmark]: RCFGBuilder took 293.69ms. Allocated memory is still 179.3MB. Free memory was 116.4MB in the beginning and 104.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-05 23:43:49,339 INFO L158 Benchmark]: TraceAbstraction took 2868.74ms. Allocated memory was 179.3MB in the beginning and 222.3MB in the end (delta: 43.0MB). Free memory was 103.3MB in the beginning and 120.8MB in the end (delta: -17.6MB). Peak memory consumption was 26.5MB. Max. memory is 8.0GB. [2022-12-05 23:43:49,341 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.09ms. Allocated memory is still 179.3MB. Free memory is still 156.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 486.83ms. Allocated memory is still 179.3MB. Free memory was 138.4MB in the beginning and 119.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.33ms. Allocated memory is still 179.3MB. Free memory was 119.5MB in the beginning and 117.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.58ms. Allocated memory is still 179.3MB. Free memory was 117.9MB in the beginning and 116.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 293.69ms. Allocated memory is still 179.3MB. Free memory was 116.4MB in the beginning and 104.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2868.74ms. Allocated memory was 179.3MB in the beginning and 222.3MB in the end (delta: 43.0MB). Free memory was 103.3MB in the beginning and 120.8MB in the end (delta: -17.6MB). Peak memory consumption was 26.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 61 PlacesBefore, 19 PlacesAfterwards, 59 TransitionsBefore, 17 TransitionsAfterwards, 600 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 22 TrivialYvCompositions, 24 ConcurrentYvCompositions, 0 ChoiceCompositions, 51 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 685, independent: 630, independent conditional: 630, independent unconditional: 0, dependent: 55, dependent conditional: 55, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 685, independent: 630, independent conditional: 0, independent unconditional: 630, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 685, independent: 630, independent conditional: 0, independent unconditional: 630, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 685, independent: 630, independent conditional: 0, independent unconditional: 630, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 492, independent: 474, independent conditional: 0, independent unconditional: 474, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 492, independent: 435, independent conditional: 0, independent unconditional: 435, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 57, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 65, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 685, independent: 156, independent conditional: 0, independent unconditional: 156, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 492, unknown conditional: 0, unknown unconditional: 492] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 993, Positive conditional cache size: 0, Positive unconditional cache size: 993, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 12 PlacesBefore, 11 PlacesAfterwards, 9 TransitionsBefore, 8 TransitionsAfterwards, 24 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 31, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 31, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 31, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 13, Positive conditional cache size: 0, Positive unconditional cache size: 13, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, 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, 13 PlacesBefore, 10 PlacesAfterwards, 7 TransitionsBefore, 4 TransitionsAfterwards, 2 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 14, Positive conditional cache size: 0, Positive unconditional cache size: 14, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, 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): 21, Positive cache size: 14, Positive conditional cache size: 0, Positive unconditional cache size: 14, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, 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 - 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, 75 locations, 4 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: 2.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 29 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 7, 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.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 10 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-05 23:43:49,364 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...