/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-a802222-m [2022-12-13 01:16:09,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 01:16:09,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 01:16:09,071 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 01:16:09,071 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 01:16:09,073 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 01:16:09,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 01:16:09,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 01:16:09,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 01:16:09,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 01:16:09,090 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 01:16:09,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 01:16:09,092 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 01:16:09,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 01:16:09,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 01:16:09,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 01:16:09,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 01:16:09,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 01:16:09,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 01:16:09,105 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 01:16:09,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 01:16:09,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 01:16:09,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 01:16:09,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 01:16:09,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 01:16:09,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 01:16:09,123 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 01:16:09,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 01:16:09,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 01:16:09,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 01:16:09,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 01:16:09,125 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 01:16:09,125 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 01:16:09,126 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 01:16:09,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 01:16:09,127 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 01:16:09,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 01:16:09,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 01:16:09,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 01:16:09,128 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 01:16:09,128 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 01:16:09,129 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 01:16:09,157 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 01:16:09,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 01:16:09,158 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 01:16:09,158 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 01:16:09,158 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 01:16:09,158 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 01:16:09,158 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 01:16:09,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 01:16:09,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 01:16:09,159 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 01:16:09,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 01:16:09,159 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 01:16:09,159 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 01:16:09,159 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 01:16:09,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 01:16:09,159 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 01:16:09,159 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 01:16:09,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 01:16:09,159 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 01:16:09,160 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 01:16:09,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 01:16:09,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:16:09,160 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 01:16:09,160 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 01:16:09,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 01:16:09,160 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 01:16:09,160 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 01:16:09,160 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 01:16:09,161 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 01:16:09,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 01:16:09,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 01:16:09,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 01:16:09,460 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 01:16:09,460 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 01:16:09,464 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-13 01:16:10,452 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 01:16:10,680 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 01:16:10,680 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_11-traces-max-simple_true.i [2022-12-13 01:16:10,688 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/348f5980d/ef23934484724302bbaf3d8c3f450d53/FLAG256c0290b [2022-12-13 01:16:10,700 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/348f5980d/ef23934484724302bbaf3d8c3f450d53 [2022-12-13 01:16:10,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 01:16:10,702 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 01:16:10,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 01:16:10,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 01:16:10,705 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 01:16:10,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:16:10" (1/1) ... [2022-12-13 01:16:10,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75c5dc35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:10, skipping insertion in model container [2022-12-13 01:16:10,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:16:10" (1/1) ... [2022-12-13 01:16:10,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 01:16:10,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 01:16:10,894 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-13 01:16:11,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:16:11,047 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 01:16:11,058 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-13 01:16:11,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:16:11,123 INFO L208 MainTranslator]: Completed translation [2022-12-13 01:16:11,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:11 WrapperNode [2022-12-13 01:16:11,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 01:16:11,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 01:16:11,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 01:16:11,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 01:16:11,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:11" (1/1) ... [2022-12-13 01:16:11,155 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:11" (1/1) ... [2022-12-13 01:16:11,173 INFO L138 Inliner]: procedures = 162, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2022-12-13 01:16:11,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 01:16:11,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 01:16:11,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 01:16:11,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 01:16:11,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:11" (1/1) ... [2022-12-13 01:16:11,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:11" (1/1) ... [2022-12-13 01:16:11,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:11" (1/1) ... [2022-12-13 01:16:11,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:11" (1/1) ... [2022-12-13 01:16:11,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:11" (1/1) ... [2022-12-13 01:16:11,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:11" (1/1) ... [2022-12-13 01:16:11,200 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:11" (1/1) ... [2022-12-13 01:16:11,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:11" (1/1) ... [2022-12-13 01:16:11,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 01:16:11,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 01:16:11,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 01:16:11,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 01:16:11,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:11" (1/1) ... [2022-12-13 01:16:11,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:16:11,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:16:11,228 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 01:16:11,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 01:16:11,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 01:16:11,269 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 01:16:11,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 01:16:11,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 01:16:11,271 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-13 01:16:11,271 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-13 01:16:11,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 01:16:11,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 01:16:11,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 01:16:11,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 01:16:11,272 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 01:16:11,408 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 01:16:11,409 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 01:16:11,510 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 01:16:11,514 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 01:16:11,514 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 01:16:11,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:16:11 BoogieIcfgContainer [2022-12-13 01:16:11,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 01:16:11,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 01:16:11,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 01:16:11,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 01:16:11,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:16:10" (1/3) ... [2022-12-13 01:16:11,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@237bc5e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:16:11, skipping insertion in model container [2022-12-13 01:16:11,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:11" (2/3) ... [2022-12-13 01:16:11,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@237bc5e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:16:11, skipping insertion in model container [2022-12-13 01:16:11,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:16:11" (3/3) ... [2022-12-13 01:16:11,523 INFO L112 eAbstractionObserver]: Analyzing ICFG 36-apron_11-traces-max-simple_true.i [2022-12-13 01:16:11,536 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 01:16:11,537 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 01:16:11,537 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 01:16:11,567 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 01:16:11,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 60 transitions, 125 flow [2022-12-13 01:16:11,615 INFO L130 PetriNetUnfolder]: 2/59 cut-off events. [2022-12-13 01:16:11,615 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:16:11,619 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-13 01:16:11,619 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 60 transitions, 125 flow [2022-12-13 01:16:11,621 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 59 transitions, 121 flow [2022-12-13 01:16:11,623 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:16:11,635 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 59 transitions, 121 flow [2022-12-13 01:16:11,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 59 transitions, 121 flow [2022-12-13 01:16:11,651 INFO L130 PetriNetUnfolder]: 2/59 cut-off events. [2022-12-13 01:16:11,651 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:16:11,652 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-13 01:16:11,653 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 59 transitions, 121 flow [2022-12-13 01:16:11,653 INFO L226 LiptonReduction]: Number of co-enabled transitions 600 [2022-12-13 01:16:13,293 INFO L241 LiptonReduction]: Total number of compositions: 52 [2022-12-13 01:16:13,307 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 01:16:13,313 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;@5661472f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 01:16:13,313 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 01:16:13,321 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-13 01:16:13,322 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:16:13,322 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:16:13,322 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 01:16:13,323 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-13 01:16:13,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:16:13,327 INFO L85 PathProgramCache]: Analyzing trace with hash 243079, now seen corresponding path program 1 times [2022-12-13 01:16:13,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:16:13,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414969801] [2022-12-13 01:16:13,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:16:13,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:16:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:16:13,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:16:13,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:16:13,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414969801] [2022-12-13 01:16:13,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414969801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:16:13,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:16:13,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 01:16:13,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100444474] [2022-12-13 01:16:13,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:16:13,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 01:16:13,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:16:13,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 01:16:13,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 01:16:13,493 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2022-12-13 01:16:13,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 77 flow. Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:16:13,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:16:13,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2022-12-13 01:16:13,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:16:13,576 INFO L130 PetriNetUnfolder]: 120/293 cut-off events. [2022-12-13 01:16:13,576 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:16:13,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 293 events. 120/293 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1481 event pairs, 120 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 554. Up to 266 conditions per place. [2022-12-13 01:16:13,578 INFO L137 encePairwiseOnDemand]: 31/37 looper letters, 13 selfloop transitions, 0 changer transitions 14/31 dead transitions. [2022-12-13 01:16:13,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 115 flow [2022-12-13 01:16:13,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 01:16:13,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 01:16:13,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 43 transitions. [2022-12-13 01:16:13,587 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.581081081081081 [2022-12-13 01:16:13,588 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 77 flow. Second operand 2 states and 43 transitions. [2022-12-13 01:16:13,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 115 flow [2022-12-13 01:16:13,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 114 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 01:16:13,594 INFO L231 Difference]: Finished difference. Result has 35 places, 17 transitions, 36 flow [2022-12-13 01:16:13,595 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=36, PETRI_PLACES=35, PETRI_TRANSITIONS=17} [2022-12-13 01:16:13,598 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, -4 predicate places. [2022-12-13 01:16:13,599 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:16:13,599 INFO L89 Accepts]: Start accepts. Operand has 35 places, 17 transitions, 36 flow [2022-12-13 01:16:13,601 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:16:13,601 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:16:13,602 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 17 transitions, 36 flow [2022-12-13 01:16:13,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 17 transitions, 36 flow [2022-12-13 01:16:13,605 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-13 01:16:13,605 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:16:13,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 39 event pairs, 0 based on Foata normal form. 0/9 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 01:16:13,607 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 17 transitions, 36 flow [2022-12-13 01:16:13,607 INFO L226 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-13 01:16:13,867 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:16:13,869 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 270 [2022-12-13 01:16:13,869 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 15 transitions, 32 flow [2022-12-13 01:16:13,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:16:13,869 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:16:13,869 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 01:16:13,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 01:16:13,870 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-13 01:16:13,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:16:13,870 INFO L85 PathProgramCache]: Analyzing trace with hash 233562523, now seen corresponding path program 1 times [2022-12-13 01:16:13,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:16:13,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804007701] [2022-12-13 01:16:13,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:16:13,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:16:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:16:13,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:16:13,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:16:13,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804007701] [2022-12-13 01:16:13,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804007701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:16:13,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:16:13,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 01:16:13,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152351307] [2022-12-13 01:16:13,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:16:13,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:16:13,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:16:13,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:16:13,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:16:13,955 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-13 01:16:13,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 15 transitions, 32 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-13 01:16:13,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:16:13,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-13 01:16:13,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:16:13,991 INFO L130 PetriNetUnfolder]: 23/82 cut-off events. [2022-12-13 01:16:13,992 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:16:13,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 82 events. 23/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 378 event pairs, 10 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 159. Up to 58 conditions per place. [2022-12-13 01:16:13,992 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 6 selfloop transitions, 6 changer transitions 12/24 dead transitions. [2022-12-13 01:16:13,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 24 transitions, 96 flow [2022-12-13 01:16:13,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:16:13,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:16:13,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-13 01:16:13,994 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-13 01:16:13,994 INFO L175 Difference]: Start difference. First operand has 18 places, 15 transitions, 32 flow. Second operand 3 states and 27 transitions. [2022-12-13 01:16:13,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 24 transitions, 96 flow [2022-12-13 01:16:13,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 01:16:13,995 INFO L231 Difference]: Finished difference. Result has 21 places, 12 transitions, 46 flow [2022-12-13 01:16:13,995 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=21, PETRI_TRANSITIONS=12} [2022-12-13 01:16:13,996 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, -18 predicate places. [2022-12-13 01:16:13,996 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:16:13,996 INFO L89 Accepts]: Start accepts. Operand has 21 places, 12 transitions, 46 flow [2022-12-13 01:16:13,996 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:16:13,996 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:16:13,996 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 12 transitions, 46 flow [2022-12-13 01:16:13,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 18 places, 12 transitions, 46 flow [2022-12-13 01:16:13,998 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-13 01:16:13,999 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 01:16:13,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 16 events. 0/16 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 39 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 0. Up to 11 conditions per place. [2022-12-13 01:16:13,999 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 18 places, 12 transitions, 46 flow [2022-12-13 01:16:13,999 INFO L226 LiptonReduction]: Number of co-enabled transitions 4 [2022-12-13 01:16:14,008 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 [228] $Ultimate##0-->L686: Formula: (let ((.cse0 (select |v_#pthreadsMutex_279| |v_~#A~0.base_127|))) (and (= v_~g~0_254 2) (= |v_t_funThread1of1ForFork0_~arg#1.offset_41| |v_t_funThread1of1ForFork0_#in~arg#1.offset_33|) (= (store |v_#pthreadsMutex_279| |v_~#A~0.base_127| (store .cse0 |v_~#A~0.offset_127| 1)) |v_#pthreadsMutex_278|) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_33| |v_t_funThread1of1ForFork0_~arg#1.base_41|) (= (select .cse0 |v_~#A~0.offset_127|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_279|, ~#A~0.offset=|v_~#A~0.offset_127|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_33|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_33|, ~#A~0.base=|v_~#A~0.base_127|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_278|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_59|, ~#A~0.offset=|v_~#A~0.offset_127|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_33|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_41|, ~g~0=v_~g~0_254, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_41|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_33|, ~#A~0.base=|v_~#A~0.base_127|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_~arg#1.offset, ~g~0, t_funThread1of1ForFork0_~arg#1.base] [2022-12-13 01:16:14,031 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 [229] $Ultimate##0-->L19-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_283| |v_~#A~0.base_129|)) (.cse1 (= v_~g~0_256 2))) (and (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_167| |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_145|) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_35| |v_t_funThread1of1ForFork0_~arg#1.base_43|) (= |v_t_funThread1of1ForFork0_~arg#1.offset_43| |v_t_funThread1of1ForFork0_#in~arg#1.offset_35|) (= (store |v_#pthreadsMutex_283| |v_~#A~0.base_129| (store .cse0 |v_~#A~0.offset_129| 1)) |v_#pthreadsMutex_282|) .cse1 (= (select .cse0 |v_~#A~0.offset_129|) 0) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_145| (ite .cse1 1 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_283|, ~#A~0.offset=|v_~#A~0.offset_129|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_35|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_35|, ~#A~0.base=|v_~#A~0.base_129|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_145|, #pthreadsMutex=|v_#pthreadsMutex_282|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_61|, ~#A~0.offset=|v_~#A~0.offset_129|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_35|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_43|, ~g~0=v_~g~0_256, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_43|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_35|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_167|, ~#A~0.base=|v_~#A~0.base_129|} 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-13 01:16:14,067 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 [230] $Ultimate##0-->L686-1: Formula: (let ((.cse0 (= v_~g~0_258 2)) (.cse1 (select |v_#pthreadsMutex_287| |v_~#A~0.base_131|))) (and (= |v_t_funThread1of1ForFork0_~arg#1.offset_45| |v_t_funThread1of1ForFork0_#in~arg#1.offset_37|) .cse0 (= (select .cse1 |v_~#A~0.offset_131|) 0) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_37| |v_t_funThread1of1ForFork0_~arg#1.base_45|) (= (ite .cse0 1 0) |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_147|) (= (store |v_#pthreadsMutex_287| |v_~#A~0.base_131| (store .cse1 |v_~#A~0.offset_131| 1)) |v_#pthreadsMutex_286|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_287|, ~#A~0.offset=|v_~#A~0.offset_131|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_37|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_37|, ~#A~0.base=|v_~#A~0.base_131|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_147|, #pthreadsMutex=|v_#pthreadsMutex_286|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_63|, ~#A~0.offset=|v_~#A~0.offset_131|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_37|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_45|, ~g~0=v_~g~0_258, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_45|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_37|, ~#A~0.base=|v_~#A~0.base_131|} 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] [2022-12-13 01:16:14,098 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 [231] $Ultimate##0-->L19-5: Formula: (let ((.cse0 (select |v_#pthreadsMutex_291| |v_~#A~0.base_133|))) (and (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_149| (ite (= v_~g~0_260 2) 1 0)) (= (store |v_#pthreadsMutex_291| |v_~#A~0.base_133| (store .cse0 |v_~#A~0.offset_133| 1)) |v_#pthreadsMutex_290|) (not (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_169| 0)) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_39| |v_t_funThread1of1ForFork0_~arg#1.base_47|) (= (select .cse0 |v_~#A~0.offset_133|) 0) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_169| |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_149|) (= |v_t_funThread1of1ForFork0_~arg#1.offset_47| |v_t_funThread1of1ForFork0_#in~arg#1.offset_39|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_291|, ~#A~0.offset=|v_~#A~0.offset_133|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_39|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_39|, ~#A~0.base=|v_~#A~0.base_133|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_149|, #pthreadsMutex=|v_#pthreadsMutex_290|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_65|, ~#A~0.offset=|v_~#A~0.offset_133|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_39|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_47|, ~g~0=v_~g~0_260, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_47|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_39|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_169|, ~#A~0.base=|v_~#A~0.base_133|} 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-13 01:16:14,137 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 [232] $Ultimate##0-->L19: Formula: (let ((.cse0 (= v_~g~0_262 2)) (.cse1 (select |v_#pthreadsMutex_295| |v_~#A~0.base_135|))) (and .cse0 (= |v_t_funThread1of1ForFork0_#in~arg#1.base_41| |v_t_funThread1of1ForFork0_~arg#1.base_49|) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_151| (ite .cse0 1 0)) (= |v_t_funThread1of1ForFork0_~arg#1.offset_49| |v_t_funThread1of1ForFork0_#in~arg#1.offset_41|) (= (select .cse1 |v_~#A~0.offset_135|) 0) (= |v_#pthreadsMutex_294| (store |v_#pthreadsMutex_295| |v_~#A~0.base_135| (store .cse1 |v_~#A~0.offset_135| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_295|, ~#A~0.offset=|v_~#A~0.offset_135|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_41|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_41|, ~#A~0.base=|v_~#A~0.base_135|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_151|, #pthreadsMutex=|v_#pthreadsMutex_294|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_67|, ~#A~0.offset=|v_~#A~0.offset_135|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_41|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_49|, ~g~0=v_~g~0_262, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_49|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_41|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_171|, ~#A~0.base=|v_~#A~0.base_135|} 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-13 01:16:14,429 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [242] L693-3-->L19-5: Formula: false InVars {} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_171|, #pthreadsMutex=|v_#pthreadsMutex_412|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_126|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_105|, ~g~0=v_~g~0_317, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_87|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_67|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_175|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_59|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_87|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_201|} 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 [215] L696-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~g~0_84 |v_ULTIMATE.start_main_~y~0#1_43|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_51|) (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_51| 0) (= (ite (= |v_ULTIMATE.start_main_~x~0#1_53| |v_ULTIMATE.start_main_~y~0#1_43|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_53|, ~g~0=v_~g~0_84} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_53|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27|, ULTIMATE.start_main_~y~0#1=|v_ULTIMATE.start_main_~y~0#1_43|, ~g~0=v_~g~0_84, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_51|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start_main_~y~0#1, ULTIMATE.start___VERIFIER_assert_~cond#1] [2022-12-13 01:16:14,432 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [243] L693-3-->L19: Formula: false InVars {} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_173|, #pthreadsMutex=|v_#pthreadsMutex_418|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_130|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_107|, ~g~0=v_~g~0_321, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_89|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_69|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_177|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_61|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_89|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_203|} 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 [215] L696-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~g~0_84 |v_ULTIMATE.start_main_~y~0#1_43|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_51|) (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_51| 0) (= (ite (= |v_ULTIMATE.start_main_~x~0#1_53| |v_ULTIMATE.start_main_~y~0#1_43|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_53|, ~g~0=v_~g~0_84} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_53|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27|, ULTIMATE.start_main_~y~0#1=|v_ULTIMATE.start_main_~y~0#1_43|, ~g~0=v_~g~0_84, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_51|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start_main_~y~0#1, ULTIMATE.start___VERIFIER_assert_~cond#1] [2022-12-13 01:16:14,434 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [244] L693-3-->L19-1: Formula: false InVars {} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_175|, #pthreadsMutex=|v_#pthreadsMutex_424|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_134|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_109|, ~g~0=v_~g~0_325, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_91|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_71|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_179|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_63|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_91|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_205|} 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 [215] L696-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~g~0_84 |v_ULTIMATE.start_main_~y~0#1_43|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_51|) (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_51| 0) (= (ite (= |v_ULTIMATE.start_main_~x~0#1_53| |v_ULTIMATE.start_main_~y~0#1_43|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_53|, ~g~0=v_~g~0_84} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_53|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27|, ULTIMATE.start_main_~y~0#1=|v_ULTIMATE.start_main_~y~0#1_43|, ~g~0=v_~g~0_84, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_51|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start_main_~y~0#1, ULTIMATE.start___VERIFIER_assert_~cond#1] [2022-12-13 01:16:14,436 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [245] L693-3-->t_funEXIT: Formula: false InVars {} OutVars{t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_19|, ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_177|, #pthreadsMutex=|v_#pthreadsMutex_430|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_138|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_111|, ~g~0=v_~g~0_329, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_93|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_73|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_181|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_65|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_93|, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_19|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_207|} 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 [215] L696-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~g~0_84 |v_ULTIMATE.start_main_~y~0#1_43|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_51|) (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_51| 0) (= (ite (= |v_ULTIMATE.start_main_~x~0#1_53| |v_ULTIMATE.start_main_~y~0#1_43|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_53|, ~g~0=v_~g~0_84} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_53|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27|, ULTIMATE.start_main_~y~0#1=|v_ULTIMATE.start_main_~y~0#1_43|, ~g~0=v_~g~0_84, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_51|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start_main_~y~0#1, ULTIMATE.start___VERIFIER_assert_~cond#1] [2022-12-13 01:16:14,438 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [246] L693-3-->t_funFINAL: Formula: false InVars {} OutVars{t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_21|, ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_179|, #pthreadsMutex=|v_#pthreadsMutex_436|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_142|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_113|, ~g~0=v_~g~0_333, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_95|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_75|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_183|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_67|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_95|, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_21|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_209|} 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 [215] L696-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~g~0_84 |v_ULTIMATE.start_main_~y~0#1_43|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_51|) (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_51| 0) (= (ite (= |v_ULTIMATE.start_main_~x~0#1_53| |v_ULTIMATE.start_main_~y~0#1_43|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_53|, ~g~0=v_~g~0_84} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_53|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27|, ULTIMATE.start_main_~y~0#1=|v_ULTIMATE.start_main_~y~0#1_43|, ~g~0=v_~g~0_84, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_51|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start_main_~y~0#1, ULTIMATE.start___VERIFIER_assert_~cond#1] [2022-12-13 01:16:14,441 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [248] L693-3-->L686: Formula: false InVars {} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_183|, #pthreadsMutex=|v_#pthreadsMutex_446|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_150|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_115|, ~g~0=v_~g~0_339, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_97|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_79|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_71|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_97|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, #pthreadsMutex, ULTIMATE.start_main_#t~nondet4#1, t_funThread1of1ForFork0_#t~nondet1#1, ULTIMATE.start_main_#t~nondet3#1, t_funThread1of1ForFork0_~arg#1.offset, ~g~0, t_funThread1of1ForFork0_~arg#1.base, ULTIMATE.start_main_#t~pre2#1] and [215] L696-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~g~0_84 |v_ULTIMATE.start_main_~y~0#1_43|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_51|) (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_51| 0) (= (ite (= |v_ULTIMATE.start_main_~x~0#1_53| |v_ULTIMATE.start_main_~y~0#1_43|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_53|, ~g~0=v_~g~0_84} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_53|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27|, ULTIMATE.start_main_~y~0#1=|v_ULTIMATE.start_main_~y~0#1_43|, ~g~0=v_~g~0_84, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_51|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start_main_~y~0#1, ULTIMATE.start___VERIFIER_assert_~cond#1] [2022-12-13 01:16:14,444 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L693-3-->L686-1: Formula: false InVars {} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_185|, #pthreadsMutex=|v_#pthreadsMutex_452|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_154|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_117|, ~g~0=v_~g~0_343, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_99|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_81|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_185|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_73|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_99|} 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, ULTIMATE.start_main_#t~pre2#1] and [215] L696-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~g~0_84 |v_ULTIMATE.start_main_~y~0#1_43|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_51|) (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_51| 0) (= (ite (= |v_ULTIMATE.start_main_~x~0#1_53| |v_ULTIMATE.start_main_~y~0#1_43|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_53|, ~g~0=v_~g~0_84} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_53|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27|, ULTIMATE.start_main_~y~0#1=|v_ULTIMATE.start_main_~y~0#1_43|, ~g~0=v_~g~0_84, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_51|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start_main_~y~0#1, ULTIMATE.start___VERIFIER_assert_~cond#1] [2022-12-13 01:16:14,447 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 01:16:14,448 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 452 [2022-12-13 01:16:14,448 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 11 transitions, 71 flow [2022-12-13 01:16:14,449 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-13 01:16:14,449 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:16:14,449 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 01:16:14,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 01:16:14,449 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-13 01:16:14,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:16:14,450 INFO L85 PathProgramCache]: Analyzing trace with hash 243109, now seen corresponding path program 1 times [2022-12-13 01:16:14,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:16:14,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97410279] [2022-12-13 01:16:14,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:16:14,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:16:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:16:14,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:16:14,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:16:14,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97410279] [2022-12-13 01:16:14,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97410279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:16:14,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:16:14,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 01:16:14,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923199880] [2022-12-13 01:16:14,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:16:14,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 01:16:14,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:16:14,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 01:16:14,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 01:16:14,482 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 11 [2022-12-13 01:16:14,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 11 transitions, 71 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-13 01:16:14,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:16:14,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 11 [2022-12-13 01:16:14,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:16:14,495 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 01:16:14,495 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 01:16:14,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13 conditions, 3 events. 0/3 cut-off events. For 2/2 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 4 conditions per place. [2022-12-13 01:16:14,495 INFO L137 encePairwiseOnDemand]: 4/11 looper letters, 0 selfloop transitions, 0 changer transitions 3/3 dead transitions. [2022-12-13 01:16:14,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 10 places, 3 transitions, 17 flow [2022-12-13 01:16:14,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 01:16:14,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 01:16:14,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 10 transitions. [2022-12-13 01:16:14,496 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2022-12-13 01:16:14,496 INFO L175 Difference]: Start difference. First operand has 17 places, 11 transitions, 71 flow. Second operand 2 states and 10 transitions. [2022-12-13 01:16:14,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 10 places, 3 transitions, 17 flow [2022-12-13 01:16:14,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 8 places, 3 transitions, 15 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 01:16:14,497 INFO L231 Difference]: Finished difference. Result has 8 places, 0 transitions, 0 flow [2022-12-13 01:16:14,497 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=11, PETRI_DIFFERENCE_MINUEND_FLOW=9, PETRI_DIFFERENCE_MINUEND_PLACES=7, 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=2, PETRI_FLOW=0, PETRI_PLACES=8, PETRI_TRANSITIONS=0} [2022-12-13 01:16:14,497 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, -31 predicate places. [2022-12-13 01:16:14,497 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:16:14,497 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 8 places, 0 transitions, 0 flow [2022-12-13 01:16:14,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 01:16:14,498 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 01:16:14,498 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:16:14,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 01:16:14,498 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 01:16:14,498 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 01:16:14,498 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:16:14,499 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 01:16:14,499 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 01:16:14,499 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-13 01:16:14,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 01:16:14,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 01:16:14,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-12-13 01:16:14,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-12-13 01:16:14,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 01:16:14,502 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-12-13 01:16:14,505 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 01:16:14,505 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 01:16:14,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:16:14 BasicIcfg [2022-12-13 01:16:14,507 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 01:16:14,508 INFO L158 Benchmark]: Toolchain (without parser) took 3805.24ms. Allocated memory was 188.7MB in the beginning and 243.3MB in the end (delta: 54.5MB). Free memory was 164.5MB in the beginning and 104.7MB in the end (delta: 59.8MB). Peak memory consumption was 115.1MB. Max. memory is 8.0GB. [2022-12-13 01:16:14,508 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 188.7MB. Free memory is still 165.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 01:16:14,508 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.34ms. Allocated memory is still 188.7MB. Free memory was 164.5MB in the beginning and 145.9MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-13 01:16:14,508 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.83ms. Allocated memory is still 188.7MB. Free memory was 145.9MB in the beginning and 143.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 01:16:14,509 INFO L158 Benchmark]: Boogie Preprocessor took 28.61ms. Allocated memory is still 188.7MB. Free memory was 143.8MB in the beginning and 142.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 01:16:14,509 INFO L158 Benchmark]: RCFGBuilder took 312.81ms. Allocated memory is still 188.7MB. Free memory was 142.2MB in the beginning and 130.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 01:16:14,509 INFO L158 Benchmark]: TraceAbstraction took 2989.30ms. Allocated memory was 188.7MB in the beginning and 243.3MB in the end (delta: 54.5MB). Free memory was 129.1MB in the beginning and 104.7MB in the end (delta: 24.4MB). Peak memory consumption was 79.4MB. Max. memory is 8.0GB. [2022-12-13 01:16:14,511 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.15ms. Allocated memory is still 188.7MB. Free memory is still 165.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 420.34ms. Allocated memory is still 188.7MB. Free memory was 164.5MB in the beginning and 145.9MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.83ms. Allocated memory is still 188.7MB. Free memory was 145.9MB in the beginning and 143.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.61ms. Allocated memory is still 188.7MB. Free memory was 143.8MB in the beginning and 142.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 312.81ms. Allocated memory is still 188.7MB. Free memory was 142.2MB in the beginning and 130.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 2989.30ms. Allocated memory was 188.7MB in the beginning and 243.3MB in the end (delta: 54.5MB). Free memory was 129.1MB in the beginning and 104.7MB in the end (delta: 24.4MB). Peak memory consumption was 79.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 61 PlacesBefore, 39 PlacesAfterwards, 59 TransitionsBefore, 37 TransitionsAfterwards, 600 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 22 TrivialYvCompositions, 22 ConcurrentYvCompositions, 2 ChoiceCompositions, 52 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1340, independent: 1236, independent conditional: 1236, independent unconditional: 0, dependent: 104, dependent conditional: 104, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1340, independent: 1236, independent conditional: 0, independent unconditional: 1236, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1340, independent: 1236, independent conditional: 0, independent unconditional: 1236, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1340, independent: 1236, independent conditional: 0, independent unconditional: 1236, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 731, independent: 703, independent conditional: 0, independent unconditional: 703, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 731, independent: 647, independent conditional: 0, independent unconditional: 647, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 84, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 91, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1340, independent: 533, independent conditional: 0, independent unconditional: 533, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 731, unknown conditional: 0, unknown unconditional: 731] , Statistics on independence cache: Total cache size (in pairs): 1688, Positive cache size: 1660, Positive conditional cache size: 0, Positive unconditional cache size: 1660, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 20 PlacesBefore, 18 PlacesAfterwards, 17 TransitionsBefore, 15 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 91, independent: 71, independent conditional: 71, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 91, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 91, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 91, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 47, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 47, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 91, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 47, unknown conditional: 0, unknown unconditional: 47] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, 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.4s, 18 PlacesBefore, 17 PlacesAfterwards, 12 TransitionsBefore, 11 TransitionsAfterwards, 4 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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: 2, independent conditional: 0, independent unconditional: 2, 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: 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): 57, Positive cache size: 44, Positive conditional cache size: 0, Positive unconditional cache size: 44, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, 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): 57, Positive cache size: 44, Positive conditional cache size: 0, Positive unconditional cache size: 44, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, 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.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 68 IncrementalHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 68 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=77occurred 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-13 01:16:14,539 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...