/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/weaver/chl-match-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 01:27:35,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 01:27:35,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 01:27:35,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 01:27:35,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 01:27:35,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 01:27:35,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 01:27:35,163 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 01:27:35,164 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 01:27:35,164 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 01:27:35,165 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 01:27:35,166 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 01:27:35,166 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 01:27:35,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 01:27:35,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 01:27:35,168 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 01:27:35,168 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 01:27:35,169 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 01:27:35,170 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 01:27:35,170 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 01:27:35,171 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 01:27:35,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 01:27:35,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 01:27:35,173 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 01:27:35,175 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 01:27:35,176 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 01:27:35,176 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 01:27:35,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 01:27:35,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 01:27:35,177 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 01:27:35,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 01:27:35,177 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 01:27:35,178 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 01:27:35,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 01:27:35,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 01:27:35,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 01:27:35,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 01:27:35,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 01:27:35,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 01:27:35,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 01:27:35,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 01:27:35,186 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:27:35,204 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 01:27:35,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 01:27:35,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 01:27:35,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 01:27:35,206 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 01:27:35,207 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 01:27:35,207 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 01:27:35,207 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 01:27:35,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 01:27:35,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 01:27:35,208 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 01:27:35,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 01:27:35,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 01:27:35,208 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 01:27:35,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 01:27:35,208 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 01:27:35,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 01:27:35,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 01:27:35,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 01:27:35,209 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 01:27:35,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 01:27:35,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:27:35,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 01:27:35,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 01:27:35,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 01:27:35,209 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 01:27:35,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 01:27:35,209 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 01:27:35,209 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:27:35,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 01:27:35,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 01:27:35,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 01:27:35,496 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 01:27:35,497 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 01:27:35,498 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-match-subst.wvr.c [2022-12-13 01:27:36,519 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 01:27:36,692 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 01:27:36,692 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-match-subst.wvr.c [2022-12-13 01:27:36,698 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d11abe31/459c9e59f8d84bddb53d323b43132dd5/FLAG58b8253e7 [2022-12-13 01:27:36,712 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d11abe31/459c9e59f8d84bddb53d323b43132dd5 [2022-12-13 01:27:36,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 01:27:36,715 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 01:27:36,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 01:27:36,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 01:27:36,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 01:27:36,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:27:36" (1/1) ... [2022-12-13 01:27:36,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42d05594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:36, skipping insertion in model container [2022-12-13 01:27:36,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:27:36" (1/1) ... [2022-12-13 01:27:36,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 01:27:36,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 01:27:36,879 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-match-subst.wvr.c[3017,3030] [2022-12-13 01:27:36,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:27:36,893 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 01:27:36,921 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-match-subst.wvr.c[3017,3030] [2022-12-13 01:27:36,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:27:36,938 INFO L208 MainTranslator]: Completed translation [2022-12-13 01:27:36,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:36 WrapperNode [2022-12-13 01:27:36,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 01:27:36,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 01:27:36,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 01:27:36,941 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 01:27:36,946 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:27:36" (1/1) ... [2022-12-13 01:27:36,961 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:27:36" (1/1) ... [2022-12-13 01:27:37,003 INFO L138 Inliner]: procedures = 23, calls = 34, calls flagged for inlining = 12, calls inlined = 22, statements flattened = 206 [2022-12-13 01:27:37,004 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 01:27:37,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 01:27:37,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 01:27:37,005 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 01:27:37,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:36" (1/1) ... [2022-12-13 01:27:37,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:36" (1/1) ... [2022-12-13 01:27:37,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:36" (1/1) ... [2022-12-13 01:27:37,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:36" (1/1) ... [2022-12-13 01:27:37,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:36" (1/1) ... [2022-12-13 01:27:37,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:36" (1/1) ... [2022-12-13 01:27:37,034 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:36" (1/1) ... [2022-12-13 01:27:37,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:36" (1/1) ... [2022-12-13 01:27:37,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 01:27:37,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 01:27:37,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 01:27:37,038 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 01:27:37,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:36" (1/1) ... [2022-12-13 01:27:37,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:27:37,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:27:37,071 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:27:37,078 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:27:37,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 01:27:37,101 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 01:27:37,102 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 01:27:37,103 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 01:27:37,103 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 01:27:37,103 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 01:27:37,103 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 01:27:37,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 01:27:37,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 01:27:37,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 01:27:37,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 01:27:37,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 01:27:37,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 01:27:37,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 01:27:37,105 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:27:37,225 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 01:27:37,226 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 01:27:37,497 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 01:27:37,504 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 01:27:37,504 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 01:27:37,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:27:37 BoogieIcfgContainer [2022-12-13 01:27:37,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 01:27:37,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 01:27:37,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 01:27:37,510 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 01:27:37,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:27:36" (1/3) ... [2022-12-13 01:27:37,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ac9660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:27:37, skipping insertion in model container [2022-12-13 01:27:37,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:36" (2/3) ... [2022-12-13 01:27:37,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ac9660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:27:37, skipping insertion in model container [2022-12-13 01:27:37,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:27:37" (3/3) ... [2022-12-13 01:27:37,512 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-match-subst.wvr.c [2022-12-13 01:27:37,528 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 01:27:37,528 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 01:27:37,529 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 01:27:37,634 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 01:27:37,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 246 transitions, 516 flow [2022-12-13 01:27:37,804 INFO L130 PetriNetUnfolder]: 14/243 cut-off events. [2022-12-13 01:27:37,805 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:27:37,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 243 events. 14/243 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 338 event pairs, 0 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 164. Up to 2 conditions per place. [2022-12-13 01:27:37,821 INFO L82 GeneralOperation]: Start removeDead. Operand has 242 places, 246 transitions, 516 flow [2022-12-13 01:27:37,825 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 233 transitions, 484 flow [2022-12-13 01:27:37,826 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:27:37,839 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 229 places, 233 transitions, 484 flow [2022-12-13 01:27:37,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 233 transitions, 484 flow [2022-12-13 01:27:37,893 INFO L130 PetriNetUnfolder]: 14/233 cut-off events. [2022-12-13 01:27:37,894 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:27:37,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 233 events. 14/233 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 336 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 164. Up to 2 conditions per place. [2022-12-13 01:27:37,908 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 229 places, 233 transitions, 484 flow [2022-12-13 01:27:37,908 INFO L226 LiptonReduction]: Number of co-enabled transitions 16638 [2022-12-13 01:27:45,216 INFO L241 LiptonReduction]: Total number of compositions: 217 [2022-12-13 01:27:45,231 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 01:27:45,235 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;@5cedcfa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 01:27:45,236 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 01:27:45,240 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-13 01:27:45,240 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:27:45,240 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:27:45,240 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:27:45,241 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:27:45,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:27:45,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1684255920, now seen corresponding path program 1 times [2022-12-13 01:27:45,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:27:45,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876819338] [2022-12-13 01:27:45,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:27:45,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:27:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:27:46,735 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:27:46,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:27:46,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876819338] [2022-12-13 01:27:46,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876819338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:27:46,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:27:46,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:27:46,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488281006] [2022-12-13 01:27:46,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:27:46,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:27:46,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:27:46,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:27:46,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:27:46,765 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 01:27:46,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 16 transitions, 50 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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:27:46,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:27:46,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 01:27:46,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:27:47,154 INFO L130 PetriNetUnfolder]: 38/100 cut-off events. [2022-12-13 01:27:47,154 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-13 01:27:47,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 100 events. 38/100 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 284 event pairs, 2 based on Foata normal form. 1/101 useless extension candidates. Maximal degree in co-relation 169. Up to 38 conditions per place. [2022-12-13 01:27:47,156 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 32 selfloop transitions, 6 changer transitions 7/45 dead transitions. [2022-12-13 01:27:47,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 45 transitions, 228 flow [2022-12-13 01:27:47,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:27:47,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:27:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-12-13 01:27:47,163 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2022-12-13 01:27:47,164 INFO L175 Difference]: Start difference. First operand has 26 places, 16 transitions, 50 flow. Second operand 6 states and 46 transitions. [2022-12-13 01:27:47,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 45 transitions, 228 flow [2022-12-13 01:27:47,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 45 transitions, 196 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 01:27:47,168 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 71 flow [2022-12-13 01:27:47,169 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=71, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2022-12-13 01:27:47,172 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2022-12-13 01:27:47,172 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:27:47,172 INFO L89 Accepts]: Start accepts. Operand has 28 places, 20 transitions, 71 flow [2022-12-13 01:27:47,175 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:27:47,175 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:27:47,175 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 20 transitions, 71 flow [2022-12-13 01:27:47,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 20 transitions, 71 flow [2022-12-13 01:27:47,180 INFO L130 PetriNetUnfolder]: 2/31 cut-off events. [2022-12-13 01:27:47,180 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 01:27:47,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 31 events. 2/31 cut-off events. For 4/4 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/30 useless extension candidates. Maximal degree in co-relation 48. Up to 6 conditions per place. [2022-12-13 01:27:47,183 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 20 transitions, 71 flow [2022-12-13 01:27:47,183 INFO L226 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-13 01:27:47,248 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [959] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_113| |v_thread3Thread1of1ForFork1_plus_~b#1_113|))) (and (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_45| v_~seq_1_start_7~0_59) (= |v_thread3Thread1of1ForFork1_#res#1.base_19| 0) (= v_~result_11~0_34 (ite (< v_~score_6~0_55 v_~score_3~0_67) (- 1) (ite (< v_~score_3~0_67 v_~score_6~0_55) 1 (ite (< |v_thread3Thread1of1ForFork1_~s1~2#1_33| |v_thread3Thread1of1ForFork1_~s2~2#1_27|) (- 1) (ite (< |v_thread3Thread1of1ForFork1_~s2~2#1_27| |v_thread3Thread1of1ForFork1_~s1~2#1_33|) 1 0))))) (<= 0 (+ |v_thread3Thread1of1ForFork1_~s2~2#1_27| 2147483648)) (<= |v_thread3Thread1of1ForFork1_~s1~2#1_33| 2147483647) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_45| |v_thread3Thread1of1ForFork1_plus_~a#1_113|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_113| 0)) 1 0)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_49| |v_thread3Thread1of1ForFork1_plus_~b#1_113|) (= |v_thread3Thread1of1ForFork1_~s2~2#1_27| |v_thread3Thread1of1ForFork1_plus_#res#1_81|) (= |v_thread3Thread1of1ForFork1_~s1~2#1_33| (+ v_~seq_2_start_5~0_43 v_~seq_1_start_4~0_47)) (= |v_thread3Thread1of1ForFork1_#res#1.offset_19| 0) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_49| v_~seq_2_start_8~0_55) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_81|) (<= 0 (+ |v_thread3Thread1of1ForFork1_~s1~2#1_33| 2147483648)) (<= |v_thread3Thread1of1ForFork1_~s2~2#1_27| 2147483647))) InVars {~seq_1_start_4~0=v_~seq_1_start_4~0_47, ~seq_1_start_7~0=v_~seq_1_start_7~0_59, ~seq_2_start_8~0=v_~seq_2_start_8~0_55, ~score_6~0=v_~score_6~0_55, ~seq_2_start_5~0=v_~seq_2_start_5~0_43, ~score_3~0=v_~score_3~0_67} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_81|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_45|, ~seq_2_start_5~0=v_~seq_2_start_5~0_43, thread3Thread1of1ForFork1_#t~ret6#1=|v_thread3Thread1of1ForFork1_#t~ret6#1_35|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_19|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_113|, ~seq_1_start_4~0=v_~seq_1_start_4~0_47, thread3Thread1of1ForFork1_~s1~2#1=|v_thread3Thread1of1ForFork1_~s1~2#1_33|, thread3Thread1of1ForFork1_~s2~2#1=|v_thread3Thread1of1ForFork1_~s2~2#1_27|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_49|, ~seq_1_start_7~0=v_~seq_1_start_7~0_59, ~seq_2_start_8~0=v_~seq_2_start_8~0_55, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_19|, ~score_6~0=v_~score_6~0_55, thread3Thread1of1ForFork1_#t~ret5#1=|v_thread3Thread1of1ForFork1_#t~ret5#1_33|, ~result_11~0=v_~result_11~0_34, ~score_3~0=v_~score_3~0_67, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_113|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret6#1, thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~s1~2#1, thread3Thread1of1ForFork1_~s2~2#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~ret5#1, ~result_11~0, thread3Thread1of1ForFork1_plus_~b#1] and [962] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_95| |v_thread1Thread1of1ForFork2_plus_~b#1_95|))) (and (= |v_thread1Thread1of1ForFork2_#res#1.base_19| 0) (<= |v_thread1Thread1of1ForFork2_~s2~0#1_23| 2147483647) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_119| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_97|) (= |v_thread1Thread1of1ForFork2_#res#1.offset_19| 0) (<= |v_thread1Thread1of1ForFork2_~s1~0#1_41| 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_~s2~0#1_23| 2147483648)) (= |v_thread1Thread1of1ForFork2_plus_~a#1_95| |v_thread1Thread1of1ForFork2_plus_#in~a#1_39|) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_69|) (= |v_thread1Thread1of1ForFork2_~s2~0#1_23| |v_thread1Thread1of1ForFork2_plus_#res#1_69|) (= |v_thread1Thread1of1ForFork2_plus_~b#1_95| |v_thread1Thread1of1ForFork2_plus_#in~b#1_47|) (= |v_thread1Thread1of1ForFork2_~s1~0#1_41| (+ v_~seq_2_start_2~0_61 v_~seq_1_start_1~0_63)) (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_95| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_97|) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_39| v_~seq_1_start_4~0_51) (= (ite (< v_~score_3~0_69 v_~score_0~0_59) (- 1) (ite (< v_~score_0~0_59 v_~score_3~0_69) 1 (ite (< |v_thread1Thread1of1ForFork2_~s1~0#1_41| |v_thread1Thread1of1ForFork2_~s2~0#1_23|) (- 1) (ite (< |v_thread1Thread1of1ForFork2_~s2~0#1_23| |v_thread1Thread1of1ForFork2_~s1~0#1_41|) 1 0)))) v_~result_9~0_38) (= v_~seq_2_start_5~0_47 |v_thread1Thread1of1ForFork2_plus_#in~b#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~s1~0#1_41| 2147483648)))) InVars {~seq_1_start_4~0=v_~seq_1_start_4~0_51, ~score_0~0=v_~score_0~0_59, ~seq_2_start_2~0=v_~seq_2_start_2~0_61, ~seq_1_start_1~0=v_~seq_1_start_1~0_63, ~seq_2_start_5~0=v_~seq_2_start_5~0_47, ~score_3~0=v_~score_3~0_69} OutVars{thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_47|, thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_41|, ~seq_2_start_2~0=v_~seq_2_start_2~0_61, thread1Thread1of1ForFork2_~s2~0#1=|v_thread1Thread1of1ForFork2_~s2~0#1_23|, ~seq_2_start_5~0=v_~seq_2_start_5~0_47, ~result_9~0=v_~result_9~0_38, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_95|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_39|, thread1Thread1of1ForFork2_~s1~0#1=|v_thread1Thread1of1ForFork2_~s1~0#1_41|, ~seq_1_start_4~0=v_~seq_1_start_4~0_51, ~score_0~0=v_~score_0~0_59, ~seq_1_start_1~0=v_~seq_1_start_1~0_63, thread1Thread1of1ForFork2_#t~ret2#1=|v_thread1Thread1of1ForFork2_#t~ret2#1_31|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_97|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_19|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_95|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_19|, ~score_3~0=v_~score_3~0_69, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_69|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_119|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_~s2~0#1, ~result_9~0, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_~s1~0#1, thread1Thread1of1ForFork2_#t~ret2#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_plus_#res#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-13 01:27:47,762 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:27:47,763 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 591 [2022-12-13 01:27:47,763 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 78 flow [2022-12-13 01:27:47,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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:27:47,763 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:27:47,764 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:27:47,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 01:27:47,764 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:27:47,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:27:47,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1325650054, now seen corresponding path program 2 times [2022-12-13 01:27:47,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:27:47,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280090871] [2022-12-13 01:27:47,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:27:47,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:27:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:27:48,479 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:27:48,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:27:48,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280090871] [2022-12-13 01:27:48,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280090871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:27:48,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:27:48,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:27:48,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515775520] [2022-12-13 01:27:48,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:27:48,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:27:48,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:27:48,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:27:48,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:27:48,489 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 01:27:48,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 78 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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:27:48,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:27:48,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 01:27:48,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:27:48,686 INFO L130 PetriNetUnfolder]: 39/119 cut-off events. [2022-12-13 01:27:48,686 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-12-13 01:27:48,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 119 events. 39/119 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 437 event pairs, 6 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 319. Up to 60 conditions per place. [2022-12-13 01:27:48,687 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 29 selfloop transitions, 8 changer transitions 10/47 dead transitions. [2022-12-13 01:27:48,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 47 transitions, 244 flow [2022-12-13 01:27:48,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:27:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:27:48,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-12-13 01:27:48,688 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46078431372549017 [2022-12-13 01:27:48,688 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 78 flow. Second operand 6 states and 47 transitions. [2022-12-13 01:27:48,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 47 transitions, 244 flow [2022-12-13 01:27:48,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 47 transitions, 240 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 01:27:48,690 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 110 flow [2022-12-13 01:27:48,690 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=110, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2022-12-13 01:27:48,690 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2022-12-13 01:27:48,690 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:27:48,691 INFO L89 Accepts]: Start accepts. Operand has 35 places, 22 transitions, 110 flow [2022-12-13 01:27:48,691 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:27:48,691 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:27:48,691 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 110 flow [2022-12-13 01:27:48,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 22 transitions, 110 flow [2022-12-13 01:27:48,696 INFO L130 PetriNetUnfolder]: 1/42 cut-off events. [2022-12-13 01:27:48,696 INFO L131 PetriNetUnfolder]: For 44/49 co-relation queries the response was YES. [2022-12-13 01:27:48,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 42 events. 1/42 cut-off events. For 44/49 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 113 event pairs, 0 based on Foata normal form. 1/39 useless extension candidates. Maximal degree in co-relation 79. Up to 7 conditions per place. [2022-12-13 01:27:48,697 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 22 transitions, 110 flow [2022-12-13 01:27:48,697 INFO L226 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-13 01:27:48,749 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [962] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_95| |v_thread1Thread1of1ForFork2_plus_~b#1_95|))) (and (= |v_thread1Thread1of1ForFork2_#res#1.base_19| 0) (<= |v_thread1Thread1of1ForFork2_~s2~0#1_23| 2147483647) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_119| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_97|) (= |v_thread1Thread1of1ForFork2_#res#1.offset_19| 0) (<= |v_thread1Thread1of1ForFork2_~s1~0#1_41| 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_~s2~0#1_23| 2147483648)) (= |v_thread1Thread1of1ForFork2_plus_~a#1_95| |v_thread1Thread1of1ForFork2_plus_#in~a#1_39|) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_69|) (= |v_thread1Thread1of1ForFork2_~s2~0#1_23| |v_thread1Thread1of1ForFork2_plus_#res#1_69|) (= |v_thread1Thread1of1ForFork2_plus_~b#1_95| |v_thread1Thread1of1ForFork2_plus_#in~b#1_47|) (= |v_thread1Thread1of1ForFork2_~s1~0#1_41| (+ v_~seq_2_start_2~0_61 v_~seq_1_start_1~0_63)) (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_95| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_97|) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_39| v_~seq_1_start_4~0_51) (= (ite (< v_~score_3~0_69 v_~score_0~0_59) (- 1) (ite (< v_~score_0~0_59 v_~score_3~0_69) 1 (ite (< |v_thread1Thread1of1ForFork2_~s1~0#1_41| |v_thread1Thread1of1ForFork2_~s2~0#1_23|) (- 1) (ite (< |v_thread1Thread1of1ForFork2_~s2~0#1_23| |v_thread1Thread1of1ForFork2_~s1~0#1_41|) 1 0)))) v_~result_9~0_38) (= v_~seq_2_start_5~0_47 |v_thread1Thread1of1ForFork2_plus_#in~b#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~s1~0#1_41| 2147483648)))) InVars {~seq_1_start_4~0=v_~seq_1_start_4~0_51, ~score_0~0=v_~score_0~0_59, ~seq_2_start_2~0=v_~seq_2_start_2~0_61, ~seq_1_start_1~0=v_~seq_1_start_1~0_63, ~seq_2_start_5~0=v_~seq_2_start_5~0_47, ~score_3~0=v_~score_3~0_69} OutVars{thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_47|, thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_41|, ~seq_2_start_2~0=v_~seq_2_start_2~0_61, thread1Thread1of1ForFork2_~s2~0#1=|v_thread1Thread1of1ForFork2_~s2~0#1_23|, ~seq_2_start_5~0=v_~seq_2_start_5~0_47, ~result_9~0=v_~result_9~0_38, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_95|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_39|, thread1Thread1of1ForFork2_~s1~0#1=|v_thread1Thread1of1ForFork2_~s1~0#1_41|, ~seq_1_start_4~0=v_~seq_1_start_4~0_51, ~score_0~0=v_~score_0~0_59, ~seq_1_start_1~0=v_~seq_1_start_1~0_63, thread1Thread1of1ForFork2_#t~ret2#1=|v_thread1Thread1of1ForFork2_#t~ret2#1_31|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_97|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_19|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_95|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_19|, ~score_3~0=v_~score_3~0_69, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_69|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_119|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_~s2~0#1, ~result_9~0, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_~s1~0#1, thread1Thread1of1ForFork2_#t~ret2#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_plus_#res#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [963] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_97| |v_thread2Thread1of1ForFork0_plus_~b#1_99|))) (and (= |v_thread2Thread1of1ForFork0_~s1~1#1_33| (+ v_~seq_2_start_2~0_63 v_~seq_1_start_1~0_65)) (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_99| 0) (<= .cse0 2147483647)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_87|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_123| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_87|) (<= |v_thread2Thread1of1ForFork0_~s1~1#1_33| 2147483647) (= |v_thread2Thread1of1ForFork0_plus_#res#1_73| |v_thread2Thread1of1ForFork0_~s2~1#1_25|) (= |v_thread2Thread1of1ForFork0_#res#1.base_21| 0) (<= 0 (+ |v_thread2Thread1of1ForFork0_~s2~1#1_25| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#res#1_73| .cse0) (<= 0 (+ |v_thread2Thread1of1ForFork0_~s1~1#1_33| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_~a#1_97| |v_thread2Thread1of1ForFork0_plus_#in~a#1_45|) (= |v_thread2Thread1of1ForFork0_plus_~b#1_99| |v_thread2Thread1of1ForFork0_plus_#in~b#1_47|) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_45| v_~seq_1_start_7~0_63) (= v_~result_10~0_36 (ite (< v_~score_6~0_57 v_~score_0~0_61) (- 1) (ite (< v_~score_0~0_61 v_~score_6~0_57) 1 (ite (< |v_thread2Thread1of1ForFork0_~s1~1#1_33| |v_thread2Thread1of1ForFork0_~s2~1#1_25|) (- 1) (ite (< |v_thread2Thread1of1ForFork0_~s2~1#1_25| |v_thread2Thread1of1ForFork0_~s1~1#1_33|) 1 0))))) (= |v_thread2Thread1of1ForFork0_#res#1.offset_21| 0) (<= |v_thread2Thread1of1ForFork0_~s2~1#1_25| 2147483647) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_47| v_~seq_2_start_8~0_59))) InVars {~score_0~0=v_~score_0~0_61, ~seq_2_start_2~0=v_~seq_2_start_2~0_63, ~seq_1_start_1~0=v_~seq_1_start_1~0_65, ~seq_1_start_7~0=v_~seq_1_start_7~0_63, ~seq_2_start_8~0=v_~seq_2_start_8~0_59, ~score_6~0=v_~score_6~0_57} OutVars{thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_45|, ~seq_2_start_2~0=v_~seq_2_start_2~0_63, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_21|, thread2Thread1of1ForFork0_~s1~1#1=|v_thread2Thread1of1ForFork0_~s1~1#1_33|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_97|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_87|, thread2Thread1of1ForFork0_#t~ret3#1=|v_thread2Thread1of1ForFork0_#t~ret3#1_39|, thread2Thread1of1ForFork0_~s2~1#1=|v_thread2Thread1of1ForFork0_~s2~1#1_25|, thread2Thread1of1ForFork0_#t~ret4#1=|v_thread2Thread1of1ForFork0_#t~ret4#1_37|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_123|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_47|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_21|, ~score_0~0=v_~score_0~0_61, ~seq_1_start_1~0=v_~seq_1_start_1~0_65, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_73|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_99|, ~seq_1_start_7~0=v_~seq_1_start_7~0_63, ~seq_2_start_8~0=v_~seq_2_start_8~0_59, ~score_6~0=v_~score_6~0_57, ~result_10~0=v_~result_10~0_36} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~s1~1#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork0_~s2~1#1, thread2Thread1of1ForFork0_#t~ret4#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~b#1, ~result_10~0] [2022-12-13 01:27:49,251 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:27:49,252 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 562 [2022-12-13 01:27:49,253 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 117 flow [2022-12-13 01:27:49,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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:27:49,253 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:27:49,253 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:27:49,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 01:27:49,253 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:27:49,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:27:49,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1396836984, now seen corresponding path program 1 times [2022-12-13 01:27:49,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:27:49,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768640968] [2022-12-13 01:27:49,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:27:49,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:27:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:27:49,809 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:27:49,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:27:49,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768640968] [2022-12-13 01:27:49,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768640968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:27:49,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:27:49,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:27:49,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526937561] [2022-12-13 01:27:49,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:27:49,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:27:49,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:27:49,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:27:49,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:27:49,814 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 01:27:49,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 117 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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:27:49,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:27:49,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 01:27:49,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:27:49,945 INFO L130 PetriNetUnfolder]: 31/99 cut-off events. [2022-12-13 01:27:49,945 INFO L131 PetriNetUnfolder]: For 161/161 co-relation queries the response was YES. [2022-12-13 01:27:49,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 99 events. 31/99 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 326 event pairs, 6 based on Foata normal form. 1/100 useless extension candidates. Maximal degree in co-relation 324. Up to 61 conditions per place. [2022-12-13 01:27:49,948 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 25 selfloop transitions, 4 changer transitions 9/38 dead transitions. [2022-12-13 01:27:49,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 223 flow [2022-12-13 01:27:49,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:27:49,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:27:49,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-12-13 01:27:49,951 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-13 01:27:49,951 INFO L175 Difference]: Start difference. First operand has 35 places, 22 transitions, 117 flow. Second operand 5 states and 38 transitions. [2022-12-13 01:27:49,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 223 flow [2022-12-13 01:27:49,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 210 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 01:27:49,953 INFO L231 Difference]: Finished difference. Result has 37 places, 18 transitions, 78 flow [2022-12-13 01:27:49,953 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=37, PETRI_TRANSITIONS=18} [2022-12-13 01:27:49,954 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2022-12-13 01:27:49,954 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:27:49,955 INFO L89 Accepts]: Start accepts. Operand has 37 places, 18 transitions, 78 flow [2022-12-13 01:27:49,957 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:27:49,957 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:27:49,957 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 18 transitions, 78 flow [2022-12-13 01:27:49,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 18 transitions, 78 flow [2022-12-13 01:27:49,962 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-13 01:27:49,962 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-13 01:27:49,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 29 events. 0/29 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 49 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-12-13 01:27:49,962 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 18 transitions, 78 flow [2022-12-13 01:27:49,962 INFO L226 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-13 01:27:49,963 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:27:49,963 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 01:27:49,964 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 18 transitions, 78 flow [2022-12-13 01:27:49,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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:27:49,964 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:27:49,964 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:27:49,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 01:27:49,964 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:27:49,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:27:49,965 INFO L85 PathProgramCache]: Analyzing trace with hash 531471142, now seen corresponding path program 3 times [2022-12-13 01:27:49,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:27:49,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990284889] [2022-12-13 01:27:49,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:27:49,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:27:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:27:50,470 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:27:50,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:27:50,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990284889] [2022-12-13 01:27:50,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990284889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:27:50,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:27:50,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:27:50,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334227303] [2022-12-13 01:27:50,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:27:50,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:27:50,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:27:50,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:27:50,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:27:50,473 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 01:27:50,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 18 transitions, 78 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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:27:50,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:27:50,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 01:27:50,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:27:50,625 INFO L130 PetriNetUnfolder]: 28/84 cut-off events. [2022-12-13 01:27:50,625 INFO L131 PetriNetUnfolder]: For 104/104 co-relation queries the response was YES. [2022-12-13 01:27:50,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 84 events. 28/84 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 244 event pairs, 2 based on Foata normal form. 1/85 useless extension candidates. Maximal degree in co-relation 278. Up to 37 conditions per place. [2022-12-13 01:27:50,626 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 23 selfloop transitions, 4 changer transitions 12/39 dead transitions. [2022-12-13 01:27:50,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 216 flow [2022-12-13 01:27:50,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:27:50,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:27:50,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-12-13 01:27:50,627 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-13 01:27:50,627 INFO L175 Difference]: Start difference. First operand has 34 places, 18 transitions, 78 flow. Second operand 6 states and 40 transitions. [2022-12-13 01:27:50,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 216 flow [2022-12-13 01:27:50,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 200 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-13 01:27:50,628 INFO L231 Difference]: Finished difference. Result has 35 places, 16 transitions, 63 flow [2022-12-13 01:27:50,628 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=63, PETRI_PLACES=35, PETRI_TRANSITIONS=16} [2022-12-13 01:27:50,628 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2022-12-13 01:27:50,629 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:27:50,629 INFO L89 Accepts]: Start accepts. Operand has 35 places, 16 transitions, 63 flow [2022-12-13 01:27:50,629 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:27:50,629 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:27:50,629 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 16 transitions, 63 flow [2022-12-13 01:27:50,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 16 transitions, 63 flow [2022-12-13 01:27:50,632 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-13 01:27:50,632 INFO L131 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2022-12-13 01:27:50,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 16 events. 0/16 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 5 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 01:27:50,632 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 16 transitions, 63 flow [2022-12-13 01:27:50,632 INFO L226 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-13 01:27:50,633 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:27:50,633 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 01:27:50,633 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 16 transitions, 63 flow [2022-12-13 01:27:50,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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:27:50,633 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:27:50,633 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:27:50,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 01:27:50,634 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:27:50,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:27:50,634 INFO L85 PathProgramCache]: Analyzing trace with hash -580947556, now seen corresponding path program 4 times [2022-12-13 01:27:50,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:27:50,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604939] [2022-12-13 01:27:50,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:27:50,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:27:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:27:51,212 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:27:51,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:27:51,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604939] [2022-12-13 01:27:51,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:27:51,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:27:51,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:27:51,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954665306] [2022-12-13 01:27:51,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:27:51,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:27:51,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:27:51,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:27:51,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:27:51,214 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 01:27:51,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 16 transitions, 63 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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:27:51,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:27:51,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 01:27:51,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:27:51,398 INFO L130 PetriNetUnfolder]: 11/37 cut-off events. [2022-12-13 01:27:51,398 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-13 01:27:51,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 37 events. 11/37 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 127. Up to 12 conditions per place. [2022-12-13 01:27:51,399 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 0 selfloop transitions, 0 changer transitions 26/26 dead transitions. [2022-12-13 01:27:51,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 26 transitions, 137 flow [2022-12-13 01:27:51,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:27:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:27:51,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-12-13 01:27:51,399 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28125 [2022-12-13 01:27:51,399 INFO L175 Difference]: Start difference. First operand has 32 places, 16 transitions, 63 flow. Second operand 6 states and 27 transitions. [2022-12-13 01:27:51,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 26 transitions, 137 flow [2022-12-13 01:27:51,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 120 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-13 01:27:51,400 INFO L231 Difference]: Finished difference. Result has 30 places, 0 transitions, 0 flow [2022-12-13 01:27:51,400 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=43, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=30, PETRI_TRANSITIONS=0} [2022-12-13 01:27:51,401 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2022-12-13 01:27:51,401 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:27:51,401 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 0 transitions, 0 flow [2022-12-13 01:27:51,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 01:27:51,401 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 01:27:51,401 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:27:51,402 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:27:51,402 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 01:27:51,402 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 01:27:51,402 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:27:51,402 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-13 01:27:51,402 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 01:27:51,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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:27:51,404 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 01:27:51,405 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 01:27:51,405 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 01:27:51,405 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 01:27:51,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 01:27:51,405 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1] [2022-12-13 01:27:51,407 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 01:27:51,407 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 01:27:51,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:27:51 BasicIcfg [2022-12-13 01:27:51,409 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 01:27:51,410 INFO L158 Benchmark]: Toolchain (without parser) took 14694.90ms. Allocated memory was 183.5MB in the beginning and 323.0MB in the end (delta: 139.5MB). Free memory was 140.6MB in the beginning and 159.3MB in the end (delta: -18.7MB). Peak memory consumption was 121.5MB. Max. memory is 8.0GB. [2022-12-13 01:27:51,410 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 127.9MB. Free memory was 106.2MB in the beginning and 106.0MB in the end (delta: 139.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 01:27:51,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.48ms. Allocated memory is still 183.5MB. Free memory was 140.6MB in the beginning and 129.0MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 01:27:51,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.73ms. Allocated memory is still 183.5MB. Free memory was 129.0MB in the beginning and 163.0MB in the end (delta: -34.1MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. [2022-12-13 01:27:51,410 INFO L158 Benchmark]: Boogie Preprocessor took 33.00ms. Allocated memory is still 183.5MB. Free memory was 163.0MB in the beginning and 161.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 01:27:51,411 INFO L158 Benchmark]: RCFGBuilder took 468.39ms. Allocated memory is still 183.5MB. Free memory was 161.4MB in the beginning and 140.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-13 01:27:51,411 INFO L158 Benchmark]: TraceAbstraction took 13901.61ms. Allocated memory was 183.5MB in the beginning and 323.0MB in the end (delta: 139.5MB). Free memory was 139.4MB in the beginning and 159.3MB in the end (delta: -19.9MB). Peak memory consumption was 119.6MB. Max. memory is 8.0GB. [2022-12-13 01:27:51,412 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.10ms. Allocated memory is still 127.9MB. Free memory was 106.2MB in the beginning and 106.0MB in the end (delta: 139.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.48ms. Allocated memory is still 183.5MB. Free memory was 140.6MB in the beginning and 129.0MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.73ms. Allocated memory is still 183.5MB. Free memory was 129.0MB in the beginning and 163.0MB in the end (delta: -34.1MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.00ms. Allocated memory is still 183.5MB. Free memory was 163.0MB in the beginning and 161.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 468.39ms. Allocated memory is still 183.5MB. Free memory was 161.4MB in the beginning and 140.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 13901.61ms. Allocated memory was 183.5MB in the beginning and 323.0MB in the end (delta: 139.5MB). Free memory was 139.4MB in the beginning and 159.3MB in the end (delta: -19.9MB). Peak memory consumption was 119.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.3s, 229 PlacesBefore, 26 PlacesAfterwards, 233 TransitionsBefore, 16 TransitionsAfterwards, 16638 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 65 TrivialYvCompositions, 138 ConcurrentYvCompositions, 14 ChoiceCompositions, 217 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10361, independent: 10361, independent conditional: 10361, 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: 10361, independent: 10361, independent conditional: 0, independent unconditional: 10361, 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: 10361, independent: 10361, independent conditional: 0, independent unconditional: 10361, 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: 10361, independent: 10361, independent conditional: 0, independent unconditional: 10361, 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: 9035, independent: 9035, independent conditional: 0, independent unconditional: 9035, 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: 9035, independent: 9035, independent conditional: 0, independent unconditional: 9035, 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: 10361, independent: 1326, independent conditional: 0, independent unconditional: 1326, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9035, unknown conditional: 0, unknown unconditional: 9035] , Statistics on independence cache: Total cache size (in pairs): 19456, Positive cache size: 19456, Positive conditional cache size: 0, Positive unconditional cache size: 19456, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.6s, 27 PlacesBefore, 28 PlacesAfterwards, 20 TransitionsBefore, 21 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.6s, 34 PlacesBefore, 35 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 15, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 5, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 42 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): 11, Positive cache size: 11, Positive conditional cache size: 5, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 32 PlacesBefore, 32 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 22 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): 11, Positive cache size: 11, Positive conditional cache size: 5, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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): 11, Positive cache size: 11, Positive conditional cache size: 5, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 89]: 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 7 procedures, 368 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: 13.7s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 128 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 128 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 391 IncrementalHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 0 mSDtfsCounter, 391 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=2, InterpolantAutomatonStates: 29, 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.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 2567 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 01:27:51,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...